./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9264bbfdf2a1620837a07867e3cbb7cf72b4482249c5838c21d858e0ef02c20c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:39:37,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:39:37,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:39:37,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:39:37,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:39:37,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:39:37,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:39:37,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:39:37,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:39:37,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:39:37,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:39:37,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:39:37,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:39:37,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:39:37,931 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:39:37,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:39:37,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:39:37,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:39:37,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:39:37,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:39:37,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:39:37,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:39:37,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:39:37,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:39:37,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:39:37,935 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:39:37,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:39:37,935 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:39:37,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:39:37,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:39:37,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:39:37,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:39:37,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:39:37,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:39:37,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:39:37,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:39:37,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:39:37,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:39:37,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:39:37,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:39:37,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:39:37,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:39:37,939 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9264bbfdf2a1620837a07867e3cbb7cf72b4482249c5838c21d858e0ef02c20c [2024-11-09 01:39:38,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:39:38,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:39:38,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:39:38,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:39:38,248 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:39:38,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2024-11-09 01:39:39,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:39:39,972 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:39:39,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2024-11-09 01:39:39,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd4fc0ba/9bbec3ab7815474a909c3c93cb257540/FLAGe55da7132 [2024-11-09 01:39:40,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd4fc0ba/9bbec3ab7815474a909c3c93cb257540 [2024-11-09 01:39:40,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:39:40,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:39:40,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:39:40,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:39:40,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:39:40,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207e5f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40, skipping insertion in model container [2024-11-09 01:39:40,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:39:40,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i[917,930] [2024-11-09 01:39:40,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:39:40,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:39:40,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i[917,930] [2024-11-09 01:39:40,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:39:40,409 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:39:40,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40 WrapperNode [2024-11-09 01:39:40,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:39:40,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:39:40,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:39:40,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:39:40,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,469 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-11-09 01:39:40,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:39:40,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:39:40,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:39:40,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:39:40,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,519 INFO L175 MemorySlicer]: Split 126 memory accesses to 6 slices as follows [2, 27, 23, 56, 7, 11]. 44 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 5, 1, 2]. The 17 writes are split as follows [0, 5, 2, 7, 1, 2]. [2024-11-09 01:39:40,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:39:40,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:39:40,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:39:40,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:39:40,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (1/1) ... [2024-11-09 01:39:40,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:39:40,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:39:40,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:39:40,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:39:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:39:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:39:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:39:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:39:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:39:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:39:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:39:40,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:39:40,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:39:40,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:39:40,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:39:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:39:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:39:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:39:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:39:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:39:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:39:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:39:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:39:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:39:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:39:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:39:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:39:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:39:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:39:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:39:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:39:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:39:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:39:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:39:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:39:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:39:40,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:39:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:39:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:39:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:39:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:39:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:39:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:39:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:39:40,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:39:40,822 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:39:40,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:39:41,260 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-09 01:39:41,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:39:41,273 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:39:41,273 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:39:41,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:41 BoogieIcfgContainer [2024-11-09 01:39:41,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:39:41,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:39:41,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:39:41,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:39:41,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:39:40" (1/3) ... [2024-11-09 01:39:41,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f27ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:39:41, skipping insertion in model container [2024-11-09 01:39:41,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:40" (2/3) ... [2024-11-09 01:39:41,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f27ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:39:41, skipping insertion in model container [2024-11-09 01:39:41,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:41" (3/3) ... [2024-11-09 01:39:41,283 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-24.i [2024-11-09 01:39:41,299 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:39:41,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:39:41,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:39:41,367 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;@233839d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:39:41,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:39:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:39:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:41,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:41,402 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:41,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:41,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1229634641, now seen corresponding path program 1 times [2024-11-09 01:39:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753524318] [2024-11-09 01:39:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:41,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753524318] [2024-11-09 01:39:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753524318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:41,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:39:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167029449] [2024-11-09 01:39:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:41,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:39:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:39:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:39:41,923 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:39:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:41,961 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-09 01:39:41,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:39:41,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-09 01:39:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:41,971 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:39:41,972 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:39:41,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:39:41,980 INFO L432 NwaCegarLoop]: 139 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, 139 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 [2024-11-09 01:39:41,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:39:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 01:39:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:39:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-09 01:39:42,028 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-09 01:39:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:42,029 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-09 01:39:42,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:39:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-09 01:39:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:42,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:42,034 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:42,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:39:42,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:42,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1841919127, now seen corresponding path program 1 times [2024-11-09 01:39:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:42,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647818824] [2024-11-09 01:39:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647818824] [2024-11-09 01:39:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647818824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:42,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777649584] [2024-11-09 01:39:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:39:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:39:42,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:42,343 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:42,376 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-09 01:39:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:39:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-09 01:39:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:42,381 INFO L225 Difference]: With dead ends: 192 [2024-11-09 01:39:42,381 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:39:42,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:42,384 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:42,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:39:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 01:39:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:39:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-09 01:39:42,406 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-09 01:39:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:42,408 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-09 01:39:42,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-09 01:39:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:42,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:42,412 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:42,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:39:42,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:42,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash 647609835, now seen corresponding path program 1 times [2024-11-09 01:39:42,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569155854] [2024-11-09 01:39:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:42,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:42,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569155854] [2024-11-09 01:39:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569155854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:42,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:42,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:42,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179766716] [2024-11-09 01:39:42,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:42,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:39:42,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:42,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:39:42,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:42,637 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:42,660 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-09 01:39:42,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:39:42,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-09 01:39:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:42,662 INFO L225 Difference]: With dead ends: 194 [2024-11-09 01:39:42,662 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 01:39:42,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:39:42,664 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:42,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 01:39:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 01:39:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:39:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-09 01:39:42,680 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-09 01:39:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:42,681 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-09 01:39:42,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-09 01:39:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:42,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:42,683 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:42,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:39:42,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:42,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash -373458519, now seen corresponding path program 1 times [2024-11-09 01:39:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:42,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337727495] [2024-11-09 01:39:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337727495] [2024-11-09 01:39:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337727495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:42,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:42,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:39:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53785703] [2024-11-09 01:39:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:42,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:42,911 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:42,953 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-09 01:39:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-09 01:39:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:42,959 INFO L225 Difference]: With dead ends: 198 [2024-11-09 01:39:42,959 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 01:39:42,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:42,962 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:42,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 01:39:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-09 01:39:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:39:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-09 01:39:42,975 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2024-11-09 01:39:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:42,976 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-09 01:39:42,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-09 01:39:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:42,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:42,982 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:42,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:39:42,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:42,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash 306599851, now seen corresponding path program 1 times [2024-11-09 01:39:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:42,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234248917] [2024-11-09 01:39:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:43,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:43,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234248917] [2024-11-09 01:39:43,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234248917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:43,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:43,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:39:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86233213] [2024-11-09 01:39:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:43,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:43,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:43,210 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:43,244 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-09 01:39:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-09 01:39:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:43,247 INFO L225 Difference]: With dead ends: 202 [2024-11-09 01:39:43,249 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 01:39:43,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:43,251 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:43,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 01:39:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-09 01:39:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:39:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-09 01:39:43,264 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-09 01:39:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:43,268 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-09 01:39:43,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-09 01:39:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:43,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:43,269 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:43,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:39:43,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2081607213, now seen corresponding path program 1 times [2024-11-09 01:39:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:43,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447495359] [2024-11-09 01:39:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:43,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:43,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:43,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447495359] [2024-11-09 01:39:43,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447495359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:43,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:43,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:39:43,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376754693] [2024-11-09 01:39:43,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:43,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:43,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:43,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:43,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:43,445 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:43,470 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-09 01:39:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:43,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-09 01:39:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:43,472 INFO L225 Difference]: With dead ends: 206 [2024-11-09 01:39:43,472 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:39:43,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:43,474 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:43,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:43,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:39:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-09 01:39:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:39:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-09 01:39:43,488 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-09 01:39:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:43,490 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-09 01:39:43,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-09 01:39:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:43,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:43,492 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:43,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:39:43,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:43,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:43,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2083454255, now seen corresponding path program 1 times [2024-11-09 01:39:43,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:43,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476076694] [2024-11-09 01:39:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:44,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:44,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476076694] [2024-11-09 01:39:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476076694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:44,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:44,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:39:44,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99844814] [2024-11-09 01:39:44,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:44,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:39:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:44,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:39:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:44,047 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:44,361 INFO L93 Difference]: Finished difference Result 282 states and 394 transitions. [2024-11-09 01:39:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:39:44,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-09 01:39:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:44,364 INFO L225 Difference]: With dead ends: 282 [2024-11-09 01:39:44,364 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 01:39:44,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:39:44,366 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 208 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:44,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 559 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:39:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 01:39:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-11-09 01:39:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 153 states have internal predecessors, (203), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2024-11-09 01:39:44,384 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 124 [2024-11-09 01:39:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:44,384 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2024-11-09 01:39:44,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2024-11-09 01:39:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:39:44,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:44,386 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:44,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:39:44,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:44,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash 169548494, now seen corresponding path program 1 times [2024-11-09 01:39:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388609428] [2024-11-09 01:39:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388609428] [2024-11-09 01:39:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388609428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:39:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907874942] [2024-11-09 01:39:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:44,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:39:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:44,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:39:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:44,976 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:45,096 INFO L93 Difference]: Finished difference Result 518 states and 722 transitions. [2024-11-09 01:39:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:39:45,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-09 01:39:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:45,100 INFO L225 Difference]: With dead ends: 518 [2024-11-09 01:39:45,100 INFO L226 Difference]: Without dead ends: 344 [2024-11-09 01:39:45,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:39:45,104 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 216 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:45,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 594 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-09 01:39:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 195. [2024-11-09 01:39:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 170 states have (on average 1.3470588235294119) internal successors, (229), 171 states have internal predecessors, (229), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 273 transitions. [2024-11-09 01:39:45,124 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 273 transitions. Word has length 125 [2024-11-09 01:39:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:45,125 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 273 transitions. [2024-11-09 01:39:45,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions. [2024-11-09 01:39:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:39:45,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:45,127 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:39:45,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:45,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:45,129 INFO L85 PathProgramCache]: Analyzing trace with hash 35534988, now seen corresponding path program 1 times [2024-11-09 01:39:45,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:45,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183569231] [2024-11-09 01:39:45,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:45,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:45,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183569231] [2024-11-09 01:39:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183569231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:45,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:45,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:39:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852024566] [2024-11-09 01:39:45,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:45,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:39:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:39:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:45,622 INFO L87 Difference]: Start difference. First operand 195 states and 273 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:45,734 INFO L93 Difference]: Finished difference Result 536 states and 747 transitions. [2024-11-09 01:39:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:39:45,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-09 01:39:45,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:45,737 INFO L225 Difference]: With dead ends: 536 [2024-11-09 01:39:45,737 INFO L226 Difference]: Without dead ends: 344 [2024-11-09 01:39:45,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:39:45,738 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 210 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:45,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 671 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:45,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-09 01:39:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 197. [2024-11-09 01:39:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 172 states have (on average 1.3488372093023255) internal successors, (232), 173 states have internal predecessors, (232), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 276 transitions. [2024-11-09 01:39:45,748 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 276 transitions. Word has length 125 [2024-11-09 01:39:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:45,749 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 276 transitions. [2024-11-09 01:39:45,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 276 transitions. [2024-11-09 01:39:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:39:45,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:45,750 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:45,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:39:45,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:45,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash 107508880, now seen corresponding path program 1 times [2024-11-09 01:39:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:45,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589279941] [2024-11-09 01:39:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:45,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:46,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589279941] [2024-11-09 01:39:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589279941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:46,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:46,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:46,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188747004] [2024-11-09 01:39:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:46,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:46,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:46,075 INFO L87 Difference]: Start difference. First operand 197 states and 276 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:46,151 INFO L93 Difference]: Finished difference Result 447 states and 626 transitions. [2024-11-09 01:39:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:39:46,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-09 01:39:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:46,154 INFO L225 Difference]: With dead ends: 447 [2024-11-09 01:39:46,154 INFO L226 Difference]: Without dead ends: 253 [2024-11-09 01:39:46,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:46,155 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 128 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:46,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 485 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-09 01:39:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 196. [2024-11-09 01:39:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 172 states have internal predecessors, (231), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2024-11-09 01:39:46,167 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 125 [2024-11-09 01:39:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:46,167 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2024-11-09 01:39:46,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2024-11-09 01:39:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:39:46,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:46,169 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:46,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:39:46,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:46,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:46,170 INFO L85 PathProgramCache]: Analyzing trace with hash -26504626, now seen corresponding path program 1 times [2024-11-09 01:39:46,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:46,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178197108] [2024-11-09 01:39:46,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:46,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:46,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178197108] [2024-11-09 01:39:46,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178197108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:46,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:46,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:46,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843210699] [2024-11-09 01:39:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:46,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:46,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:46,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:46,472 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:46,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:46,547 INFO L93 Difference]: Finished difference Result 430 states and 601 transitions. [2024-11-09 01:39:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:46,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-09 01:39:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:46,550 INFO L225 Difference]: With dead ends: 430 [2024-11-09 01:39:46,550 INFO L226 Difference]: Without dead ends: 237 [2024-11-09 01:39:46,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:46,551 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 75 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:46,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 505 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-09 01:39:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 192. [2024-11-09 01:39:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.341317365269461) internal successors, (224), 168 states have internal predecessors, (224), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 268 transitions. [2024-11-09 01:39:46,562 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 268 transitions. Word has length 125 [2024-11-09 01:39:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:46,562 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 268 transitions. [2024-11-09 01:39:46,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 268 transitions. [2024-11-09 01:39:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:39:46,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:46,564 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:46,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:39:46,564 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:46,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash -885638388, now seen corresponding path program 1 times [2024-11-09 01:39:46,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903415068] [2024-11-09 01:39:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:47,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903415068] [2024-11-09 01:39:47,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903415068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:47,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:47,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:39:47,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460800852] [2024-11-09 01:39:47,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:47,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:39:47,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:47,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:39:47,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:47,054 INFO L87 Difference]: Start difference. First operand 192 states and 268 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:47,182 INFO L93 Difference]: Finished difference Result 546 states and 760 transitions. [2024-11-09 01:39:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:39:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-09 01:39:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:47,185 INFO L225 Difference]: With dead ends: 546 [2024-11-09 01:39:47,185 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 01:39:47,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:39:47,186 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 141 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:47,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 735 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 01:39:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 218. [2024-11-09 01:39:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 194 states have internal predecessors, (261), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2024-11-09 01:39:47,197 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 126 [2024-11-09 01:39:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:47,198 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2024-11-09 01:39:47,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2024-11-09 01:39:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:39:47,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:47,199 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:47,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:39:47,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:47,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1415184202, now seen corresponding path program 1 times [2024-11-09 01:39:47,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:47,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323000958] [2024-11-09 01:39:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:47,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323000958] [2024-11-09 01:39:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323000958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:39:47,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530269755] [2024-11-09 01:39:47,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:39:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:39:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:47,593 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:47,705 INFO L93 Difference]: Finished difference Result 572 states and 795 transitions. [2024-11-09 01:39:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:39:47,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-09 01:39:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:47,708 INFO L225 Difference]: With dead ends: 572 [2024-11-09 01:39:47,708 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 01:39:47,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:39:47,709 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 234 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:47,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 648 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 01:39:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 222. [2024-11-09 01:39:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 198 states have internal predecessors, (267), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 311 transitions. [2024-11-09 01:39:47,719 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 311 transitions. Word has length 126 [2024-11-09 01:39:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 311 transitions. [2024-11-09 01:39:47,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 311 transitions. [2024-11-09 01:39:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:39:47,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:47,721 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:47,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:39:47,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1486100874, now seen corresponding path program 1 times [2024-11-09 01:39:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965776121] [2024-11-09 01:39:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:47,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965776121] [2024-11-09 01:39:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965776121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:47,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:47,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:47,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008271644] [2024-11-09 01:39:47,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:47,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:47,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:47,940 INFO L87 Difference]: Start difference. First operand 222 states and 311 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:47,999 INFO L93 Difference]: Finished difference Result 480 states and 671 transitions. [2024-11-09 01:39:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:48,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-09 01:39:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:48,001 INFO L225 Difference]: With dead ends: 480 [2024-11-09 01:39:48,001 INFO L226 Difference]: Without dead ends: 261 [2024-11-09 01:39:48,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:48,002 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 137 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:48,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 389 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-09 01:39:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 221. [2024-11-09 01:39:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 196 states have (on average 1.346938775510204) internal successors, (264), 197 states have internal predecessors, (264), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 308 transitions. [2024-11-09 01:39:48,016 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 308 transitions. Word has length 126 [2024-11-09 01:39:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:48,016 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 308 transitions. [2024-11-09 01:39:48,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 308 transitions. [2024-11-09 01:39:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:39:48,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:48,018 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:48,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:39:48,018 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:48,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash -508043832, now seen corresponding path program 1 times [2024-11-09 01:39:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:48,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453078655] [2024-11-09 01:39:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:39:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453078655] [2024-11-09 01:39:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453078655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287283260] [2024-11-09 01:39:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:48,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:48,248 INFO L87 Difference]: Start difference. First operand 221 states and 308 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:48,326 INFO L93 Difference]: Finished difference Result 479 states and 666 transitions. [2024-11-09 01:39:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:48,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-09 01:39:48,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:48,328 INFO L225 Difference]: With dead ends: 479 [2024-11-09 01:39:48,328 INFO L226 Difference]: Without dead ends: 261 [2024-11-09 01:39:48,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:48,329 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 66 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:48,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 549 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-09 01:39:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 192. [2024-11-09 01:39:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.3233532934131738) internal successors, (221), 168 states have internal predecessors, (221), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:39:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 265 transitions. [2024-11-09 01:39:48,338 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 265 transitions. Word has length 126 [2024-11-09 01:39:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:48,339 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 265 transitions. [2024-11-09 01:39:48,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:39:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 265 transitions. [2024-11-09 01:39:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 01:39:48,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:48,340 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:48,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:39:48,340 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:48,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1903072021, now seen corresponding path program 1 times [2024-11-09 01:39:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191251915] [2024-11-09 01:39:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:39:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:39:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:39:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:39:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:39:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:39:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:39:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:39:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:39:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:39:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-09 01:39:49,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:49,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191251915] [2024-11-09 01:39:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191251915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:49,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934831060] [2024-11-09 01:39:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:49,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:39:49,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:39:49,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:39:49,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:39:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:49,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 01:39:49,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:49,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:39:50,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 01:39:50,595 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:39:50,613 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 01:39:50,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 01:39:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 179 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-09 01:39:50,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:50,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934831060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:51,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:39:51,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-11-09 01:39:51,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446327589] [2024-11-09 01:39:51,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:39:51,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:39:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:39:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:39:51,002 INFO L87 Difference]: Start difference. First operand 192 states and 265 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-09 01:39:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:51,618 INFO L93 Difference]: Finished difference Result 507 states and 691 transitions. [2024-11-09 01:39:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:39:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) Word has length 127 [2024-11-09 01:39:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:51,620 INFO L225 Difference]: With dead ends: 507 [2024-11-09 01:39:51,621 INFO L226 Difference]: Without dead ends: 318 [2024-11-09 01:39:51,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-09 01:39:51,622 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 286 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:51,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1254 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:39:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-09 01:39:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 207. [2024-11-09 01:39:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 178 states have (on average 1.303370786516854) internal successors, (232), 180 states have internal predecessors, (232), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 280 transitions. [2024-11-09 01:39:51,638 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 280 transitions. Word has length 127 [2024-11-09 01:39:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:51,638 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 280 transitions. [2024-11-09 01:39:51,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-09 01:39:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 280 transitions. [2024-11-09 01:39:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 01:39:51,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:51,640 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:51,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:39:51,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 01:39:51,841 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1393598931, now seen corresponding path program 1 times [2024-11-09 01:39:51,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:51,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507096345] [2024-11-09 01:39:51,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:40:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:40:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:40:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:40:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:40:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:40:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:40:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:40:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:40:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:40:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:40:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:40:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:40:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:40:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:40:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:40:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:40:06,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507096345] [2024-11-09 01:40:06,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507096345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:40:06,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:40:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:40:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975813397] [2024-11-09 01:40:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:40:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:40:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:40:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:40:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:40:06,327 INFO L87 Difference]: Start difference. First operand 207 states and 280 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:40:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:40:22,088 INFO L93 Difference]: Finished difference Result 485 states and 654 transitions. [2024-11-09 01:40:22,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:40:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2024-11-09 01:40:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:40:22,096 INFO L225 Difference]: With dead ends: 485 [2024-11-09 01:40:22,096 INFO L226 Difference]: Without dead ends: 286 [2024-11-09 01:40:22,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:40:22,097 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 267 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:40:22,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 761 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 01:40:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-09 01:40:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 218. [2024-11-09 01:40:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 189 states have (on average 1.306878306878307) internal successors, (247), 191 states have internal predecessors, (247), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:40:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 295 transitions. [2024-11-09 01:40:22,193 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 295 transitions. Word has length 127 [2024-11-09 01:40:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:40:22,193 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 295 transitions. [2024-11-09 01:40:22,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:40:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 295 transitions. [2024-11-09 01:40:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:40:22,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:40:22,196 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:40:22,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:40:22,197 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:40:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:40:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -453626276, now seen corresponding path program 1 times [2024-11-09 01:40:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:40:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667727127] [2024-11-09 01:40:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:40:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:40:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:40:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:40:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:40:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:40:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:40:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:40:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:40:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:40:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:40:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:40:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:40:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:40:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:40:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:40:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:40:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:40:22,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:40:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667727127] [2024-11-09 01:40:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667727127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:40:22,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:40:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:40:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579341204] [2024-11-09 01:40:22,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:40:22,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:40:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:40:22,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:40:22,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:40:22,386 INFO L87 Difference]: Start difference. First operand 218 states and 295 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:40:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:40:22,485 INFO L93 Difference]: Finished difference Result 434 states and 588 transitions. [2024-11-09 01:40:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:40:22,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-09 01:40:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:40:22,487 INFO L225 Difference]: With dead ends: 434 [2024-11-09 01:40:22,487 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 01:40:22,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:40:22,489 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:40:22,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:40:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 01:40:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-09 01:40:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 197 states have internal predecessors, (253), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:40:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 301 transitions. [2024-11-09 01:40:22,577 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 301 transitions. Word has length 128 [2024-11-09 01:40:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:40:22,578 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 301 transitions. [2024-11-09 01:40:22,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:40:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 301 transitions. [2024-11-09 01:40:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:40:22,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:40:22,579 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:40:22,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:40:22,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:40:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:40:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash 443802692, now seen corresponding path program 1 times [2024-11-09 01:40:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:40:22,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364335919] [2024-11-09 01:40:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:40:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:40:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:40:22,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:40:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:40:22,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:40:22,808 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:40:22,810 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:40:22,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:40:22,814 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:40:22,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:40:22,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:40:22 BoogieIcfgContainer [2024-11-09 01:40:22,979 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:40:22,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:40:22,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:40:22,980 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:40:22,980 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:41" (3/4) ... [2024-11-09 01:40:22,982 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:40:22,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:40:22,984 INFO L158 Benchmark]: Toolchain (without parser) took 42976.25ms. Allocated memory was 178.3MB in the beginning and 880.8MB in the end (delta: 702.5MB). Free memory was 120.5MB in the beginning and 329.6MB in the end (delta: -209.1MB). Peak memory consumption was 494.3MB. Max. memory is 16.1GB. [2024-11-09 01:40:22,984 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:40:22,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.02ms. Allocated memory is still 178.3MB. Free memory was 120.5MB in the beginning and 137.1MB in the end (delta: -16.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 01:40:22,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.56ms. Allocated memory is still 178.3MB. Free memory was 137.1MB in the beginning and 133.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:40:22,986 INFO L158 Benchmark]: Boogie Preprocessor took 94.62ms. Allocated memory is still 178.3MB. Free memory was 133.5MB in the beginning and 128.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:40:22,986 INFO L158 Benchmark]: RCFGBuilder took 705.45ms. Allocated memory is still 178.3MB. Free memory was 128.7MB in the beginning and 93.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-09 01:40:22,986 INFO L158 Benchmark]: TraceAbstraction took 41702.92ms. Allocated memory was 178.3MB in the beginning and 880.8MB in the end (delta: 702.5MB). Free memory was 92.4MB in the beginning and 330.7MB in the end (delta: -238.2MB). Peak memory consumption was 466.2MB. Max. memory is 16.1GB. [2024-11-09 01:40:22,986 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 880.8MB. Free memory was 330.7MB in the beginning and 329.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:40:22,988 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.18ms. Allocated memory is still 100.7MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.02ms. Allocated memory is still 178.3MB. Free memory was 120.5MB in the beginning and 137.1MB in the end (delta: -16.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.56ms. Allocated memory is still 178.3MB. Free memory was 137.1MB in the beginning and 133.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.62ms. Allocated memory is still 178.3MB. Free memory was 133.5MB in the beginning and 128.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 705.45ms. Allocated memory is still 178.3MB. Free memory was 128.7MB in the beginning and 93.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 41702.92ms. Allocated memory was 178.3MB in the beginning and 880.8MB in the end (delta: 702.5MB). Free memory was 92.4MB in the beginning and 330.7MB in the end (delta: -238.2MB). Peak memory consumption was 466.2MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 880.8MB. Free memory was 330.7MB in the beginning and 329.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0][0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1][0]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[0][1]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[1][1]); [L29-L31] float float_Array_0[2] = { 2.25, 199.4 }; [L29-L31] float float_Array_0[2] = { 2.25, 199.4 }; [L29-L31] float float_Array_0[2] = { 2.25, 199.4 }; [L32] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L33] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L34-L36] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L34-L36] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L34-L36] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L34-L36] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L34-L36] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L34-L36] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[2]); [L40] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[3]); [L41] signed char* signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer = &(signed_char_Array_0[4]); [L42-L44] unsigned char unsigned_char_Array_0[1] = { 100 }; [L42-L44] unsigned char unsigned_char_Array_0[1] = { 100 }; [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L46-L48] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L49] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L50] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L76] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L79] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L82] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L84] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L87] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L88] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L90] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L91] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L91] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L91] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L93] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L94] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L94] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L94] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L96] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L97] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L97] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L97] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L98] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L111] RET updateVariables() [L112] CALL step() [L54] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L54] COND FALSE !(! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) [L57] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L57] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) = ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0))) [L59] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L59] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) [L60] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L60] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) [L61] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L61] (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) [L62] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L62] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L62] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) [L63] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L63] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L66] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L66] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L66] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) [L66] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L66] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L66] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L66] EXPR (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) [L66] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L66] EXPR (((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L66] (*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) = (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) [L71] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L71] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L71] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)) [L71] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L71] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L71] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L71] COND FALSE !(((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) [L103] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)))) [L103] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer) [L103] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR (((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103] EXPR (((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L103-L104] return (((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (64.75f < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (((((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))))) && ((((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) * 127.75)) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 3.4)))) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) - (22925 - (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) || (! (! 0))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer={6:4}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.5s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1985 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1971 mSDsluCounter, 9551 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6830 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1564 IncrementalHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 2721 mSDtfsCounter, 1564 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 902 GetRequests, 806 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=18, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 966 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 2510 NumberOfCodeBlocks, 2510 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2362 ConstructedInterpolants, 0 QuantifiedInterpolants, 35147 SizeOfPredicates, 9 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 7765/7980 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:40:23,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9264bbfdf2a1620837a07867e3cbb7cf72b4482249c5838c21d858e0ef02c20c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:40:25,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:40:25,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:40:25,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:40:25,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:40:25,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:40:25,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:40:25,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:40:25,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:40:25,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:40:25,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:40:25,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:40:25,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:40:25,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:40:25,381 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:40:25,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:40:25,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:40:25,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:40:25,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:40:25,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:40:25,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:40:25,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:40:25,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:40:25,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:40:25,387 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:40:25,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:40:25,387 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:40:25,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:40:25,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:40:25,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:40:25,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:40:25,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:40:25,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:40:25,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:40:25,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:40:25,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:40:25,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:40:25,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:40:25,391 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:40:25,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:40:25,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:40:25,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:40:25,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:40:25,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:40:25,392 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9264bbfdf2a1620837a07867e3cbb7cf72b4482249c5838c21d858e0ef02c20c [2024-11-09 01:40:25,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:40:25,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:40:25,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:40:25,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:40:25,744 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:40:25,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2024-11-09 01:40:27,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:40:27,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:40:27,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2024-11-09 01:40:27,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59945cbd4/07359ca2d63043219b9186d17c02b319/FLAGaf4a99102 [2024-11-09 01:40:27,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59945cbd4/07359ca2d63043219b9186d17c02b319 [2024-11-09 01:40:27,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:40:27,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:40:27,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:40:27,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:40:27,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:40:27,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:40:27" (1/1) ... [2024-11-09 01:40:27,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d3b869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:27, skipping insertion in model container [2024-11-09 01:40:27,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:40:27" (1/1) ... [2024-11-09 01:40:27,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:40:28,189 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i[917,930] [2024-11-09 01:40:28,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:40:28,299 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:40:28,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i[917,930] [2024-11-09 01:40:28,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:40:28,392 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:40:28,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28 WrapperNode [2024-11-09 01:40:28,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:40:28,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:40:28,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:40:28,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:40:28,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,472 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-11-09 01:40:28,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:40:28,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:40:28,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:40:28,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:40:28,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,541 INFO L175 MemorySlicer]: Split 126 memory accesses to 6 slices as follows [2, 27, 23, 56, 7, 11]. 44 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 5, 1, 2]. The 17 writes are split as follows [0, 5, 2, 7, 1, 2]. [2024-11-09 01:40:28,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:40:28,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:40:28,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:40:28,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:40:28,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (1/1) ... [2024-11-09 01:40:28,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:40:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:40:28,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:40:28,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:40:28,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:40:28,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:40:28,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:40:28,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:40:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:40:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:40:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:40:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:40:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:40:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:40:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:40:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:40:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:40:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:40:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:40:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:40:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:40:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:40:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:40:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:40:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:40:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:40:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:40:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:40:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:40:28,870 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:40:28,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:40:47,416 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-09 01:40:47,417 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:40:47,439 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:40:47,440 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:40:47,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:40:47 BoogieIcfgContainer [2024-11-09 01:40:47,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:40:47,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:40:47,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:40:47,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:40:47,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:40:27" (1/3) ... [2024-11-09 01:40:47,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292cbfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:40:47, skipping insertion in model container [2024-11-09 01:40:47,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:40:28" (2/3) ... [2024-11-09 01:40:47,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292cbfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:40:47, skipping insertion in model container [2024-11-09 01:40:47,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:40:47" (3/3) ... [2024-11-09 01:40:47,451 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-24.i [2024-11-09 01:40:47,468 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:40:47,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:40:47,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:40:47,543 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;@4a3d2ed2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:40:47,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:40:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:40:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:40:47,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:40:47,568 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:40:47,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:40:47,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:40:47,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1229634641, now seen corresponding path program 1 times [2024-11-09 01:40:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:40:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246492206] [2024-11-09 01:40:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:40:47,593 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 [2024-11-09 01:40:47,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:40:47,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:40:47,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:40:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:48,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:40:48,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:40:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-09 01:40:48,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:40:48,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:40:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246492206] [2024-11-09 01:40:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246492206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:40:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:40:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:40:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281169740] [2024-11-09 01:40:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:40:48,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:40:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:40:48,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:40:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:40:48,789 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:40:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:40:48,821 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-09 01:40:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:40:48,823 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-09 01:40:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:40:48,831 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:40:48,831 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:40:48,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:40:48,838 INFO L432 NwaCegarLoop]: 139 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, 139 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 [2024-11-09 01:40:48,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:40:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:40:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 01:40:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:40:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-09 01:40:48,881 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-09 01:40:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:40:48,881 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-09 01:40:48,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 01:40:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-09 01:40:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:40:48,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:40:48,885 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:40:48,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:40:49,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:40:49,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:40:49,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:40:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1841919127, now seen corresponding path program 1 times [2024-11-09 01:40:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:40:49,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743943727] [2024-11-09 01:40:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:40:49,089 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 [2024-11-09 01:40:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:40:49,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:40:49,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:40:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:50,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:40:50,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:40:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:40:50,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:40:50,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:40:50,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743943727] [2024-11-09 01:40:50,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743943727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:40:50,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:40:50,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:40:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393473846] [2024-11-09 01:40:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:40:50,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:40:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:40:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:40:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:40:50,339 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:40:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:40:50,536 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-09 01:40:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:40:50,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-09 01:40:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:40:50,539 INFO L225 Difference]: With dead ends: 192 [2024-11-09 01:40:50,540 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:40:50,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:40:50,541 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:40:50,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:40:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:40:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 01:40:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:40:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-09 01:40:50,553 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-09 01:40:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:40:50,555 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-09 01:40:50,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:40:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-09 01:40:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:40:50,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:40:50,557 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:40:50,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:40:50,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:40:50,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:40:50,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:40:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash 647609835, now seen corresponding path program 1 times [2024-11-09 01:40:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:40:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958065756] [2024-11-09 01:40:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:40:50,760 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 [2024-11-09 01:40:50,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:40:50,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:40:50,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:40:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:51,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:40:51,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:40:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:40:52,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:40:52,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:40:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958065756] [2024-11-09 01:40:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958065756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:40:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:40:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:40:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759972190] [2024-11-09 01:40:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:40:52,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:40:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:40:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:40:52,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:40:52,905 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:40:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:40:54,507 INFO L93 Difference]: Finished difference Result 243 states and 349 transitions. [2024-11-09 01:40:54,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:40:54,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-09 01:40:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:40:54,510 INFO L225 Difference]: With dead ends: 243 [2024-11-09 01:40:54,510 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 01:40:54,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:40:54,512 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 70 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:40:54,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 522 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 01:40:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 01:40:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2024-11-09 01:40:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 01:40:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-09 01:40:54,524 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 124 [2024-11-09 01:40:54,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:40:54,525 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-09 01:40:54,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 01:40:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-09 01:40:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:40:54,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:40:54,527 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:40:54,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:40:54,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:40:54,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:40:54,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:40:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash -373458519, now seen corresponding path program 1 times [2024-11-09 01:40:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:40:54,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117014883] [2024-11-09 01:40:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:40:54,730 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 [2024-11-09 01:40:54,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:40:54,733 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:40:54,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:40:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:40:55,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:40:55,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:40:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 01:40:56,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:40:56,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:40:56,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117014883] [2024-11-09 01:40:56,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117014883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:40:56,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:40:56,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:40:56,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030647124] [2024-11-09 01:40:56,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:40:56,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:40:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:40:56,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:40:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:40:56,212 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)