./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-88.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 9f13b6ec153b424c9c18800ebe21aa9579fe753fb31fef85cd6c1089c45b899c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:34:01,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:34:01,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:34:01,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:34:01,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:34:01,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:34:01,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:34:01,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:34:01,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:34:01,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:34:01,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:34:01,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:34:01,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:34:01,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:34:01,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:34:01,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:34:01,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:34:01,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:34:01,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:34:01,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:34:01,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:34:01,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:34:01,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:34:01,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:34:01,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:34:01,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:34:01,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:34:01,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:34:01,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:34:01,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:34:01,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:34:01,681 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 -> 9f13b6ec153b424c9c18800ebe21aa9579fe753fb31fef85cd6c1089c45b899c [2025-03-08 16:34:01,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:34:01,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:34:01,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:34:01,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:34:01,917 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:34:01,918 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-88.i [2025-03-08 16:34:03,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b7e1b6d/57789bbb392a498d9011fd33b6eb560b/FLAG21a3315c6 [2025-03-08 16:34:03,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:34:03,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-08 16:34:03,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b7e1b6d/57789bbb392a498d9011fd33b6eb560b/FLAG21a3315c6 [2025-03-08 16:34:03,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b7e1b6d/57789bbb392a498d9011fd33b6eb560b [2025-03-08 16:34:03,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:34:03,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:34:03,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:34:03,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:34:03,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:34:03,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03, skipping insertion in model container [2025-03-08 16:34:03,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:34:03,769 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-88.i[917,930] [2025-03-08 16:34:03,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:34:03,826 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:34:03,833 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-88.i[917,930] [2025-03-08 16:34:03,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:34:03,879 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:34:03,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03 WrapperNode [2025-03-08 16:34:03,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:34:03,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:34:03,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:34:03,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:34:03,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,912 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 544 [2025-03-08 16:34:03,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:34:03,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:34:03,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:34:03,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:34:03,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,949 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2025-03-08 16:34:03,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:34:03,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:34:03,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:34:03,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:34:03,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (1/1) ... [2025-03-08 16:34:03,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:34:03,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:04,002 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-08 16:34:04,005 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-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-08 16:34:04,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:34:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:34:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:34:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:34:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:34:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-08 16:34:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-08 16:34:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:34:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:34:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:34:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:34:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:34:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-08 16:34:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-08 16:34:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:34:04,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:34:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:34:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:34:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:34:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:34:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:34:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:34:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:34:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 16:34:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:34:04,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:34:04,163 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:34:04,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:34:04,486 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~bitwise79#1;havoc property_#t~mem80#1;havoc property_#t~short81#1;havoc property_#t~ite92#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-08 16:34:04,523 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-03-08 16:34:04,523 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:34:04,537 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:34:04,537 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:34:04,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:04 BoogieIcfgContainer [2025-03-08 16:34:04,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:34:04,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:34:04,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:34:04,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:34:04,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:34:03" (1/3) ... [2025-03-08 16:34:04,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8541cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:04, skipping insertion in model container [2025-03-08 16:34:04,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:03" (2/3) ... [2025-03-08 16:34:04,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8541cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:04, skipping insertion in model container [2025-03-08 16:34:04,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:04" (3/3) ... [2025-03-08 16:34:04,548 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-08 16:34:04,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:34:04,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-88.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:34:04,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:34:04,619 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;@b1995e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:34:04,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:34:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:34:04,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:04,633 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:04,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:04,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash -820715542, now seen corresponding path program 1 times [2025-03-08 16:34:04,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:04,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765975068] [2025-03-08 16:34:04,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:04,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:04,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:34:04,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:34:04,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:04,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:34:04,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:04,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765975068] [2025-03-08 16:34:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765975068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667923929] [2025-03-08 16:34:04,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:04,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:04,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:04,960 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-08 16:34:04,968 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-08 16:34:05,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:34:05,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:34:05,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:05,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:05,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:34:05,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:34:05,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667923929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:05,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:34:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803168731] [2025-03-08 16:34:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:05,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:34:05,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:05,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:34:05,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:34:05,242 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 99 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:34:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:05,267 INFO L93 Difference]: Finished difference Result 230 states and 358 transitions. [2025-03-08 16:34:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:34:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-03-08 16:34:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:05,275 INFO L225 Difference]: With dead ends: 230 [2025-03-08 16:34:05,275 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 16:34:05,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-08 16:34:05,279 INFO L435 NwaCegarLoop]: 166 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, 166 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-08 16:34:05,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 16:34:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 16:34:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-03-08 16:34:05,319 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2025-03-08 16:34:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:05,319 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-03-08 16:34:05,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:34:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-03-08 16:34:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:34:05,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:05,321 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:05,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:34:05,522 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-08 16:34:05,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:05,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1385401869, now seen corresponding path program 1 times [2025-03-08 16:34:05,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:05,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224672483] [2025-03-08 16:34:05,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:05,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:05,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:34:05,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:34:05,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:05,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:05,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224672483] [2025-03-08 16:34:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224672483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:05,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:34:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066857713] [2025-03-08 16:34:05,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:05,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:34:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:05,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:34:05,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:05,871 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:05,918 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-08 16:34:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:05,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:34:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:05,923 INFO L225 Difference]: With dead ends: 230 [2025-03-08 16:34:05,923 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 16:34:05,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:05,924 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:05,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 16:34:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-08 16:34:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-08 16:34:05,940 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2025-03-08 16:34:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:05,941 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-08 16:34:05,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-08 16:34:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:34:05,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:05,944 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:05,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:34:05,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:05,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:05,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1102110964, now seen corresponding path program 1 times [2025-03-08 16:34:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:05,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803532877] [2025-03-08 16:34:05,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:05,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:05,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:34:05,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:34:05,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:05,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:06,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:06,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803532877] [2025-03-08 16:34:06,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803532877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:06,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:06,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:34:06,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051527621] [2025-03-08 16:34:06,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:06,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:34:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:06,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:34:06,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:06,110 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:06,145 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2025-03-08 16:34:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:06,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:34:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:06,148 INFO L225 Difference]: With dead ends: 234 [2025-03-08 16:34:06,149 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 16:34:06,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:06,150 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:06,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 16:34:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-08 16:34:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-08 16:34:06,161 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2025-03-08 16:34:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:06,162 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-08 16:34:06,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-08 16:34:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:34:06,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:06,165 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:06,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:34:06,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:06,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1989614645, now seen corresponding path program 1 times [2025-03-08 16:34:06,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:06,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489184877] [2025-03-08 16:34:06,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:06,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:34:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:34:06,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:06,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489184877] [2025-03-08 16:34:06,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489184877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:06,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:06,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:34:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565068597] [2025-03-08 16:34:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:06,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:34:06,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:06,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:34:06,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:06,313 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:06,340 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2025-03-08 16:34:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:06,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:34:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:06,344 INFO L225 Difference]: With dead ends: 238 [2025-03-08 16:34:06,344 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 16:34:06,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:06,345 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:06,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 16:34:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-08 16:34:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2025-03-08 16:34:06,352 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2025-03-08 16:34:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:06,352 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2025-03-08 16:34:06,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2025-03-08 16:34:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:34:06,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:06,355 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:06,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:34:06,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:06,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:06,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1990538166, now seen corresponding path program 1 times [2025-03-08 16:34:06,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:06,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414424572] [2025-03-08 16:34:06,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:06,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:34:06,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:34:06,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:06,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414424572] [2025-03-08 16:34:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414424572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:06,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:34:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665190057] [2025-03-08 16:34:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:06,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:34:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:06,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:34:06,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:06,898 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:07,118 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2025-03-08 16:34:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:34:07,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:34:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:07,120 INFO L225 Difference]: With dead ends: 322 [2025-03-08 16:34:07,121 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 16:34:07,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:34:07,122 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 294 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:07,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 566 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 16:34:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2025-03-08 16:34:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.3863636363636365) internal successors, (244), 177 states have internal predecessors, (244), 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-08 16:34:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 288 transitions. [2025-03-08 16:34:07,148 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 288 transitions. Word has length 143 [2025-03-08 16:34:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:07,148 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 288 transitions. [2025-03-08 16:34:07,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 288 transitions. [2025-03-08 16:34:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:34:07,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:07,152 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:07,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:34:07,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:07,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1788538224, now seen corresponding path program 1 times [2025-03-08 16:34:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:07,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169870035] [2025-03-08 16:34:07,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:07,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:34:07,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:34:07,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:07,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:34:07,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169870035] [2025-03-08 16:34:07,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169870035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063409570] [2025-03-08 16:34:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:07,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:07,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:07,402 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-08 16:34:07,403 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-08 16:34:07,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:34:07,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:34:07,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:07,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:07,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:34:07,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:07,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:07,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063409570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:07,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:07,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:34:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847966180] [2025-03-08 16:34:07,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:07,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:07,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:07,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:07,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:34:07,692 INFO L87 Difference]: Start difference. First operand 201 states and 288 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:07,731 INFO L93 Difference]: Finished difference Result 405 states and 581 transitions. [2025-03-08 16:34:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:07,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-08 16:34:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:07,734 INFO L225 Difference]: With dead ends: 405 [2025-03-08 16:34:07,734 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 16:34:07,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:34:07,735 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:07,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 16:34:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-08 16:34:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 183 states have internal predecessors, (250), 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-08 16:34:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 294 transitions. [2025-03-08 16:34:07,751 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 294 transitions. Word has length 145 [2025-03-08 16:34:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:07,751 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 294 transitions. [2025-03-08 16:34:07,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 294 transitions. [2025-03-08 16:34:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:34:07,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:07,752 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:07,759 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-08 16:34:07,953 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,SelfDestructingSolverStorable5 [2025-03-08 16:34:07,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:07,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash -606989356, now seen corresponding path program 1 times [2025-03-08 16:34:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:07,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816927202] [2025-03-08 16:34:07,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:07,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:34:07,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:34:07,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:07,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816927202] [2025-03-08 16:34:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816927202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:34:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032246014] [2025-03-08 16:34:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:08,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:34:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:08,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:34:08,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:34:08,706 INFO L87 Difference]: Start difference. First operand 207 states and 294 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:34:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:08,960 INFO L93 Difference]: Finished difference Result 434 states and 616 transitions. [2025-03-08 16:34:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:34:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2025-03-08 16:34:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:08,962 INFO L225 Difference]: With dead ends: 434 [2025-03-08 16:34:08,962 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 16:34:08,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:34:08,963 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 248 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:08,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 575 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 16:34:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2025-03-08 16:34:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 122 states have internal predecessors, (162), 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-08 16:34:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 206 transitions. [2025-03-08 16:34:08,974 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 206 transitions. Word has length 145 [2025-03-08 16:34:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:08,974 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 206 transitions. [2025-03-08 16:34:08,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:34:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 206 transitions. [2025-03-08 16:34:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:34:08,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:08,975 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:08,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:34:08,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:08,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash 97676083, now seen corresponding path program 1 times [2025-03-08 16:34:08,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:08,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721221008] [2025-03-08 16:34:08,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:08,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:34:09,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:34:09,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:09,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:09,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:09,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721221008] [2025-03-08 16:34:09,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721221008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:09,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:09,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:34:09,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203366817] [2025-03-08 16:34:09,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:09,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:34:09,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:09,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:34:09,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:34:09,372 INFO L87 Difference]: Start difference. First operand 146 states and 206 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:09,604 INFO L93 Difference]: Finished difference Result 359 states and 504 transitions. [2025-03-08 16:34:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:34:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 16:34:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:09,606 INFO L225 Difference]: With dead ends: 359 [2025-03-08 16:34:09,606 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 16:34:09,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:34:09,607 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 289 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:09,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 718 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 16:34:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 167. [2025-03-08 16:34:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 143 states have internal predecessors, (195), 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-08 16:34:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 239 transitions. [2025-03-08 16:34:09,618 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 239 transitions. Word has length 146 [2025-03-08 16:34:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:09,618 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 239 transitions. [2025-03-08 16:34:09,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 239 transitions. [2025-03-08 16:34:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:34:09,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:09,621 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:09,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:34:09,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:09,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash -550674158, now seen corresponding path program 1 times [2025-03-08 16:34:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390495631] [2025-03-08 16:34:09,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:09,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:34:09,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:34:09,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:09,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:09,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:09,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390495631] [2025-03-08 16:34:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390495631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:09,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:09,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:34:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688015819] [2025-03-08 16:34:09,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:09,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:34:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:09,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:34:09,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:09,927 INFO L87 Difference]: Start difference. First operand 167 states and 239 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:10,087 INFO L93 Difference]: Finished difference Result 444 states and 637 transitions. [2025-03-08 16:34:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-03-08 16:34:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:10,089 INFO L225 Difference]: With dead ends: 444 [2025-03-08 16:34:10,089 INFO L226 Difference]: Without dead ends: 296 [2025-03-08 16:34:10,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:34:10,090 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 158 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:10,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 448 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-08 16:34:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2025-03-08 16:34:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 199 states have (on average 1.35678391959799) internal successors, (270), 199 states have internal predecessors, (270), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:34:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 338 transitions. [2025-03-08 16:34:10,111 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 338 transitions. Word has length 147 [2025-03-08 16:34:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:10,111 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 338 transitions. [2025-03-08 16:34:10,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 338 transitions. [2025-03-08 16:34:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:34:10,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:10,113 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:10,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:34:10,116 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:10,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash 338399766, now seen corresponding path program 1 times [2025-03-08 16:34:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:10,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732193744] [2025-03-08 16:34:10,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:10,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:34:10,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:34:10,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:10,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:10,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:10,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732193744] [2025-03-08 16:34:10,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732193744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:10,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:10,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:34:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588169950] [2025-03-08 16:34:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:10,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:10,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:10,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:10,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:34:10,403 INFO L87 Difference]: Start difference. First operand 237 states and 338 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:10,464 INFO L93 Difference]: Finished difference Result 508 states and 728 transitions. [2025-03-08 16:34:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-08 16:34:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:10,467 INFO L225 Difference]: With dead ends: 508 [2025-03-08 16:34:10,467 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 16:34:10,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:10,467 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 140 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:10,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 504 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 16:34:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 322. [2025-03-08 16:34:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 284 states have (on average 1.4014084507042253) internal successors, (398), 284 states have internal predecessors, (398), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:34:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 466 transitions. [2025-03-08 16:34:10,489 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 466 transitions. Word has length 151 [2025-03-08 16:34:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:10,489 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 466 transitions. [2025-03-08 16:34:10,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 466 transitions. [2025-03-08 16:34:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:34:10,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:10,490 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:10,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:34:10,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:10,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2006267275, now seen corresponding path program 1 times [2025-03-08 16:34:10,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:10,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742477412] [2025-03-08 16:34:10,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:10,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:34:10,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:34:10,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:10,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:10,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:10,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742477412] [2025-03-08 16:34:10,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742477412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:10,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:10,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:34:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427723761] [2025-03-08 16:34:10,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:10,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:34:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:10,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:34:10,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:10,712 INFO L87 Difference]: Start difference. First operand 322 states and 466 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:10,889 INFO L93 Difference]: Finished difference Result 634 states and 917 transitions. [2025-03-08 16:34:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:34:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-08 16:34:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:10,891 INFO L225 Difference]: With dead ends: 634 [2025-03-08 16:34:10,891 INFO L226 Difference]: Without dead ends: 399 [2025-03-08 16:34:10,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:34:10,892 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 157 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:10,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 747 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-08 16:34:10,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 321. [2025-03-08 16:34:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 283 states have (on average 1.3957597173144876) internal successors, (395), 283 states have internal predecessors, (395), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:34:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2025-03-08 16:34:10,927 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 463 transitions. Word has length 151 [2025-03-08 16:34:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:10,928 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 463 transitions. [2025-03-08 16:34:10,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 463 transitions. [2025-03-08 16:34:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:34:10,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:10,929 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:10,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:34:10,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:10,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1026697403, now seen corresponding path program 1 times [2025-03-08 16:34:10,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:10,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591887819] [2025-03-08 16:34:10,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:10,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:34:11,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:34:11,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:11,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591887819] [2025-03-08 16:34:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591887819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:12,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:34:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593568731] [2025-03-08 16:34:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:12,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:34:12,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:12,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:34:12,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:34:12,145 INFO L87 Difference]: Start difference. First operand 321 states and 463 transitions. Second operand has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 16:34:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:12,588 INFO L93 Difference]: Finished difference Result 662 states and 948 transitions. [2025-03-08 16:34:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:34:12,588 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 152 [2025-03-08 16:34:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:12,590 INFO L225 Difference]: With dead ends: 662 [2025-03-08 16:34:12,590 INFO L226 Difference]: Without dead ends: 462 [2025-03-08 16:34:12,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:34:12,591 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 269 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:12,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1117 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:34:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-08 16:34:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2025-03-08 16:34:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 408 states have (on average 1.3799019607843137) internal successors, (563), 409 states have internal predecessors, (563), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:34:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 653 transitions. [2025-03-08 16:34:12,644 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 653 transitions. Word has length 152 [2025-03-08 16:34:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:12,644 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 653 transitions. [2025-03-08 16:34:12,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 16:34:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 653 transitions. [2025-03-08 16:34:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:34:12,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:12,647 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:12,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:34:12,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:12,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1765893585, now seen corresponding path program 1 times [2025-03-08 16:34:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077046903] [2025-03-08 16:34:12,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:12,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:34:12,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:34:12,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:12,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077046903] [2025-03-08 16:34:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077046903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:13,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:34:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718559213] [2025-03-08 16:34:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:13,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:34:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:13,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:34:13,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:34:13,260 INFO L87 Difference]: Start difference. First operand 459 states and 653 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:34:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:13,570 INFO L93 Difference]: Finished difference Result 785 states and 1123 transitions. [2025-03-08 16:34:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:34:13,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2025-03-08 16:34:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:13,573 INFO L225 Difference]: With dead ends: 785 [2025-03-08 16:34:13,573 INFO L226 Difference]: Without dead ends: 459 [2025-03-08 16:34:13,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:34:13,574 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 440 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:13,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 683 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-08 16:34:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 355. [2025-03-08 16:34:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 304 states have (on average 1.3388157894736843) internal successors, (407), 305 states have internal predecessors, (407), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:34:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 497 transitions. [2025-03-08 16:34:13,607 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 497 transitions. Word has length 152 [2025-03-08 16:34:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:13,609 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 497 transitions. [2025-03-08 16:34:13,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:34:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 497 transitions. [2025-03-08 16:34:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 16:34:13,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:13,611 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:13,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:34:13,611 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:13,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1394331539, now seen corresponding path program 1 times [2025-03-08 16:34:13,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:13,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384073250] [2025-03-08 16:34:13,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:13,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:13,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 16:34:13,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 16:34:13,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:13,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:13,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384073250] [2025-03-08 16:34:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384073250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:13,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:13,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:34:13,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825361827] [2025-03-08 16:34:13,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:13,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:13,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:13,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:34:13,852 INFO L87 Difference]: Start difference. First operand 355 states and 497 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:13,947 INFO L93 Difference]: Finished difference Result 752 states and 1051 transitions. [2025-03-08 16:34:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:13,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2025-03-08 16:34:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:13,949 INFO L225 Difference]: With dead ends: 752 [2025-03-08 16:34:13,949 INFO L226 Difference]: Without dead ends: 479 [2025-03-08 16:34:13,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:13,951 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 174 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:13,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 609 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-08 16:34:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 357. [2025-03-08 16:34:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 306 states have (on average 1.3333333333333333) internal successors, (408), 307 states have internal predecessors, (408), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:34:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 498 transitions. [2025-03-08 16:34:13,997 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 498 transitions. Word has length 153 [2025-03-08 16:34:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:13,998 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 498 transitions. [2025-03-08 16:34:13,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 498 transitions. [2025-03-08 16:34:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:34:13,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:13,999 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:13,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:34:14,000 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:14,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1723634563, now seen corresponding path program 1 times [2025-03-08 16:34:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:14,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687105398] [2025-03-08 16:34:14,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:14,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:14,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:34:14,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:34:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687105398] [2025-03-08 16:34:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687105398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:34:14,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231950848] [2025-03-08 16:34:14,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:34:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:14,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:34:14,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:34:14,067 INFO L87 Difference]: Start difference. First operand 357 states and 498 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:14,102 INFO L93 Difference]: Finished difference Result 629 states and 880 transitions. [2025-03-08 16:34:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:34:14,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-08 16:34:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:14,104 INFO L225 Difference]: With dead ends: 629 [2025-03-08 16:34:14,104 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 16:34:14,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:34:14,105 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:14,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 16:34:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-08 16:34:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 310 states have (on average 1.3290322580645162) internal successors, (412), 311 states have internal predecessors, (412), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:34:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 502 transitions. [2025-03-08 16:34:14,136 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 502 transitions. Word has length 154 [2025-03-08 16:34:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:14,136 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 502 transitions. [2025-03-08 16:34:14,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 502 transitions. [2025-03-08 16:34:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:34:14,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:14,139 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:14,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:34:14,139 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1337199449, now seen corresponding path program 1 times [2025-03-08 16:34:14,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288626246] [2025-03-08 16:34:14,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:14,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:34:14,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:34:14,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:14,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:14,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:14,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288626246] [2025-03-08 16:34:14,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288626246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:14,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:14,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:34:14,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901222956] [2025-03-08 16:34:14,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:14,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:34:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:14,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:34:14,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:34:14,211 INFO L87 Difference]: Start difference. First operand 361 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:14,248 INFO L93 Difference]: Finished difference Result 623 states and 870 transitions. [2025-03-08 16:34:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:34:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-08 16:34:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:14,251 INFO L225 Difference]: With dead ends: 623 [2025-03-08 16:34:14,251 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 16:34:14,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:34:14,251 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:14,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 16:34:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-03-08 16:34:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 312 states have (on average 1.3269230769230769) internal successors, (414), 313 states have internal predecessors, (414), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:34:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 504 transitions. [2025-03-08 16:34:14,280 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 504 transitions. Word has length 154 [2025-03-08 16:34:14,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:14,280 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 504 transitions. [2025-03-08 16:34:14,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 504 transitions. [2025-03-08 16:34:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:34:14,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:14,282 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:14,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:34:14,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1548993052, now seen corresponding path program 1 times [2025-03-08 16:34:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788220109] [2025-03-08 16:34:14,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:14,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:34:14,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:34:14,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:14,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:14,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:14,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788220109] [2025-03-08 16:34:14,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788220109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:14,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:14,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:34:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289712472] [2025-03-08 16:34:14,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:14,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:34:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:14,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:34:14,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:34:14,987 INFO L87 Difference]: Start difference. First operand 363 states and 504 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 16:34:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:15,287 INFO L93 Difference]: Finished difference Result 379 states and 519 transitions. [2025-03-08 16:34:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:34:15,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 154 [2025-03-08 16:34:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:15,290 INFO L225 Difference]: With dead ends: 379 [2025-03-08 16:34:15,290 INFO L226 Difference]: Without dead ends: 377 [2025-03-08 16:34:15,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:34:15,291 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 213 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:15,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 963 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-08 16:34:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-08 16:34:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 324 states have (on average 1.3148148148148149) internal successors, (426), 325 states have internal predecessors, (426), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:34:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 516 transitions. [2025-03-08 16:34:15,327 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 516 transitions. Word has length 154 [2025-03-08 16:34:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:15,327 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 516 transitions. [2025-03-08 16:34:15,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 16:34:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 516 transitions. [2025-03-08 16:34:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:34:15,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:15,330 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:15,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:34:15,330 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:15,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1549916573, now seen corresponding path program 1 times [2025-03-08 16:34:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:15,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356903969] [2025-03-08 16:34:15,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:15,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:34:15,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:34:15,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:15,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:34:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356903969] [2025-03-08 16:34:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356903969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926800802] [2025-03-08 16:34:16,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:16,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:16,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:16,209 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-08 16:34:16,210 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-08 16:34:16,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:34:16,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:34:16,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:16,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:16,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 16:34:16,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:17,193 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-08 16:34:17,413 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-08 16:34:17,736 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-08 16:34:18,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:18,031 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-08 16:34:18,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:34:18,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:18,449 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 16:34:18,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2025-03-08 16:34:18,552 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-08 16:34:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 57 proven. 350 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-08 16:34:18,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:34:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926800802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:18,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:34:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2025-03-08 16:34:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129175806] [2025-03-08 16:34:18,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:34:18,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 16:34:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:18,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 16:34:18,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:34:18,734 INFO L87 Difference]: Start difference. First operand 377 states and 516 transitions. Second operand has 22 states, 19 states have (on average 6.631578947368421) internal successors, (126), 22 states have internal predecessors, (126), 12 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-08 16:34:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:19,996 INFO L93 Difference]: Finished difference Result 987 states and 1338 transitions. [2025-03-08 16:34:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:34:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.631578947368421) internal successors, (126), 22 states have internal predecessors, (126), 12 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) Word has length 154 [2025-03-08 16:34:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:20,000 INFO L225 Difference]: With dead ends: 987 [2025-03-08 16:34:20,000 INFO L226 Difference]: Without dead ends: 697 [2025-03-08 16:34:20,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 16:34:20,003 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 268 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:20,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1523 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:34:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-08 16:34:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 669. [2025-03-08 16:34:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 580 states have (on average 1.313793103448276) internal successors, (762), 582 states have internal predecessors, (762), 73 states have call successors, (73), 15 states have call predecessors, (73), 15 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 16:34:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 908 transitions. [2025-03-08 16:34:20,059 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 908 transitions. Word has length 154 [2025-03-08 16:34:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:20,059 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 908 transitions. [2025-03-08 16:34:20,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.631578947368421) internal successors, (126), 22 states have internal predecessors, (126), 12 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-08 16:34:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 908 transitions. [2025-03-08 16:34:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:34:20,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:20,061 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:20,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:34:20,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 16:34:20,262 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:20,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash 762612849, now seen corresponding path program 1 times [2025-03-08 16:34:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:20,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123118621] [2025-03-08 16:34:20,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:20,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:20,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:34:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:34:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:20,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:20,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123118621] [2025-03-08 16:34:20,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123118621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:20,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:20,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:34:20,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134338657] [2025-03-08 16:34:20,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:20,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:20,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:20,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:34:20,482 INFO L87 Difference]: Start difference. First operand 669 states and 908 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:20,584 INFO L93 Difference]: Finished difference Result 1078 states and 1467 transitions. [2025-03-08 16:34:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:20,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2025-03-08 16:34:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:20,588 INFO L225 Difference]: With dead ends: 1078 [2025-03-08 16:34:20,589 INFO L226 Difference]: Without dead ends: 802 [2025-03-08 16:34:20,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:20,590 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 74 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:20,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 726 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-08 16:34:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 697. [2025-03-08 16:34:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 608 states have (on average 1.3207236842105263) internal successors, (803), 610 states have internal predecessors, (803), 73 states have call successors, (73), 15 states have call predecessors, (73), 15 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 16:34:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 949 transitions. [2025-03-08 16:34:20,639 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 949 transitions. Word has length 155 [2025-03-08 16:34:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:20,639 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 949 transitions. [2025-03-08 16:34:20,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 949 transitions. [2025-03-08 16:34:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:34:20,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:20,640 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:20,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:34:20,641 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:20,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1275443440, now seen corresponding path program 1 times [2025-03-08 16:34:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356971883] [2025-03-08 16:34:20,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:20,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:34:20,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:34:20,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:20,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356971883] [2025-03-08 16:34:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356971883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:34:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252442863] [2025-03-08 16:34:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:34:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:20,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:34:20,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:34:20,804 INFO L87 Difference]: Start difference. First operand 697 states and 949 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:20,968 INFO L93 Difference]: Finished difference Result 1497 states and 2031 transitions. [2025-03-08 16:34:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:34:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2025-03-08 16:34:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:20,972 INFO L225 Difference]: With dead ends: 1497 [2025-03-08 16:34:20,972 INFO L226 Difference]: Without dead ends: 923 [2025-03-08 16:34:20,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:34:20,973 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 237 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:20,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 773 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-08 16:34:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 715. [2025-03-08 16:34:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 626 states have (on average 1.3115015974440896) internal successors, (821), 628 states have internal predecessors, (821), 73 states have call successors, (73), 15 states have call predecessors, (73), 15 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 16:34:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2025-03-08 16:34:21,028 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 155 [2025-03-08 16:34:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:21,028 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2025-03-08 16:34:21,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2025-03-08 16:34:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 16:34:21,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:21,030 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:21,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:34:21,030 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:21,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1722838593, now seen corresponding path program 1 times [2025-03-08 16:34:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915893116] [2025-03-08 16:34:21,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:21,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:34:21,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:34:21,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:21,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915893116] [2025-03-08 16:34:21,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915893116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:21,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:21,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:34:21,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520678707] [2025-03-08 16:34:21,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:34:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:21,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:34:21,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:34:21,964 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 15 states have internal predecessors, (74), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-08 16:34:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:22,846 INFO L93 Difference]: Finished difference Result 1564 states and 2115 transitions. [2025-03-08 16:34:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:34:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 15 states have internal predecessors, (74), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 156 [2025-03-08 16:34:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:22,852 INFO L225 Difference]: With dead ends: 1564 [2025-03-08 16:34:22,852 INFO L226 Difference]: Without dead ends: 990 [2025-03-08 16:34:22,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:34:22,855 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 558 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:22,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1172 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:34:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-08 16:34:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 845. [2025-03-08 16:34:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 755 states have (on average 1.3245033112582782) internal successors, (1000), 757 states have internal predecessors, (1000), 73 states have call successors, (73), 16 states have call predecessors, (73), 16 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 16:34:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1146 transitions. [2025-03-08 16:34:22,937 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1146 transitions. Word has length 156 [2025-03-08 16:34:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:22,937 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1146 transitions. [2025-03-08 16:34:22,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 15 states have internal predecessors, (74), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-08 16:34:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1146 transitions. [2025-03-08 16:34:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 16:34:22,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:22,939 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:22,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:34:22,940 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:22,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2642304, now seen corresponding path program 1 times [2025-03-08 16:34:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635954272] [2025-03-08 16:34:22,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:22,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:34:22,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:34:22,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:22,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:23,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635954272] [2025-03-08 16:34:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635954272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:23,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:34:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970486117] [2025-03-08 16:34:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:23,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:34:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:23,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:34:23,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:34:23,331 INFO L87 Difference]: Start difference. First operand 845 states and 1146 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:34:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:23,579 INFO L93 Difference]: Finished difference Result 1367 states and 1862 transitions. [2025-03-08 16:34:23,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:23,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-08 16:34:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:23,582 INFO L225 Difference]: With dead ends: 1367 [2025-03-08 16:34:23,582 INFO L226 Difference]: Without dead ends: 667 [2025-03-08 16:34:23,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:34:23,584 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 249 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:23,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 645 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-08 16:34:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 655. [2025-03-08 16:34:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 578 states have (on average 1.3114186851211074) internal successors, (758), 579 states have internal predecessors, (758), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:34:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 882 transitions. [2025-03-08 16:34:23,629 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 882 transitions. Word has length 156 [2025-03-08 16:34:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:23,629 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 882 transitions. [2025-03-08 16:34:23,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:34:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 882 transitions. [2025-03-08 16:34:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 16:34:23,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:23,630 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:23,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:34:23,630 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:23,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1273779391, now seen corresponding path program 1 times [2025-03-08 16:34:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:23,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359901489] [2025-03-08 16:34:23,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:23,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 16:34:23,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 16:34:23,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:23,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359901489] [2025-03-08 16:34:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359901489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:34:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458889371] [2025-03-08 16:34:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:23,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:23,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:34:23,783 INFO L87 Difference]: Start difference. First operand 655 states and 882 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:23,866 INFO L93 Difference]: Finished difference Result 1087 states and 1462 transitions. [2025-03-08 16:34:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:23,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-08 16:34:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:23,869 INFO L225 Difference]: With dead ends: 1087 [2025-03-08 16:34:23,870 INFO L226 Difference]: Without dead ends: 757 [2025-03-08 16:34:23,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:23,873 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 158 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:23,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 486 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-08 16:34:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 627. [2025-03-08 16:34:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 550 states have (on average 1.3072727272727274) internal successors, (719), 551 states have internal predecessors, (719), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:34:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 843 transitions. [2025-03-08 16:34:23,933 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 843 transitions. Word has length 156 [2025-03-08 16:34:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 843 transitions. [2025-03-08 16:34:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 843 transitions. [2025-03-08 16:34:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:34:23,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:23,935 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:23,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:34:23,935 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1775810128, now seen corresponding path program 1 times [2025-03-08 16:34:23,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:23,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781707276] [2025-03-08 16:34:23,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:23,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:24,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:24,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 57 proven. 33 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-08 16:34:26,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:26,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781707276] [2025-03-08 16:34:26,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781707276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:26,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253270865] [2025-03-08 16:34:26,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:26,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:26,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:34:26,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:34:26,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:26,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:26,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:26,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:26,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 16:34:26,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:27,377 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-08 16:34:27,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:27,941 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 15 treesize of output 15 [2025-03-08 16:34:28,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2025-03-08 16:34:28,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:28,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:28,108 INFO L349 Elim1Store]: treesize reduction 36, result has 20.0 percent of original size [2025-03-08 16:34:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 70 [2025-03-08 16:34:28,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:28,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:28,147 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-08 16:34:28,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 39 [2025-03-08 16:34:29,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:34:29,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 166 treesize of output 254 [2025-03-08 16:34:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 16:34:30,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:34:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253270865] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:31,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:34:31,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [28, 13] total 41 [2025-03-08 16:34:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895380528] [2025-03-08 16:34:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:31,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:34:31,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:31,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:34:31,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1537, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 16:34:31,160 INFO L87 Difference]: Start difference. First operand 627 states and 843 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:31,629 INFO L93 Difference]: Finished difference Result 1157 states and 1565 transitions. [2025-03-08 16:34:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:34:31,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-03-08 16:34:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:31,632 INFO L225 Difference]: With dead ends: 1157 [2025-03-08 16:34:31,632 INFO L226 Difference]: Without dead ends: 855 [2025-03-08 16:34:31,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=1945, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 16:34:31,635 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 95 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:31,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1539 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-08 16:34:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 722. [2025-03-08 16:34:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 645 states have (on average 1.324031007751938) internal successors, (854), 646 states have internal predecessors, (854), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:34:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 978 transitions. [2025-03-08 16:34:31,713 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 978 transitions. Word has length 158 [2025-03-08 16:34:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:31,714 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 978 transitions. [2025-03-08 16:34:31,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 978 transitions. [2025-03-08 16:34:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:34:31,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:31,716 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:31,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:34:31,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:31,917 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:31,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1165847471, now seen corresponding path program 1 times [2025-03-08 16:34:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086529546] [2025-03-08 16:34:31,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:31,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:31,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:31,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:31,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:31,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:32,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086529546] [2025-03-08 16:34:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086529546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:32,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:32,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:34:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646741259] [2025-03-08 16:34:32,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:32,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:34:32,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:32,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:34:32,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:34:32,448 INFO L87 Difference]: Start difference. First operand 722 states and 978 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:34:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:32,781 INFO L93 Difference]: Finished difference Result 1213 states and 1651 transitions. [2025-03-08 16:34:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:34:32,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 158 [2025-03-08 16:34:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:32,784 INFO L225 Difference]: With dead ends: 1213 [2025-03-08 16:34:32,784 INFO L226 Difference]: Without dead ends: 841 [2025-03-08 16:34:32,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:34:32,785 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 348 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:32,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 760 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-08 16:34:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 722. [2025-03-08 16:34:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 645 states have (on average 1.3209302325581396) internal successors, (852), 646 states have internal predecessors, (852), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:34:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 976 transitions. [2025-03-08 16:34:32,834 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 976 transitions. Word has length 158 [2025-03-08 16:34:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:32,834 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 976 transitions. [2025-03-08 16:34:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:34:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 976 transitions. [2025-03-08 16:34:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:34:32,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:32,835 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:32,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:34:32,836 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:32,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2105575889, now seen corresponding path program 1 times [2025-03-08 16:34:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:32,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940316762] [2025-03-08 16:34:32,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:32,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:32,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:32,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:32,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940316762] [2025-03-08 16:34:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940316762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:33,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:34:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528114648] [2025-03-08 16:34:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:33,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:34:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:33,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:34:33,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:34:33,413 INFO L87 Difference]: Start difference. First operand 722 states and 976 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:34:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:33,751 INFO L93 Difference]: Finished difference Result 1265 states and 1722 transitions. [2025-03-08 16:34:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:34:33,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 158 [2025-03-08 16:34:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:33,754 INFO L225 Difference]: With dead ends: 1265 [2025-03-08 16:34:33,754 INFO L226 Difference]: Without dead ends: 893 [2025-03-08 16:34:33,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:34:33,755 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 591 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:33,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 558 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:33,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-08 16:34:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 766. [2025-03-08 16:34:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 688 states have (on average 1.3299418604651163) internal successors, (915), 689 states have internal predecessors, (915), 62 states have call successors, (62), 15 states have call predecessors, (62), 15 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:34:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1039 transitions. [2025-03-08 16:34:33,818 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1039 transitions. Word has length 158 [2025-03-08 16:34:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:33,818 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1039 transitions. [2025-03-08 16:34:33,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:34:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1039 transitions. [2025-03-08 16:34:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:34:33,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:33,819 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:33,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:34:33,820 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:33,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash -836081710, now seen corresponding path program 1 times [2025-03-08 16:34:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443354085] [2025-03-08 16:34:33,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:33,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:33,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:33,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:33,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:34:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443354085] [2025-03-08 16:34:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443354085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187187997] [2025-03-08 16:34:35,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:35,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:35,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:34:35,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:34:35,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:35,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:35,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:35,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 16:34:35,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:36,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-08 16:34:36,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:34:36,808 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 16:34:36,808 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 15 treesize of output 15 [2025-03-08 16:34:36,922 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-08 16:34:36,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 101 [2025-03-08 16:34:36,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:36,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:36,977 INFO L349 Elim1Store]: treesize reduction 78, result has 25.7 percent of original size [2025-03-08 16:34:36,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 100 [2025-03-08 16:34:37,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:37,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 16:34:37,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:34:37,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 69 [2025-03-08 16:34:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 298 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-08 16:34:37,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:34:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:37,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187187997] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:37,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:34:37,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22, 13] total 35 [2025-03-08 16:34:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847228303] [2025-03-08 16:34:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:37,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:34:37,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:37,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:34:37,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 16:34:37,900 INFO L87 Difference]: Start difference. First operand 766 states and 1039 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:38,320 INFO L93 Difference]: Finished difference Result 1311 states and 1786 transitions. [2025-03-08 16:34:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:34:38,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-03-08 16:34:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:38,323 INFO L225 Difference]: With dead ends: 1311 [2025-03-08 16:34:38,323 INFO L226 Difference]: Without dead ends: 899 [2025-03-08 16:34:38,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=1441, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 16:34:38,324 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 88 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:38,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1656 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:34:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-03-08 16:34:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 766. [2025-03-08 16:34:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 688 states have (on average 1.3299418604651163) internal successors, (915), 689 states have internal predecessors, (915), 62 states have call successors, (62), 15 states have call predecessors, (62), 15 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:34:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1039 transitions. [2025-03-08 16:34:38,379 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1039 transitions. Word has length 158 [2025-03-08 16:34:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:38,379 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1039 transitions. [2025-03-08 16:34:38,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1039 transitions. [2025-03-08 16:34:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:34:38,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:38,380 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:38,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 16:34:38,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 16:34:38,581 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:38,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash 857276487, now seen corresponding path program 1 times [2025-03-08 16:34:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:38,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128966746] [2025-03-08 16:34:38,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:38,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:38,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:38,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:38,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128966746] [2025-03-08 16:34:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128966746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:34:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626784549] [2025-03-08 16:34:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:38,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:34:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:38,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:34:38,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:34:38,890 INFO L87 Difference]: Start difference. First operand 766 states and 1039 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:39,338 INFO L93 Difference]: Finished difference Result 1804 states and 2450 transitions. [2025-03-08 16:34:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:34:39,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-03-08 16:34:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:39,342 INFO L225 Difference]: With dead ends: 1804 [2025-03-08 16:34:39,342 INFO L226 Difference]: Without dead ends: 1186 [2025-03-08 16:34:39,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:34:39,344 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 420 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:39,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1048 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:34:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-03-08 16:34:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 895. [2025-03-08 16:34:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 817 states have (on average 1.3365973072215422) internal successors, (1092), 818 states have internal predecessors, (1092), 62 states have call successors, (62), 15 states have call predecessors, (62), 15 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:34:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1216 transitions. [2025-03-08 16:34:39,401 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1216 transitions. Word has length 158 [2025-03-08 16:34:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:39,402 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1216 transitions. [2025-03-08 16:34:39,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1216 transitions. [2025-03-08 16:34:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:34:39,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:39,403 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:39,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:34:39,403 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:39,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash 940748103, now seen corresponding path program 1 times [2025-03-08 16:34:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124148134] [2025-03-08 16:34:39,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:39,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:39,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:39,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:39,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:39,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:39,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124148134] [2025-03-08 16:34:39,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124148134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:39,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:39,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:34:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921201269] [2025-03-08 16:34:39,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:39,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:39,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:39,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:34:39,550 INFO L87 Difference]: Start difference. First operand 895 states and 1216 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:39,682 INFO L93 Difference]: Finished difference Result 1724 states and 2356 transitions. [2025-03-08 16:34:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:39,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 158 [2025-03-08 16:34:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:39,685 INFO L225 Difference]: With dead ends: 1724 [2025-03-08 16:34:39,685 INFO L226 Difference]: Without dead ends: 995 [2025-03-08 16:34:39,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:39,687 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 129 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:39,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 473 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-08 16:34:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 895. [2025-03-08 16:34:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 817 states have (on average 1.3341493268053854) internal successors, (1090), 818 states have internal predecessors, (1090), 62 states have call successors, (62), 15 states have call predecessors, (62), 15 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 16:34:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1214 transitions. [2025-03-08 16:34:39,746 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1214 transitions. Word has length 158 [2025-03-08 16:34:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:39,748 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1214 transitions. [2025-03-08 16:34:39,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1214 transitions. [2025-03-08 16:34:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:34:39,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:39,750 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:39,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:34:39,750 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:39,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1922255935, now seen corresponding path program 1 times [2025-03-08 16:34:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082985739] [2025-03-08 16:34:39,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:39,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:39,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:39,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:39,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:39,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:34:39,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:34:39,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:34:39,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:34:39,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:39,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:34:39,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:34:39,956 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:34:39,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:34:39,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:34:39,961 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:34:40,096 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:34:40,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:34:40 BoogieIcfgContainer [2025-03-08 16:34:40,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:34:40,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:34:40,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:34:40,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:34:40,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:04" (3/4) ... [2025-03-08 16:34:40,106 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:34:40,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:34:40,107 INFO L158 Benchmark]: Toolchain (without parser) took 36454.60ms. Allocated memory was 167.8MB in the beginning and 713.0MB in the end (delta: 545.3MB). Free memory was 123.3MB in the beginning and 341.3MB in the end (delta: -218.1MB). Peak memory consumption was 326.9MB. Max. memory is 16.1GB. [2025-03-08 16:34:40,107 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:34:40,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.55ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 107.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:34:40,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.56ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 104.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:34:40,108 INFO L158 Benchmark]: Boogie Preprocessor took 58.74ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 100.8MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:34:40,108 INFO L158 Benchmark]: IcfgBuilder took 565.86ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 61.4MB in the end (delta: 39.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:34:40,108 INFO L158 Benchmark]: TraceAbstraction took 35561.75ms. Allocated memory was 167.8MB in the beginning and 713.0MB in the end (delta: 545.3MB). Free memory was 60.7MB in the beginning and 341.5MB in the end (delta: -280.8MB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. [2025-03-08 16:34:40,110 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 713.0MB. Free memory was 341.5MB in the beginning and 341.3MB in the end (delta: 150.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:34:40,111 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.55ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 107.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.56ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 104.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.74ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 100.8MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 565.86ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 61.4MB in the end (delta: 39.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35561.75ms. Allocated memory was 167.8MB in the beginning and 713.0MB in the end (delta: 545.3MB). Free memory was 60.7MB in the beginning and 341.5MB in the end (delta: -280.8MB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 713.0MB. Free memory was 341.5MB in the beginning and 341.3MB in the end (delta: 150.2kB). 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 98, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of bitwiseOr at line 124, overapproximation of bitwiseOr at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] float float_Array_0[2] = { 1000000.5, 4.5 }; [L27-L29] float float_Array_0[2] = { 1000000.5, 4.5 }; [L27-L29] float float_Array_0[2] = { 1000000.5, 4.5 }; [L30] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L35] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0][0]); [L36] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1][0]); [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[0][1]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[1][1]); [L39-L41] signed long int signed_long_int_Array_0[1] = { 64 }; [L39-L41] signed long int signed_long_int_Array_0[1] = { 64 }; [L42] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L43-L45] signed short int signed_short_int_Array_0[1] = { -16 }; [L43-L45] signed short int signed_short_int_Array_0[1] = { -16 }; [L46] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L47-L49] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L47-L49] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L47-L49] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L50] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L51] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L55] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0][0]); [L56] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer = &(unsigned_long_int_Array_0[1][0]); [L57] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer = &(unsigned_long_int_Array_0[0][1]); [L58] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer = &(unsigned_long_int_Array_0[1][1]); [L59] signed short int last_1_signed_short_int_Array_0_0_ = -16; [L60] unsigned char last_1_unsigned_char_Array_0_0_ = 0; [L61] unsigned long int last_1_unsigned_long_int_Array_0_0__1_ = 25; 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: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=0, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L119] EXPR signed_short_int_Array_0[0] [L119] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L120] EXPR unsigned_char_Array_0[0] [L120] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L121] EXPR unsigned_long_int_Array_0[0][1] [L121] last_1_unsigned_long_int_Array_0_0__1_ = unsigned_long_int_Array_0[0][1] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L92] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L92] CALL assume_abort_if_not(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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L92] RET assume_abort_if_not(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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L93] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L93] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L93] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L94] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L95] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L95] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L95] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L96] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L96] CALL assume_abort_if_not(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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L96] RET assume_abort_if_not(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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L97] float_Array_0[1] = __VERIFIER_nondet_float() [L98] EXPR float_Array_0[1] [L98] EXPR float_Array_0[1] >= -922337.2036854765600e+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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L98] EXPR float_Array_0[1] [L98] EXPR float_Array_0[1] >= -922337.2036854765600e+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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, 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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L99] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L100] EXPR signed_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L100] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L101] EXPR signed_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L101] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L101] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L102] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L103] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L103] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L103] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L104] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L104] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L104] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L105] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L106] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L107] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L107] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) 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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L107] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L108] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L109] EXPR unsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L109] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) 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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L109] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L110] EXPR unsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L110] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) 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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L110] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L111] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L112] EXPR unsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L112] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) 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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L112] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L113] EXPR unsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L113] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) 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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L113] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L114] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L115] EXPR unsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L115] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) 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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L115] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L116] EXPR unsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L116] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) 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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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:1}, \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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L116] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L132] RET updateVariables() [L133] CALL step() [L65] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L65] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L65] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L65] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L65] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L65] COND FALSE !(((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L72] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L72] (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) [L74] 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L74] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L77] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L77] EXPR \read(*signed_char_Array_0_arraysigned_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L77] COND TRUE (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) [L78] EXPR \read(*signed_char_Array_0_arraysigned_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L78] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) [L78] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L78] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L78] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) [L80] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) = 2 [L81] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L81] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) [L82] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L82] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L83] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L83] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L83] unsigned char stepLocal_0 = (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)); [L84] stepLocal_0 && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L84] stepLocal_0 && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L84] COND FALSE !(stepLocal_0 && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) [L87] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer) [L87] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L87] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) = ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L124] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L124] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L124] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1) [L124] 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1 [L124] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))))) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L124] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) [L124] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer) [L124] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer) [L124] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L124] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1) [L124] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L124] EXPR \read(*signed_char_Array_0_arraysigned_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1 [L124] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L124] EXPR \read(*signed_char_Array_0_arraysigned_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L124] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2)) [L124] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L124] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) [L124] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L124] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L124] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124-L125] return (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ; [L134] RET, EXPR property() [L134] 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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [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: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, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 190 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.4s, OverallIterations: 30, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5605 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5600 mSDsluCounter, 21169 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16073 mSDsCounter, 745 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6319 IncrementalHoareTripleChecker+Invalid, 7064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 745 mSolverCounterUnsat, 5096 mSDtfsCounter, 6319 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1468 GetRequests, 1170 SyntacticMatches, 3 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=895occurred in iteration=28, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 2090 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 5315 NumberOfCodeBlocks, 5315 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5437 ConstructedInterpolants, 32 QuantifiedInterpolants, 44805 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2997 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 36 InterpolantComputations, 28 PerfectInterpolantSequences, 18490/19584 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-08 16:34:40,138 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-88.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 9f13b6ec153b424c9c18800ebe21aa9579fe753fb31fef85cd6c1089c45b899c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:34:41,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:34:42,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:34:42,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:34:42,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:34:42,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:34:42,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:34:42,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:34:42,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:34:42,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:34:42,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:34:42,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:34:42,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:34:42,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:34:42,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:34:42,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:34:42,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:34:42,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:34:42,060 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 -> 9f13b6ec153b424c9c18800ebe21aa9579fe753fb31fef85cd6c1089c45b899c [2025-03-08 16:34:42,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:34:42,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:34:42,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:34:42,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:34:42,310 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:34:42,311 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-88.i [2025-03-08 16:34:43,491 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4d01410/03e991a6acfb441fbb5c3737f554fc0c/FLAGc67bda395 [2025-03-08 16:34:43,693 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:34:43,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-08 16:34:43,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4d01410/03e991a6acfb441fbb5c3737f554fc0c/FLAGc67bda395 [2025-03-08 16:34:43,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4d01410/03e991a6acfb441fbb5c3737f554fc0c [2025-03-08 16:34:43,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:34:43,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:34:43,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:34:43,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:34:43,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:34:43,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:43,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c95ca88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43, skipping insertion in model container [2025-03-08 16:34:43,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:43,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:34:43,845 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-88.i[917,930] [2025-03-08 16:34:43,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:34:43,919 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:34:43,928 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-88.i[917,930] [2025-03-08 16:34:43,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:34:43,993 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:34:43,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43 WrapperNode [2025-03-08 16:34:43,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:34:43,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:34:43,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:34:43,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:34:44,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,050 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2025-03-08 16:34:44,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:34:44,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:34:44,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:34:44,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:34:44,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,084 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2025-03-08 16:34:44,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:34:44,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:34:44,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:34:44,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:34:44,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (1/1) ... [2025-03-08 16:34:44,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:34:44,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:44,155 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-08 16:34:44,160 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-08 16:34:44,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:34:44,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:34:44,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:34:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-08 16:34:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:34:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:34:44,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:34:44,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-08 16:34:44,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-08 16:34:44,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-08 16:34:44,322 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:34:44,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:34:44,723 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite90#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~short82#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~ite119#1;havoc property_#t~mem115#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~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-03-08 16:34:44,760 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-08 16:34:44,760 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:34:44,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:34:44,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:34:44,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:44 BoogieIcfgContainer [2025-03-08 16:34:44,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:34:44,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:34:44,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:34:44,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:34:44,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:34:43" (1/3) ... [2025-03-08 16:34:44,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20583f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:44, skipping insertion in model container [2025-03-08 16:34:44,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:43" (2/3) ... [2025-03-08 16:34:44,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20583f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:44, skipping insertion in model container [2025-03-08 16:34:44,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:44" (3/3) ... [2025-03-08 16:34:44,777 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-08 16:34:44,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:34:44,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-88.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:34:44,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:34:44,834 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;@220385da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:34:44,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:34:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:34:44,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:44,844 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:44,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:44,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:44,847 INFO L85 PathProgramCache]: Analyzing trace with hash 357355680, now seen corresponding path program 1 times [2025-03-08 16:34:44,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755070519] [2025-03-08 16:34:44,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:44,855 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-08 16:34:44,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:44,857 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-08 16:34:44,858 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-08 16:34:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:34:45,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:34:45,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:45,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:45,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:34:45,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 16:34:45,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:45,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:45,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755070519] [2025-03-08 16:34:45,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755070519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:45,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:45,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:34:45,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440225345] [2025-03-08 16:34:45,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:45,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:34:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:45,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:34:45,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:34:45,141 INFO L87 Difference]: Start difference. First operand has 110 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:34:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:45,166 INFO L93 Difference]: Finished difference Result 214 states and 334 transitions. [2025-03-08 16:34:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:34:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-08 16:34:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:45,173 INFO L225 Difference]: With dead ends: 214 [2025-03-08 16:34:45,174 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 16:34:45,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-08 16:34:45,177 INFO L435 NwaCegarLoop]: 156 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, 156 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-08 16:34:45,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 16:34:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-08 16:34:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-08 16:34:45,224 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 139 [2025-03-08 16:34:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:45,224 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-08 16:34:45,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:34:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-08 16:34:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:34:45,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:45,228 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:45,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:34:45,429 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-08 16:34:45,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:45,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash -431435991, now seen corresponding path program 1 times [2025-03-08 16:34:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:45,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270341272] [2025-03-08 16:34:45,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:45,430 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-08 16:34:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:45,432 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-08 16:34:45,434 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-08 16:34:45,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:34:45,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:34:45,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:45,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:45,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:34:45,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:45,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:45,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:45,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270341272] [2025-03-08 16:34:45,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270341272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:45,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:45,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:34:45,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474192733] [2025-03-08 16:34:45,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:45,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:34:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:45,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:34:45,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:45,745 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:45,822 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2025-03-08 16:34:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:34:45,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:34:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:45,825 INFO L225 Difference]: With dead ends: 218 [2025-03-08 16:34:45,825 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 16:34:45,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:45,826 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:45,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 16:34:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-08 16:34:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2025-03-08 16:34:45,841 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 139 [2025-03-08 16:34:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:45,845 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2025-03-08 16:34:45,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2025-03-08 16:34:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:34:45,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:45,847 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:45,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:34:46,047 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-08 16:34:46,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:46,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2056076842, now seen corresponding path program 1 times [2025-03-08 16:34:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:46,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301764230] [2025-03-08 16:34:46,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:46,049 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-08 16:34:46,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:46,051 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-08 16:34:46,052 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-08 16:34:46,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:34:46,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:34:46,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:46,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:46,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:34:46,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:46,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:46,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:46,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301764230] [2025-03-08 16:34:46,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301764230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:46,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:46,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:34:46,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973111921] [2025-03-08 16:34:46,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:46,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:34:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:46,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:34:46,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:34:46,311 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:46,371 INFO L93 Difference]: Finished difference Result 226 states and 325 transitions. [2025-03-08 16:34:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:34:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:34:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:46,374 INFO L225 Difference]: With dead ends: 226 [2025-03-08 16:34:46,374 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 16:34:46,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:34:46,375 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:46,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 857 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 16:34:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-08 16:34:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2025-03-08 16:34:46,387 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 139 [2025-03-08 16:34:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:46,387 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2025-03-08 16:34:46,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2025-03-08 16:34:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:34:46,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:46,389 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:46,395 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-08 16:34:46,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:34:46,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1351386773, now seen corresponding path program 1 times [2025-03-08 16:34:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578857455] [2025-03-08 16:34:46,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:46,594 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-08 16:34:46,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:46,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:34:46,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:34:46,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:34:46,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:34:46,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:46,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:46,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 16:34:46,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:46,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:46,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:46,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578857455] [2025-03-08 16:34:46,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578857455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:46,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:46,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:34:46,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648338455] [2025-03-08 16:34:46,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:46,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:34:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:46,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:34:46,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:34:46,847 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:46,926 INFO L93 Difference]: Finished difference Result 230 states and 329 transitions. [2025-03-08 16:34:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:34:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:34:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:46,929 INFO L225 Difference]: With dead ends: 230 [2025-03-08 16:34:46,929 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 16:34:46,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:34:46,930 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:46,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 16:34:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-08 16:34:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:34:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2025-03-08 16:34:46,947 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 139 [2025-03-08 16:34:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:46,947 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2025-03-08 16:34:46,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2025-03-08 16:34:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:34:46,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:46,949 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:46,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:34:47,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:34:47,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:47,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1350463252, now seen corresponding path program 1 times [2025-03-08 16:34:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:47,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647948252] [2025-03-08 16:34:47,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:47,150 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-08 16:34:47,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:47,153 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-08 16:34:47,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:34:47,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:34:47,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:34:47,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:47,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:47,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 16:34:47,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:48,451 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 21 treesize of output 20 [2025-03-08 16:34:48,832 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 29 treesize of output 31 [2025-03-08 16:34:49,450 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-08 16:34:49,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:49,885 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 27 treesize of output 11 [2025-03-08 16:34:50,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 16:34:50,508 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2025-03-08 16:34:50,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 58 [2025-03-08 16:34:50,599 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 15 treesize of output 7 [2025-03-08 16:34:50,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:34:50,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 22 [2025-03-08 16:34:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 97 proven. 350 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 16:34:50,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:34:50,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647948252] [2025-03-08 16:34:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647948252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726635861] [2025-03-08 16:34:50,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:34:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:34:50,774 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-08 16:34:50,775 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-08 16:34:50,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:34:51,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:34:51,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:51,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:51,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 16:34:51,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:52,387 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 21 treesize of output 20 [2025-03-08 16:34:52,840 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 32 treesize of output 23 [2025-03-08 16:34:53,433 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-08 16:34:53,930 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 11 [2025-03-08 16:34:54,229 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 11 [2025-03-08 16:34:54,593 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-03-08 16:34:54,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 43 [2025-03-08 16:34:54,688 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 15 treesize of output 7 [2025-03-08 16:34:54,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-08 16:34:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 97 proven. 350 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 16:34:54,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:34:54,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1726635861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:54,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:34:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-03-08 16:34:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246071726] [2025-03-08 16:34:54,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:34:54,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:34:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:54,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:34:54,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:34:54,785 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 21 states, 19 states have (on average 6.368421052631579) internal successors, (121), 20 states have internal predecessors, (121), 12 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (34), 10 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-08 16:34:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:57,865 INFO L93 Difference]: Finished difference Result 386 states and 545 transitions. [2025-03-08 16:34:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:34:57,866 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.368421052631579) internal successors, (121), 20 states have internal predecessors, (121), 12 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (34), 10 states have call predecessors, (34), 12 states have call successors, (34) Word has length 139 [2025-03-08 16:34:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:57,867 INFO L225 Difference]: With dead ends: 386 [2025-03-08 16:34:57,867 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 16:34:57,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 16:34:57,869 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 736 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:57,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 2014 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 16:34:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 16:34:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 263. [2025-03-08 16:34:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 213 states have (on average 1.323943661971831) internal successors, (282), 214 states have internal predecessors, (282), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:34:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 372 transitions. [2025-03-08 16:34:57,907 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 372 transitions. Word has length 139 [2025-03-08 16:34:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:57,907 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 372 transitions. [2025-03-08 16:34:57,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.368421052631579) internal successors, (121), 20 states have internal predecessors, (121), 12 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (34), 10 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-08 16:34:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 372 transitions. [2025-03-08 16:34:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:34:57,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:57,908 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:57,924 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-08 16:34:58,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 16:34:58,309 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-08 16:34:58,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:58,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash -846246294, now seen corresponding path program 1 times [2025-03-08 16:34:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:58,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687499690] [2025-03-08 16:34:58,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:58,310 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-08 16:34:58,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:58,312 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-08 16:34:58,312 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-08 16:34:58,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:34:58,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:34:58,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:58,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:58,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 16:34:58,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 207 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 16:34:58,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:34:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:34:58,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:58,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687499690] [2025-03-08 16:34:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687499690] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:58,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:58,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-08 16:34:58,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848587253] [2025-03-08 16:34:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:58,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:58,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:58,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:34:58,773 INFO L87 Difference]: Start difference. First operand 263 states and 372 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:58,845 INFO L93 Difference]: Finished difference Result 505 states and 715 transitions. [2025-03-08 16:34:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:58,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:34:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:58,848 INFO L225 Difference]: With dead ends: 505 [2025-03-08 16:34:58,849 INFO L226 Difference]: Without dead ends: 391 [2025-03-08 16:34:58,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:34:58,851 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 79 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:58,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 571 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-08 16:34:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 269. [2025-03-08 16:34:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 220 states have internal predecessors, (290), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:34:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2025-03-08 16:34:58,882 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 141 [2025-03-08 16:34:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:58,882 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2025-03-08 16:34:58,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:34:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2025-03-08 16:34:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:34:58,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:58,883 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:58,890 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-08 16:34:59,084 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-08 16:34:59,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:59,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1573925226, now seen corresponding path program 1 times [2025-03-08 16:34:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:59,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693808062] [2025-03-08 16:34:59,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:59,085 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-08 16:34:59,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:59,087 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-08 16:34:59,088 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-08 16:34:59,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:34:59,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:34:59,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:59,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:59,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:34:59,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:59,864 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-08 16:35:00,048 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-08 16:35:00,649 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 26 treesize of output 28 [2025-03-08 16:35:00,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:35:00,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 42 [2025-03-08 16:35:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:35:00,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:01,072 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:01,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693808062] [2025-03-08 16:35:01,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693808062] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:01,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:35:01,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-08 16:35:01,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729061877] [2025-03-08 16:35:01,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:01,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:35:01,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:01,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:35:01,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:35:01,073 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:01,375 INFO L93 Difference]: Finished difference Result 596 states and 836 transitions. [2025-03-08 16:35:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:35:01,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:35:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:01,379 INFO L225 Difference]: With dead ends: 596 [2025-03-08 16:35:01,379 INFO L226 Difference]: Without dead ends: 362 [2025-03-08 16:35:01,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:35:01,385 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 133 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:01,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 821 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:35:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-08 16:35:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2025-03-08 16:35:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 301 states have (on average 1.3289036544850499) internal successors, (400), 303 states have internal predecessors, (400), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:35:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 500 transitions. [2025-03-08 16:35:01,417 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 500 transitions. Word has length 141 [2025-03-08 16:35:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:01,418 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 500 transitions. [2025-03-08 16:35:01,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 500 transitions. [2025-03-08 16:35:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:35:01,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:01,419 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:01,425 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-08 16:35:01,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:35:01,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:01,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -834930167, now seen corresponding path program 1 times [2025-03-08 16:35:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:01,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743342523] [2025-03-08 16:35:01,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:01,620 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-08 16:35:01,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:01,622 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:35:01,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 16:35:01,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:35:01,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:35:01,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:01,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:01,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:35:01,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:01,790 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-08 16:35:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:01,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:35:01,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:01,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743342523] [2025-03-08 16:35:01,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743342523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:35:01,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:35:01,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:35:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820422813] [2025-03-08 16:35:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:01,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:35:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:01,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:35:01,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:35:01,881 INFO L87 Difference]: Start difference. First operand 359 states and 500 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:01,994 INFO L93 Difference]: Finished difference Result 833 states and 1161 transitions. [2025-03-08 16:35:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:35:01,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:35:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:01,997 INFO L225 Difference]: With dead ends: 833 [2025-03-08 16:35:01,997 INFO L226 Difference]: Without dead ends: 513 [2025-03-08 16:35:01,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:35:01,998 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 145 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:01,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 598 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:35:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-08 16:35:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 382. [2025-03-08 16:35:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 316 states have (on average 1.3132911392405062) internal successors, (415), 317 states have internal predecessors, (415), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 16:35:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2025-03-08 16:35:02,030 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 141 [2025-03-08 16:35:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:02,031 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2025-03-08 16:35:02,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2025-03-08 16:35:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:35:02,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:02,032 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:02,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-08 16:35:02,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:35:02,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 855461412, now seen corresponding path program 1 times [2025-03-08 16:35:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859141346] [2025-03-08 16:35:02,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:02,233 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-08 16:35:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:02,235 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-08 16:35:02,237 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-08 16:35:02,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:35:02,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:35:02,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:02,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:02,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:35:02,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:02,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:35:02,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:02,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859141346] [2025-03-08 16:35:02,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859141346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:35:02,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:35:02,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:35:02,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803697814] [2025-03-08 16:35:02,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:02,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:35:02,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:02,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:35:02,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:35:02,417 INFO L87 Difference]: Start difference. First operand 382 states and 527 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:02,460 INFO L93 Difference]: Finished difference Result 711 states and 988 transitions. [2025-03-08 16:35:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:35:02,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:35:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:02,462 INFO L225 Difference]: With dead ends: 711 [2025-03-08 16:35:02,462 INFO L226 Difference]: Without dead ends: 391 [2025-03-08 16:35:02,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:35:02,463 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:02,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:35:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-08 16:35:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-03-08 16:35:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 325 states have (on average 1.3046153846153845) internal successors, (424), 326 states have internal predecessors, (424), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 16:35:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 536 transitions. [2025-03-08 16:35:02,485 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 536 transitions. Word has length 143 [2025-03-08 16:35:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:02,485 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 536 transitions. [2025-03-08 16:35:02,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 536 transitions. [2025-03-08 16:35:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:35:02,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:02,487 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:02,494 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-08 16:35:02,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:35:02,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:02,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1330057977, now seen corresponding path program 1 times [2025-03-08 16:35:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:02,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570509749] [2025-03-08 16:35:02,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:02,689 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-08 16:35:02,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:02,690 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:35:02,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-08 16:35:02,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:35:02,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:35:02,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:02,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:02,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 16:35:02,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 207 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 16:35:03,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:03,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570509749] [2025-03-08 16:35:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570509749] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:35:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-08 16:35:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853528769] [2025-03-08 16:35:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:35:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:03,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:35:03,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:35:03,182 INFO L87 Difference]: Start difference. First operand 391 states and 536 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:03,261 INFO L93 Difference]: Finished difference Result 924 states and 1277 transitions. [2025-03-08 16:35:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:35:03,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:35:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:03,263 INFO L225 Difference]: With dead ends: 924 [2025-03-08 16:35:03,263 INFO L226 Difference]: Without dead ends: 595 [2025-03-08 16:35:03,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:35:03,264 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 74 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:03,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 681 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:35:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-08 16:35:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 439. [2025-03-08 16:35:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 373 states have (on average 1.3270777479892761) internal successors, (495), 374 states have internal predecessors, (495), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 16:35:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 607 transitions. [2025-03-08 16:35:03,293 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 607 transitions. Word has length 143 [2025-03-08 16:35:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:03,293 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 607 transitions. [2025-03-08 16:35:03,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 607 transitions. [2025-03-08 16:35:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:35:03,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:03,294 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:03,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-03-08 16:35:03,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:35:03,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:03,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1967836966, now seen corresponding path program 1 times [2025-03-08 16:35:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:03,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785788252] [2025-03-08 16:35:03,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:03,496 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-08 16:35:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:03,498 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-08 16:35:03,499 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-08 16:35:03,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:35:03,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:35:03,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:03,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:03,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:35:03,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:03,676 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-08 16:35:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:03,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:35:03,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:03,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785788252] [2025-03-08 16:35:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785788252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:35:03,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:35:03,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:35:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696690803] [2025-03-08 16:35:03,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:03,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:35:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:03,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:35:03,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:35:03,787 INFO L87 Difference]: Start difference. First operand 439 states and 607 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:03,889 INFO L93 Difference]: Finished difference Result 967 states and 1345 transitions. [2025-03-08 16:35:03,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:35:03,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:35:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:03,894 INFO L225 Difference]: With dead ends: 967 [2025-03-08 16:35:03,894 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 16:35:03,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:35:03,895 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 130 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:03,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 595 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:35:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 16:35:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 487. [2025-03-08 16:35:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 421 states have (on average 1.339667458432304) internal successors, (564), 422 states have internal predecessors, (564), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 16:35:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 676 transitions. [2025-03-08 16:35:03,921 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 676 transitions. Word has length 143 [2025-03-08 16:35:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:03,921 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 676 transitions. [2025-03-08 16:35:03,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 676 transitions. [2025-03-08 16:35:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:35:03,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:03,923 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:03,930 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-08 16:35:04,123 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-08 16:35:04,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:04,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1237065983, now seen corresponding path program 1 times [2025-03-08 16:35:04,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:04,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621378353] [2025-03-08 16:35:04,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:04,125 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-08 16:35:04,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:04,127 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-08 16:35:04,128 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-08 16:35:04,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:35:04,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:35:04,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:04,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:04,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 16:35:04,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 207 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 16:35:04,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:04,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:04,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621378353] [2025-03-08 16:35:04,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621378353] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:04,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:35:04,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-08 16:35:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127948308] [2025-03-08 16:35:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:04,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:35:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:04,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:35:04,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:35:04,633 INFO L87 Difference]: Start difference. First operand 487 states and 676 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:04,705 INFO L93 Difference]: Finished difference Result 985 states and 1371 transitions. [2025-03-08 16:35:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:35:04,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-03-08 16:35:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:04,708 INFO L225 Difference]: With dead ends: 985 [2025-03-08 16:35:04,708 INFO L226 Difference]: Without dead ends: 608 [2025-03-08 16:35:04,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:35:04,709 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 124 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:04,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 432 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:35:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-08 16:35:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 516. [2025-03-08 16:35:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 450 states have (on average 1.3466666666666667) internal successors, (606), 451 states have internal predecessors, (606), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 16:35:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 718 transitions. [2025-03-08 16:35:04,733 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 718 transitions. Word has length 144 [2025-03-08 16:35:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:04,733 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 718 transitions. [2025-03-08 16:35:04,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 718 transitions. [2025-03-08 16:35:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:35:04,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:04,734 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:04,740 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-08 16:35:04,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:35:04,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:04,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash 410674374, now seen corresponding path program 1 times [2025-03-08 16:35:04,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:04,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551420999] [2025-03-08 16:35:04,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:04,936 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-08 16:35:04,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:04,940 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:35:04,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-08 16:35:05,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:35:05,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:35:05,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:05,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:05,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 16:35:05,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 207 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 16:35:05,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:05,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:05,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551420999] [2025-03-08 16:35:05,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551420999] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:05,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:35:05,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-08 16:35:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827364354] [2025-03-08 16:35:05,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:05,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:35:05,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:05,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:35:05,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:35:05,427 INFO L87 Difference]: Start difference. First operand 516 states and 718 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:05,491 INFO L93 Difference]: Finished difference Result 1000 states and 1390 transitions. [2025-03-08 16:35:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:35:05,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2025-03-08 16:35:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:05,494 INFO L225 Difference]: With dead ends: 1000 [2025-03-08 16:35:05,494 INFO L226 Difference]: Without dead ends: 594 [2025-03-08 16:35:05,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:35:05,496 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 108 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:05,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 433 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:35:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-08 16:35:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 524. [2025-03-08 16:35:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 458 states have (on average 1.3406113537117903) internal successors, (614), 459 states have internal predecessors, (614), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 16:35:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 726 transitions. [2025-03-08 16:35:05,521 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 726 transitions. Word has length 145 [2025-03-08 16:35:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:05,522 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 726 transitions. [2025-03-08 16:35:05,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 726 transitions. [2025-03-08 16:35:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:35:05,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:05,522 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:05,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-03-08 16:35:05,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:35:05,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:05,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1213815445, now seen corresponding path program 1 times [2025-03-08 16:35:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:05,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906372470] [2025-03-08 16:35:05,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:05,728 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-08 16:35:05,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:05,729 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-08 16:35:05,730 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-08 16:35:05,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:35:05,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:35:05,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:05,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:05,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 16:35:05,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:06,870 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 22 treesize of output 25 [2025-03-08 16:35:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:07,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:35:07,073 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906372470] [2025-03-08 16:35:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906372470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:35:07,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:35:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:35:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081016032] [2025-03-08 16:35:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:07,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:35:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:07,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:35:07,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:35:07,074 INFO L87 Difference]: Start difference. First operand 524 states and 726 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:07,389 INFO L93 Difference]: Finished difference Result 1223 states and 1686 transitions. [2025-03-08 16:35:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:35:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 16:35:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:07,393 INFO L225 Difference]: With dead ends: 1223 [2025-03-08 16:35:07,393 INFO L226 Difference]: Without dead ends: 809 [2025-03-08 16:35:07,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:35:07,394 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 225 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:07,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 843 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:35:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-08 16:35:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 805. [2025-03-08 16:35:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 708 states have (on average 1.3206214689265536) internal successors, (935), 712 states have internal predecessors, (935), 83 states have call successors, (83), 13 states have call predecessors, (83), 13 states have return successors, (83), 79 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 16:35:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1101 transitions. [2025-03-08 16:35:07,438 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1101 transitions. Word has length 146 [2025-03-08 16:35:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:07,438 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1101 transitions. [2025-03-08 16:35:07,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1101 transitions. [2025-03-08 16:35:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:35:07,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:07,439 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:07,446 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-08 16:35:07,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:35:07,640 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:07,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2095258558, now seen corresponding path program 1 times [2025-03-08 16:35:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958083937] [2025-03-08 16:35:07,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:07,641 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-08 16:35:07,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:07,642 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:35:07,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-03-08 16:35:07,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:35:07,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:35:07,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:07,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:07,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 16:35:07,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:08,774 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-08 16:35:09,202 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-08 16:35:09,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:35:09,498 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 27 treesize of output 11 [2025-03-08 16:35:09,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 16:35:09,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 16:35:10,169 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 38 treesize of output 36 [2025-03-08 16:35:10,223 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 15 treesize of output 7 [2025-03-08 16:35:10,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:35:10,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 47 [2025-03-08 16:35:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 57 proven. 350 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-08 16:35:10,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:35:10,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:10,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958083937] [2025-03-08 16:35:10,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958083937] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:10,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:35:10,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2025-03-08 16:35:10,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053020973] [2025-03-08 16:35:10,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:35:10,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:35:10,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:10,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:35:10,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:35:10,891 INFO L87 Difference]: Start difference. First operand 805 states and 1101 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:12,278 INFO L93 Difference]: Finished difference Result 1698 states and 2336 transitions. [2025-03-08 16:35:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:35:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-08 16:35:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:12,282 INFO L225 Difference]: With dead ends: 1698 [2025-03-08 16:35:12,282 INFO L226 Difference]: Without dead ends: 1009 [2025-03-08 16:35:12,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:35:12,284 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 387 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:12,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1062 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:35:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-08 16:35:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 809. [2025-03-08 16:35:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 712 states have (on average 1.3230337078651686) internal successors, (942), 716 states have internal predecessors, (942), 83 states have call successors, (83), 13 states have call predecessors, (83), 13 states have return successors, (83), 79 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 16:35:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1108 transitions. [2025-03-08 16:35:12,328 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1108 transitions. Word has length 146 [2025-03-08 16:35:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:12,328 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1108 transitions. [2025-03-08 16:35:12,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:35:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1108 transitions. [2025-03-08 16:35:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:35:12,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:12,330 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:12,337 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 (17)] Ended with exit code 0 [2025-03-08 16:35:12,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:35:12,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:12,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1402156861, now seen corresponding path program 1 times [2025-03-08 16:35:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488975843] [2025-03-08 16:35:12,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:12,532 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-08 16:35:12,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:12,534 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-08 16:35:12,534 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-08 16:35:12,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:35:12,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:35:12,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:12,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:12,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:35:12,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:13,344 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-08 16:35:13,806 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 17 treesize of output 17 [2025-03-08 16:35:13,871 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 27 treesize of output 29 [2025-03-08 16:35:13,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:35:13,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 35 [2025-03-08 16:35:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:35:13,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:14,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488975843] [2025-03-08 16:35:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488975843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [544803841] [2025-03-08 16:35:14,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:14,392 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:35:14,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:35:14,394 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-08 16:35:14,395 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-08 16:35:14,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:35:14,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:35:14,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:14,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:14,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:35:14,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:15,560 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-08 16:35:16,173 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 17 treesize of output 17 [2025-03-08 16:35:16,238 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 27 treesize of output 29 [2025-03-08 16:35:16,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2025-03-08 16:35:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:35:16,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [544803841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:16,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:35:16,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-08 16:35:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11893680] [2025-03-08 16:35:16,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:35:16,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:35:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:16,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:35:16,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:35:16,454 INFO L87 Difference]: Start difference. First operand 809 states and 1108 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34)