./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:24:37,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:24:37,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:24:37,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:24:37,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:24:37,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:24:37,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:24:37,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:24:37,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:24:37,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:24:37,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:24:37,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:24:37,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:24:37,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:24:37,396 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:24:37,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:24:37,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:24:37,397 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:24:37,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:24:37,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:24:37,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:24:37,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:24:37,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:24:37,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:24:37,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:24:37,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:24:37,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:24:37,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:24:37,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:24:37,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:24:37,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:24:37,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:24:37,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:24:37,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:24:37,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:24:37,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:24:37,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:24:37,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:24:37,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:24:37,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:24:37,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:24:37,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:24:37,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:24:37,403 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-jdk21/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 -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2025-02-06 03:24:37,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:24:37,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:24:37,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:24:37,772 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:24:37,772 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:24:37,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2025-02-06 03:24:39,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f8203ade/53b4c720cc3a4f5099e72afdb050d687/FLAG82b664a1c [2025-02-06 03:24:39,426 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:24:39,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2025-02-06 03:24:39,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f8203ade/53b4c720cc3a4f5099e72afdb050d687/FLAG82b664a1c [2025-02-06 03:24:39,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f8203ade/53b4c720cc3a4f5099e72afdb050d687 [2025-02-06 03:24:39,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:24:39,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:24:39,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:24:39,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:24:39,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:24:39,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c034378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39, skipping insertion in model container [2025-02-06 03:24:39,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:24:39,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2025-02-06 03:24:39,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:24:39,727 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:24:39,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2025-02-06 03:24:39,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:24:39,807 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:24:39,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39 WrapperNode [2025-02-06 03:24:39,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:24:39,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:24:39,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:24:39,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:24:39,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,880 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-02-06 03:24:39,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:24:39,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:24:39,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:24:39,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:24:39,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,917 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2025-02-06 03:24:39,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:24:39,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:24:39,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:24:39,943 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:24:39,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (1/1) ... [2025-02-06 03:24:39,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:24:39,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:24:39,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:24:39,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:24:40,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:24:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:24:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:24:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:24:40,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:24:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:24:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:24:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:24:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:24:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:24:40,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:24:40,156 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:24:40,158 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:24:40,682 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem90#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite99#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~bitwise110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite143#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~short144#1; [2025-02-06 03:24:40,731 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-02-06 03:24:40,731 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:24:40,746 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:24:40,746 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:24:40,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:24:40 BoogieIcfgContainer [2025-02-06 03:24:40,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:24:40,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:24:40,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:24:40,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:24:40,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:24:39" (1/3) ... [2025-02-06 03:24:40,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4d3b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:24:40, skipping insertion in model container [2025-02-06 03:24:40,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:24:39" (2/3) ... [2025-02-06 03:24:40,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4d3b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:24:40, skipping insertion in model container [2025-02-06 03:24:40,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:24:40" (3/3) ... [2025-02-06 03:24:40,757 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2025-02-06 03:24:40,772 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:24:40,774 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-2.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:24:40,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:24:40,855 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;@5a11ecc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:24:40,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:24:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:24:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:24:40,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:40,871 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:40,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:40,878 INFO L85 PathProgramCache]: Analyzing trace with hash -148561971, now seen corresponding path program 1 times [2025-02-06 03:24:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907871580] [2025-02-06 03:24:40,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:41,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:24:41,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:24:41,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:41,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 03:24:41,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:41,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907871580] [2025-02-06 03:24:41,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907871580] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:24:41,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396962736] [2025-02-06 03:24:41,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:41,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:24:41,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:24:41,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:24:41,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:24:41,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:24:41,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:24:41,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:41,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:41,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:24:41,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:24:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 03:24:41,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:24:41,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396962736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:41,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:24:41,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:24:41,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463554661] [2025-02-06 03:24:41,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:41,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:24:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:41,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:24:41,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:24:41,523 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:24:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:41,565 INFO L93 Difference]: Finished difference Result 200 states and 311 transitions. [2025-02-06 03:24:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:24:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-02-06 03:24:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:41,577 INFO L225 Difference]: With dead ends: 200 [2025-02-06 03:24:41,577 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:24:41,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-02-06 03:24:41,582 INFO L435 NwaCegarLoop]: 145 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, 145 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-02-06 03:24:41,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:24:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:24:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 03:24:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:24:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2025-02-06 03:24:41,627 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 100 [2025-02-06 03:24:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:41,628 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2025-02-06 03:24:41,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:24:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2025-02-06 03:24:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:24:41,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:41,638 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:41,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:24:41,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:24:41,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:41,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash -641952329, now seen corresponding path program 1 times [2025-02-06 03:24:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858031389] [2025-02-06 03:24:41,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:41,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:24:41,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:24:41,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:41,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 03:24:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:42,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858031389] [2025-02-06 03:24:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858031389] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:24:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880879044] [2025-02-06 03:24:42,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:42,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:24:42,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:24:42,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:24:42,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:24:42,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:24:42,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:24:42,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:42,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:42,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:24:42,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:24:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:42,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:24:42,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880879044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:42,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:24:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:24:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570776547] [2025-02-06 03:24:42,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:42,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:24:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:42,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:24:42,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:24:42,591 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:42,645 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2025-02-06 03:24:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:24:42,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2025-02-06 03:24:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:42,649 INFO L225 Difference]: With dead ends: 199 [2025-02-06 03:24:42,649 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 03:24:42,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:24:42,650 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:42,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:24:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 03:24:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-06 03:24:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:24:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2025-02-06 03:24:42,669 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 100 [2025-02-06 03:24:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:42,670 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2025-02-06 03:24:42,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2025-02-06 03:24:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:24:42,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:42,672 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:42,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:24:42,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:24:42,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:42,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash -321544809, now seen corresponding path program 1 times [2025-02-06 03:24:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:42,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855747246] [2025-02-06 03:24:42,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:42,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:24:42,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:24:42,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:42,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:43,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:43,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855747246] [2025-02-06 03:24:43,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855747246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:43,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:43,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:24:43,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664769642] [2025-02-06 03:24:43,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:43,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:24:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:43,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:24:43,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:24:43,062 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:43,114 INFO L93 Difference]: Finished difference Result 245 states and 361 transitions. [2025-02-06 03:24:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:24:43,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 03:24:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:43,116 INFO L225 Difference]: With dead ends: 245 [2025-02-06 03:24:43,116 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 03:24:43,117 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-02-06 03:24:43,117 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 60 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:43,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 284 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:24:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 03:24:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2025-02-06 03:24:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:24:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2025-02-06 03:24:43,127 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 103 [2025-02-06 03:24:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:43,128 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2025-02-06 03:24:43,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2025-02-06 03:24:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:24:43,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:43,130 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:43,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:24:43,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:43,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:43,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1640374911, now seen corresponding path program 1 times [2025-02-06 03:24:43,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894313305] [2025-02-06 03:24:43,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:43,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:24:43,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:24:43,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894313305] [2025-02-06 03:24:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894313305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:43,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:43,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:24:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514238931] [2025-02-06 03:24:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:43,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:24:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:43,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:24:43,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:24:43,216 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:43,235 INFO L93 Difference]: Finished difference Result 236 states and 351 transitions. [2025-02-06 03:24:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:24:43,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 03:24:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:43,237 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:24:43,237 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:24:43,238 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-02-06 03:24:43,239 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 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-02-06 03:24:43,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:24:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:24:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 03:24:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:24:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 177 transitions. [2025-02-06 03:24:43,246 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 177 transitions. Word has length 103 [2025-02-06 03:24:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:43,246 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 177 transitions. [2025-02-06 03:24:43,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 177 transitions. [2025-02-06 03:24:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:24:43,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:43,248 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:43,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:24:43,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash -847137922, now seen corresponding path program 1 times [2025-02-06 03:24:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:43,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761803114] [2025-02-06 03:24:43,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:43,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:24:43,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:24:43,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:43,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:44,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761803114] [2025-02-06 03:24:44,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761803114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:24:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400301889] [2025-02-06 03:24:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:24:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:44,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:24:44,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:24:44,960 INFO L87 Difference]: Start difference. First operand 120 states and 177 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 14 states have internal predecessors, (46), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-06 03:24:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:45,825 INFO L93 Difference]: Finished difference Result 314 states and 460 transitions. [2025-02-06 03:24:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:24:45,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 14 states have internal predecessors, (46), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 103 [2025-02-06 03:24:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:45,827 INFO L225 Difference]: With dead ends: 314 [2025-02-06 03:24:45,827 INFO L226 Difference]: Without dead ends: 197 [2025-02-06 03:24:45,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:24:45,829 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 575 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:45,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1077 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:24:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-06 03:24:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-02-06 03:24:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 175 states have (on average 1.4342857142857144) internal successors, (251), 176 states have internal predecessors, (251), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:24:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2025-02-06 03:24:45,857 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 103 [2025-02-06 03:24:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:45,858 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2025-02-06 03:24:45,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 14 states have internal predecessors, (46), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-06 03:24:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2025-02-06 03:24:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:24:45,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:45,860 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:45,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:24:45,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:45,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1318248149, now seen corresponding path program 1 times [2025-02-06 03:24:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:45,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931553857] [2025-02-06 03:24:45,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:45,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:45,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:24:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:24:45,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:45,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:24:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107057349] [2025-02-06 03:24:45,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:45,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:24:45,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:24:45,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:24:45,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:24:46,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:24:46,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:24:46,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:46,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:46,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:24:46,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:24:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:46,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:24:46,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:46,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931553857] [2025-02-06 03:24:46,371 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:24:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107057349] [2025-02-06 03:24:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107057349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:46,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:46,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:24:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26692709] [2025-02-06 03:24:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:46,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:24:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:46,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:24:46,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:24:46,374 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:46,571 INFO L93 Difference]: Finished difference Result 527 states and 772 transitions. [2025-02-06 03:24:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:24:46,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-02-06 03:24:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:46,575 INFO L225 Difference]: With dead ends: 527 [2025-02-06 03:24:46,577 INFO L226 Difference]: Without dead ends: 336 [2025-02-06 03:24:46,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-02-06 03:24:46,579 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 134 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:46,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 360 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:24:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-06 03:24:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 265. [2025-02-06 03:24:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 233 states have (on average 1.4206008583690988) internal successors, (331), 234 states have internal predecessors, (331), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 387 transitions. [2025-02-06 03:24:46,626 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 387 transitions. Word has length 105 [2025-02-06 03:24:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:46,626 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 387 transitions. [2025-02-06 03:24:46,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 387 transitions. [2025-02-06 03:24:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:24:46,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:46,628 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:46,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:24:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:24:46,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:46,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1589398055, now seen corresponding path program 1 times [2025-02-06 03:24:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223501591] [2025-02-06 03:24:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:46,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:24:46,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:24:46,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:46,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223501591] [2025-02-06 03:24:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223501591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:24:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263377543] [2025-02-06 03:24:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:24:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:47,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:24:47,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:24:47,875 INFO L87 Difference]: Start difference. First operand 265 states and 387 transitions. Second operand has 10 states, 8 states have (on average 6.125) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-06 03:24:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:48,477 INFO L93 Difference]: Finished difference Result 588 states and 850 transitions. [2025-02-06 03:24:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:24:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2025-02-06 03:24:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:48,481 INFO L225 Difference]: With dead ends: 588 [2025-02-06 03:24:48,481 INFO L226 Difference]: Without dead ends: 397 [2025-02-06 03:24:48,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:24:48,482 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 381 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:48,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 610 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:24:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-06 03:24:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 287. [2025-02-06 03:24:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 255 states have (on average 1.411764705882353) internal successors, (360), 256 states have internal predecessors, (360), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 416 transitions. [2025-02-06 03:24:48,520 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 416 transitions. Word has length 106 [2025-02-06 03:24:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:48,521 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 416 transitions. [2025-02-06 03:24:48,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-06 03:24:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 416 transitions. [2025-02-06 03:24:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:24:48,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:48,522 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:48,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:24:48,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:48,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash -207553304, now seen corresponding path program 1 times [2025-02-06 03:24:48,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:48,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19692497] [2025-02-06 03:24:48,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:48,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:24:48,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:24:48,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:48,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19692497] [2025-02-06 03:24:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19692497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:24:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235718744] [2025-02-06 03:24:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:49,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:24:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:49,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:24:49,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:24:49,484 INFO L87 Difference]: Start difference. First operand 287 states and 416 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:24:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:50,387 INFO L93 Difference]: Finished difference Result 695 states and 1007 transitions. [2025-02-06 03:24:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:24:50,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-02-06 03:24:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:50,390 INFO L225 Difference]: With dead ends: 695 [2025-02-06 03:24:50,390 INFO L226 Difference]: Without dead ends: 486 [2025-02-06 03:24:50,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:24:50,392 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 465 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:50,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 930 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:24:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-06 03:24:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 353. [2025-02-06 03:24:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 321 states have (on average 1.4330218068535825) internal successors, (460), 322 states have internal predecessors, (460), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 516 transitions. [2025-02-06 03:24:50,426 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 516 transitions. Word has length 106 [2025-02-06 03:24:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:50,426 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 516 transitions. [2025-02-06 03:24:50,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:24:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2025-02-06 03:24:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:24:50,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:50,429 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:50,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:24:50,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:50,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1654956059, now seen corresponding path program 1 times [2025-02-06 03:24:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:50,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750916689] [2025-02-06 03:24:50,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:50,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:24:50,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:24:50,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:50,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:51,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:51,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750916689] [2025-02-06 03:24:51,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750916689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:51,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:51,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:24:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364395705] [2025-02-06 03:24:51,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:51,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:24:51,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:51,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:24:51,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:24:51,072 INFO L87 Difference]: Start difference. First operand 353 states and 516 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:51,554 INFO L93 Difference]: Finished difference Result 730 states and 1063 transitions. [2025-02-06 03:24:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:24:51,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-02-06 03:24:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:51,557 INFO L225 Difference]: With dead ends: 730 [2025-02-06 03:24:51,557 INFO L226 Difference]: Without dead ends: 484 [2025-02-06 03:24:51,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:24:51,561 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 226 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:51,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 545 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:24:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-02-06 03:24:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 358. [2025-02-06 03:24:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 326 states have (on average 1.4355828220858895) internal successors, (468), 327 states have internal predecessors, (468), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 524 transitions. [2025-02-06 03:24:51,597 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 524 transitions. Word has length 108 [2025-02-06 03:24:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:51,598 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 524 transitions. [2025-02-06 03:24:51,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:24:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 524 transitions. [2025-02-06 03:24:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:24:51,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:51,599 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:51,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:24:51,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:51,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash 843059878, now seen corresponding path program 1 times [2025-02-06 03:24:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485226421] [2025-02-06 03:24:51,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:51,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:24:51,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:24:51,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:51,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485226421] [2025-02-06 03:24:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485226421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:52,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:52,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:24:52,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536812640] [2025-02-06 03:24:52,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:52,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:24:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:52,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:24:52,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:24:52,696 INFO L87 Difference]: Start difference. First operand 358 states and 524 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:24:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:53,384 INFO L93 Difference]: Finished difference Result 753 states and 1102 transitions. [2025-02-06 03:24:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:24:53,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-06 03:24:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:53,388 INFO L225 Difference]: With dead ends: 753 [2025-02-06 03:24:53,388 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 03:24:53,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:24:53,389 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 474 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:53,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 577 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:24:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 03:24:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 428. [2025-02-06 03:24:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 395 states have (on average 1.4455696202531645) internal successors, (571), 396 states have internal predecessors, (571), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2025-02-06 03:24:53,430 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 108 [2025-02-06 03:24:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:53,431 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2025-02-06 03:24:53,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:24:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2025-02-06 03:24:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:24:53,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:53,432 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:53,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:24:53,433 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:53,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1881275845, now seen corresponding path program 1 times [2025-02-06 03:24:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:53,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689597752] [2025-02-06 03:24:53,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:53,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:53,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:24:53,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:24:53,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:53,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:53,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689597752] [2025-02-06 03:24:53,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689597752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:53,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:24:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967546677] [2025-02-06 03:24:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:24:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:53,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:24:53,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:24:53,889 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:24:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:54,250 INFO L93 Difference]: Finished difference Result 751 states and 1105 transitions. [2025-02-06 03:24:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:24:54,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-06 03:24:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:54,253 INFO L225 Difference]: With dead ends: 751 [2025-02-06 03:24:54,254 INFO L226 Difference]: Without dead ends: 434 [2025-02-06 03:24:54,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:24:54,255 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 125 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:54,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 442 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:24:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-02-06 03:24:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 430. [2025-02-06 03:24:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 397 states have (on average 1.4433249370277077) internal successors, (573), 398 states have internal predecessors, (573), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 629 transitions. [2025-02-06 03:24:54,287 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 629 transitions. Word has length 108 [2025-02-06 03:24:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:54,287 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 629 transitions. [2025-02-06 03:24:54,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:24:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 629 transitions. [2025-02-06 03:24:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:24:54,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:54,289 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:54,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:24:54,289 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:54,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2092626758, now seen corresponding path program 1 times [2025-02-06 03:24:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:54,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777839370] [2025-02-06 03:24:54,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:54,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:24:54,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:24:54,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:54,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:55,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:55,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777839370] [2025-02-06 03:24:55,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777839370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:55,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:55,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:24:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108985944] [2025-02-06 03:24:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:55,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:24:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:55,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:24:55,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:24:55,232 INFO L87 Difference]: Start difference. First operand 430 states and 629 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:24:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:56,060 INFO L93 Difference]: Finished difference Result 912 states and 1335 transitions. [2025-02-06 03:24:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:24:56,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-06 03:24:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:56,064 INFO L225 Difference]: With dead ends: 912 [2025-02-06 03:24:56,064 INFO L226 Difference]: Without dead ends: 624 [2025-02-06 03:24:56,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:24:56,066 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 404 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:56,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 841 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:24:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-06 03:24:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 497. [2025-02-06 03:24:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 464 states have (on average 1.4504310344827587) internal successors, (673), 465 states have internal predecessors, (673), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 729 transitions. [2025-02-06 03:24:56,104 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 729 transitions. Word has length 108 [2025-02-06 03:24:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:56,104 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 729 transitions. [2025-02-06 03:24:56,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:24:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 729 transitions. [2025-02-06 03:24:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:24:56,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:56,107 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:56,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:24:56,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:56,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -401704603, now seen corresponding path program 1 times [2025-02-06 03:24:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797596001] [2025-02-06 03:24:56,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:56,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:24:56,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:24:56,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:56,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797596001] [2025-02-06 03:24:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797596001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:24:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050539086] [2025-02-06 03:24:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:57,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:24:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:57,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:24:57,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:24:57,147 INFO L87 Difference]: Start difference. First operand 497 states and 729 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-06 03:24:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:57,790 INFO L93 Difference]: Finished difference Result 937 states and 1375 transitions. [2025-02-06 03:24:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:24:57,791 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2025-02-06 03:24:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:57,793 INFO L225 Difference]: With dead ends: 937 [2025-02-06 03:24:57,793 INFO L226 Difference]: Without dead ends: 604 [2025-02-06 03:24:57,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:24:57,796 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 428 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:57,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 573 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:24:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-02-06 03:24:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 471. [2025-02-06 03:24:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 438 states have (on average 1.4429223744292237) internal successors, (632), 439 states have internal predecessors, (632), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 688 transitions. [2025-02-06 03:24:57,831 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 688 transitions. Word has length 108 [2025-02-06 03:24:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 688 transitions. [2025-02-06 03:24:57,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-06 03:24:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 688 transitions. [2025-02-06 03:24:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:24:57,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:57,833 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:57,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:24:57,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:57,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1066234916, now seen corresponding path program 1 times [2025-02-06 03:24:57,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:57,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14364830] [2025-02-06 03:24:57,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:57,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:57,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:24:57,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:24:57,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:57,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:24:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:24:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:24:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14364830] [2025-02-06 03:24:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14364830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:24:58,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:24:58,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:24:58,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297132158] [2025-02-06 03:24:58,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:24:58,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:24:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:24:58,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:24:58,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:24:58,624 INFO L87 Difference]: Start difference. First operand 471 states and 688 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:24:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:24:59,449 INFO L93 Difference]: Finished difference Result 915 states and 1330 transitions. [2025-02-06 03:24:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:24:59,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-02-06 03:24:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:24:59,454 INFO L225 Difference]: With dead ends: 915 [2025-02-06 03:24:59,454 INFO L226 Difference]: Without dead ends: 608 [2025-02-06 03:24:59,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:24:59,458 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 541 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:24:59,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 776 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:24:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-06 03:24:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 481. [2025-02-06 03:24:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 448 states have (on average 1.4375) internal successors, (644), 449 states have internal predecessors, (644), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:24:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 700 transitions. [2025-02-06 03:24:59,506 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 700 transitions. Word has length 109 [2025-02-06 03:24:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:24:59,507 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 700 transitions. [2025-02-06 03:24:59,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:24:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 700 transitions. [2025-02-06 03:24:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:24:59,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:24:59,508 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:24:59,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:24:59,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:24:59,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:24:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1205384767, now seen corresponding path program 1 times [2025-02-06 03:24:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:24:59,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264249282] [2025-02-06 03:24:59,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:24:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:24:59,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:24:59,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:24:59,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:24:59,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:25:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:25:00,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:25:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264249282] [2025-02-06 03:25:00,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264249282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:25:00,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:25:00,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:25:00,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921112597] [2025-02-06 03:25:00,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:25:00,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:25:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:25:00,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:25:00,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:25:00,472 INFO L87 Difference]: Start difference. First operand 481 states and 700 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:25:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:25:01,264 INFO L93 Difference]: Finished difference Result 853 states and 1245 transitions. [2025-02-06 03:25:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:25:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-02-06 03:25:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:25:01,267 INFO L225 Difference]: With dead ends: 853 [2025-02-06 03:25:01,267 INFO L226 Difference]: Without dead ends: 536 [2025-02-06 03:25:01,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:25:01,268 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 407 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:25:01,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 834 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:25:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-06 03:25:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 471. [2025-02-06 03:25:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 438 states have (on average 1.4337899543378996) internal successors, (628), 439 states have internal predecessors, (628), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:25:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 684 transitions. [2025-02-06 03:25:01,305 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 684 transitions. Word has length 109 [2025-02-06 03:25:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:25:01,305 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 684 transitions. [2025-02-06 03:25:01,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:25:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 684 transitions. [2025-02-06 03:25:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:25:01,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:25:01,308 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:25:01,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:25:01,308 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:25:01,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:25:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash -592057980, now seen corresponding path program 1 times [2025-02-06 03:25:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:25:01,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440841608] [2025-02-06 03:25:01,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:01,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:25:01,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:25:01,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:25:01,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:01,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:25:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:25:02,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:25:02,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440841608] [2025-02-06 03:25:02,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440841608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:25:02,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:25:02,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:25:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960768594] [2025-02-06 03:25:02,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:25:02,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:25:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:25:02,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:25:02,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:25:02,574 INFO L87 Difference]: Start difference. First operand 471 states and 684 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:25:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:25:04,024 INFO L93 Difference]: Finished difference Result 920 states and 1336 transitions. [2025-02-06 03:25:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:25:04,025 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-02-06 03:25:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:25:04,028 INFO L225 Difference]: With dead ends: 920 [2025-02-06 03:25:04,028 INFO L226 Difference]: Without dead ends: 613 [2025-02-06 03:25:04,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:25:04,029 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 321 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:25:04,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 2016 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:25:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-02-06 03:25:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 535. [2025-02-06 03:25:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 502 states have (on average 1.4382470119521913) internal successors, (722), 503 states have internal predecessors, (722), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:25:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 778 transitions. [2025-02-06 03:25:04,084 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 778 transitions. Word has length 110 [2025-02-06 03:25:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:25:04,085 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 778 transitions. [2025-02-06 03:25:04,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:25:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 778 transitions. [2025-02-06 03:25:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:25:04,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:25:04,087 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:25:04,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:25:04,088 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:25:04,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:25:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash -832902818, now seen corresponding path program 1 times [2025-02-06 03:25:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:25:04,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305799305] [2025-02-06 03:25:04,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:25:04,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:25:04,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:25:04,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:04,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:25:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:25:05,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:25:05,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305799305] [2025-02-06 03:25:05,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305799305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:25:05,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:25:05,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:25:05,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509759909] [2025-02-06 03:25:05,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:25:05,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:25:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:25:05,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:25:05,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:25:05,806 INFO L87 Difference]: Start difference. First operand 535 states and 778 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-06 03:25:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:25:06,641 INFO L93 Difference]: Finished difference Result 942 states and 1374 transitions. [2025-02-06 03:25:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:25:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 111 [2025-02-06 03:25:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:25:06,644 INFO L225 Difference]: With dead ends: 942 [2025-02-06 03:25:06,645 INFO L226 Difference]: Without dead ends: 597 [2025-02-06 03:25:06,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:25:06,646 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 365 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:25:06,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 788 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:25:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-06 03:25:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 525. [2025-02-06 03:25:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 492 states have (on average 1.4390243902439024) internal successors, (708), 493 states have internal predecessors, (708), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:25:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 764 transitions. [2025-02-06 03:25:06,682 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 764 transitions. Word has length 111 [2025-02-06 03:25:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:25:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 764 transitions. [2025-02-06 03:25:06,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-06 03:25:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 764 transitions. [2025-02-06 03:25:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:25:06,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:25:06,684 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:25:06,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:25:06,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:25:06,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:25:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -638300604, now seen corresponding path program 1 times [2025-02-06 03:25:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:25:06,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944419312] [2025-02-06 03:25:06,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:25:06,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:25:06,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:25:06,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:06,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:25:06,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072912881] [2025-02-06 03:25:06,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:06,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:25:06,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:25:06,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:25:06,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:25:06,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:25:07,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:25:07,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:07,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:25:07,055 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:25:07,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:25:07,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:25:07,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:07,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:25:07,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:25:07,334 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:25:07,335 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:25:07,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:25:07,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 03:25:07,542 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:25:07,668 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:25:07,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:25:07 BoogieIcfgContainer [2025-02-06 03:25:07,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:25:07,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:25:07,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:25:07,673 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:25:07,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:24:40" (3/4) ... [2025-02-06 03:25:07,676 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:25:07,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:25:07,677 INFO L158 Benchmark]: Toolchain (without parser) took 28208.34ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 113.0MB in the beginning and 387.3MB in the end (delta: -274.4MB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. [2025-02-06 03:25:07,677 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:25:07,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.36ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 97.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:25:07,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.08ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 93.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:25:07,677 INFO L158 Benchmark]: Boogie Preprocessor took 58.25ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 89.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:25:07,678 INFO L158 Benchmark]: IcfgBuilder took 804.02ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 52.4MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:25:07,678 INFO L158 Benchmark]: TraceAbstraction took 26923.03ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 52.0MB in the beginning and 391.6MB in the end (delta: -339.7MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. [2025-02-06 03:25:07,678 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 578.8MB. Free memory was 391.6MB in the beginning and 387.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:25:07,679 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.55ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.36ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 97.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.08ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 93.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.25ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 89.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 804.02ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 52.4MB in the end (delta: 37.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26923.03ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 52.0MB in the beginning and 391.6MB in the end (delta: -339.7MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 578.8MB. Free memory was 391.6MB in the beginning and 387.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. 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 77, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L35] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0][0]); [L36] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1][0]); [L37] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[0][1]); [L38] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer = &(unsigned_short_int_Array_0[1][1]); [L39] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer = &(unsigned_short_int_Array_0[0][2]); [L40] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer = &(unsigned_short_int_Array_0[1][2]); [L41] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 8; [L42] unsigned short int last_1_unsigned_short_int_Array_0_1__2_ = 10; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=0, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR unsigned_short_int_Array_0[0][0] [L94] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L95] EXPR unsigned_short_int_Array_0[1][2] [L95] last_1_unsigned_short_int_Array_0_1__2_ = unsigned_short_int_Array_0[1][2] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L74] 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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L74] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] 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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L76] float_Array_0[0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] 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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L80] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L81] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L81] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L81] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L83] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L84] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L86] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L87] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L87] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L87] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L89] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L90] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \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}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L106] RET updateVariables() [L107] CALL step() [L46] COND TRUE last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L47] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L47] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) = (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))) [L49] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L49] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L49] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L49] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L60] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L60] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) [L62] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L62] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L62] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) [L69] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L69] (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1 [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L98] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L98] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) [L98] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) [L98] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L98] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L98] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98-L99] return (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) ; [L108] RET, EXPR property() [L108] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 18, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4915 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4906 mSDsluCounter, 11497 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9062 mSDsCounter, 367 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6944 IncrementalHoareTripleChecker+Invalid, 7311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 367 mSolverCounterUnsat, 2435 mSDtfsCounter, 6944 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=535occurred in iteration=16, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1150 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1986 ConstructedInterpolants, 0 QuantifiedInterpolants, 16798 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1140 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 4961/5016 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-02-06 03:25:07,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:25:09,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:25:10,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:25:10,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:25:10,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:25:10,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:25:10,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:25:10,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:25:10,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:25:10,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:25:10,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:25:10,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:25:10,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:25:10,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:25:10,068 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:25:10,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:25:10,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:25:10,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:25:10,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:25:10,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:25:10,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:25:10,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:25:10,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:25:10,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:25:10,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:25:10,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:25:10,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:25:10,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:25:10,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:25:10,074 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-jdk21/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 -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2025-02-06 03:25:10,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:25:10,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:25:10,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:25:10,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:25:10,383 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:25:10,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2025-02-06 03:25:11,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5be479ac/5f35fb97e2034c99846b3cfc8be147e0/FLAG759c80944 [2025-02-06 03:25:11,961 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:25:11,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2025-02-06 03:25:11,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5be479ac/5f35fb97e2034c99846b3cfc8be147e0/FLAG759c80944 [2025-02-06 03:25:11,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5be479ac/5f35fb97e2034c99846b3cfc8be147e0 [2025-02-06 03:25:11,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:25:11,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:25:11,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:25:11,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:25:12,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:25:12,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:25:11" (1/1) ... [2025-02-06 03:25:12,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a03345c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12, skipping insertion in model container [2025-02-06 03:25:12,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:25:11" (1/1) ... [2025-02-06 03:25:12,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:25:12,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2025-02-06 03:25:12,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:25:12,283 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:25:12,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2025-02-06 03:25:12,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:25:12,375 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:25:12,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12 WrapperNode [2025-02-06 03:25:12,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:25:12,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:25:12,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:25:12,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:25:12,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,460 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 507 [2025-02-06 03:25:12,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:25:12,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:25:12,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:25:12,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:25:12,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,514 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2025-02-06 03:25:12,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:25:12,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:25:12,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:25:12,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:25:12,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (1/1) ... [2025-02-06 03:25:12,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:25:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:25:12,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:25:12,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:25:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:25:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:25:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:25:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:25:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:25:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:25:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:25:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:25:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:25:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:25:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:25:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:25:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:25:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:25:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:25:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:25:12,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:25:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:25:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:25:12,774 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:25:12,776 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:25:13,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite98#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite97#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite124#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite121#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-02-06 03:25:13,519 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-02-06 03:25:13,519 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:25:13,531 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:25:13,531 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:25:13,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:25:13 BoogieIcfgContainer [2025-02-06 03:25:13,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:25:13,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:25:13,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:25:13,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:25:13,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:25:11" (1/3) ... [2025-02-06 03:25:13,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a01852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:25:13, skipping insertion in model container [2025-02-06 03:25:13,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:25:12" (2/3) ... [2025-02-06 03:25:13,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a01852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:25:13, skipping insertion in model container [2025-02-06 03:25:13,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:25:13" (3/3) ... [2025-02-06 03:25:13,540 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2025-02-06 03:25:13,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:25:13,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-2.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:25:13,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:25:13,617 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;@2882409c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:25:13,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:25:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:25:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:25:13,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:25:13,632 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:25:13,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:25:13,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:25:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1373373181, now seen corresponding path program 1 times [2025-02-06 03:25:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:25:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783098677] [2025-02-06 03:25:13,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:13,648 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-02-06 03:25:13,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:25:13,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:13,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:13,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:25:13,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:25:13,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:13,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:25:13,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:25:13,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:25:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-06 03:25:13,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:25:13,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:25:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783098677] [2025-02-06 03:25:13,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783098677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:25:13,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:25:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:25:13,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510590286] [2025-02-06 03:25:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:25:13,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:25:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:25:13,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:25:13,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:25:13,998 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:25:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:25:14,020 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2025-02-06 03:25:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:25:14,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-02-06 03:25:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:25:14,027 INFO L225 Difference]: With dead ends: 192 [2025-02-06 03:25:14,027 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:25:14,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-02-06 03:25:14,032 INFO L435 NwaCegarLoop]: 141 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, 141 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-02-06 03:25:14,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:25:14,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:25:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 03:25:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:25:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2025-02-06 03:25:14,070 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 100 [2025-02-06 03:25:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:25:14,071 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2025-02-06 03:25:14,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:25:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2025-02-06 03:25:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:25:14,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:25:14,074 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:25:14,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:14,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:14,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:25:14,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:25:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash 879982823, now seen corresponding path program 1 times [2025-02-06 03:25:14,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:25:14,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775633116] [2025-02-06 03:25:14,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:14,281 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-02-06 03:25:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:25:14,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:14,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:14,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:25:14,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:25:14,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:14,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:25:14,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:25:14,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:25:14,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:25:14,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 03:25:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:25:15,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:25:15,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:25:15,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775633116] [2025-02-06 03:25:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775633116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:25:15,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:25:15,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:25:15,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351979816] [2025-02-06 03:25:15,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:25:15,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:25:15,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:25:15,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:25:15,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:25:15,126 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:25:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:25:15,493 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2025-02-06 03:25:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:25:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2025-02-06 03:25:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:25:15,497 INFO L225 Difference]: With dead ends: 283 [2025-02-06 03:25:15,497 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 03:25:15,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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-02-06 03:25:15,499 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 128 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:25:15,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 348 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:25:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 03:25:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 158. [2025-02-06 03:25:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 131 states have (on average 1.4045801526717556) internal successors, (184), 131 states have internal predecessors, (184), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:25:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions. [2025-02-06 03:25:15,521 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 100 [2025-02-06 03:25:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:25:15,521 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 232 transitions. [2025-02-06 03:25:15,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:25:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions. [2025-02-06 03:25:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:25:15,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:25:15,525 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:25:15,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:25:15,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:15,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:25:15,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:25:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2066356826, now seen corresponding path program 1 times [2025-02-06 03:25:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:25:15,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010480390] [2025-02-06 03:25:15,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:15,727 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-02-06 03:25:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:25:15,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:15,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:15,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:25:15,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:25:15,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:15,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:25:16,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:25:16,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:25:16,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:25:16,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2025-02-06 03:25:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:25:16,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:25:16,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:25:16,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010480390] [2025-02-06 03:25:16,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010480390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:25:16,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:25:16,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:25:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452057254] [2025-02-06 03:25:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:25:16,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:25:16,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:25:16,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:25:16,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:25:16,136 INFO L87 Difference]: Start difference. First operand 158 states and 232 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:25:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:25:16,562 INFO L93 Difference]: Finished difference Result 310 states and 453 transitions. [2025-02-06 03:25:16,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:25:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-02-06 03:25:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:25:16,566 INFO L225 Difference]: With dead ends: 310 [2025-02-06 03:25:16,567 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 03:25:16,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:25:16,569 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 78 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:25:16,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 509 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:25:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 03:25:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2025-02-06 03:25:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 182 states have (on average 1.4065934065934067) internal successors, (256), 183 states have internal predecessors, (256), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:25:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 312 transitions. [2025-02-06 03:25:16,601 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 312 transitions. Word has length 106 [2025-02-06 03:25:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:25:16,601 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 312 transitions. [2025-02-06 03:25:16,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:25:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 312 transitions. [2025-02-06 03:25:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 03:25:16,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:25:16,603 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:25:16,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:25:16,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:16,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:25:16,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:25:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash 269405467, now seen corresponding path program 1 times [2025-02-06 03:25:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:25:16,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182915775] [2025-02-06 03:25:16,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:16,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:25:16,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:25:16,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:16,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:25:16,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:25:17,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:25:17,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:17,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:25:17,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 03:25:17,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:25:18,919 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-02-06 03:25:19,583 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-02-06 03:25:20,322 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 31 treesize of output 33 [2025-02-06 03:25:21,173 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2025-02-06 03:25:21,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 59 [2025-02-06 03:25:21,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:25:21,461 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 71 treesize of output 39 [2025-02-06 03:25:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 83 proven. 86 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-06 03:25:21,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:25:30,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:25:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182915775] [2025-02-06 03:25:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182915775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:25:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [70488382] [2025-02-06 03:25:30,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:25:30,589 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:25:30,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:25:30,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:25:30,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-06 03:25:30,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 03:25:31,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 03:25:31,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:25:31,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:25:31,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 03:25:31,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:25:34,253 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-02-06 03:25:35,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:25:37,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2025-02-06 03:25:39,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2025-02-06 03:25:40,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2025-02-06 03:25:40,908 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 0 case distinctions, treesize of input 67 treesize of output 39 [2025-02-06 03:25:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 86 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-06 03:25:41,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:25:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [70488382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:25:41,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:25:41,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2025-02-06 03:25:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163996290] [2025-02-06 03:25:41,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:25:41,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 03:25:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:25:41,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 03:25:41,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1211, Unknown=2, NotChecked=0, Total=1406 [2025-02-06 03:25:41,467 INFO L87 Difference]: Start difference. First operand 214 states and 312 transitions. Second operand has 32 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 29 states have internal predecessors, (111), 11 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (24), 9 states have call predecessors, (24), 11 states have call successors, (24)