./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-24 11:24:54,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:24:54,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:24:54,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:24:54,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:24:54,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:24:54,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:24:54,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:24:54,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:24:54,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:24:54,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:24:54,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:24:54,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:24:54,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:24:54,839 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:24:54,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:24:54,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:24:54,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:24:54,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:24:54,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:24:54,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:24:54,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:24:54,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:24:54,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:24:54,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:24:54,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:24:54,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:24:54,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:24:54,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:24:54,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:24:54,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:24:54,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:24:54,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:24:54,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:24:54,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:24:54,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:24:54,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:24:54,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:24:54,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:24:54,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:24:54,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:24:54,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:24:54,852 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-10-24 11:24:55,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:24:55,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:24:55,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:24:55,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:24:55,139 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:24:55,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2024-10-24 11:24:56,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:24:56,770 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:24:56,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2024-10-24 11:24:56,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc844d524/e6be9949c7c843398ca44ab2260a59b2/FLAGe70877f77 [2024-10-24 11:24:56,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc844d524/e6be9949c7c843398ca44ab2260a59b2 [2024-10-24 11:24:56,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:24:56,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:24:56,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:24:56,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:24:56,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:24:56,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:24:56" (1/1) ... [2024-10-24 11:24:56,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e68c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:56, skipping insertion in model container [2024-10-24 11:24:56,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:24:56" (1/1) ... [2024-10-24 11:24:56,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:24:57,024 WARN L248 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-10-24 11:24:57,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:24:57,131 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:24:57,145 WARN L248 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-10-24 11:24:57,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:24:57,207 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:24:57,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57 WrapperNode [2024-10-24 11:24:57,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:24:57,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:24:57,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:24:57,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:24:57,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,270 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-10-24 11:24:57,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:24:57,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:24:57,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:24:57,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:24:57,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,318 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-10-24 11:24:57,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:24:57,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:24:57,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:24:57,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:24:57,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (1/1) ... [2024-10-24 11:24:57,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:24:57,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:24:57,407 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-10-24 11:24:57,409 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-10-24 11:24:57,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:24:57,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:24:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:24:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:24:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:24:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:24:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:24:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:24:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:24:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:24:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:24:57,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:24:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:24:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:24:57,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:24:57,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:24:57,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:24:57,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:24:57,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:24:57,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:24:57,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:24:57,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:24:57,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:24:57,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:24:57,692 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:24:57,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:24:58,140 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-10-24 11:24:58,140 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:24:58,174 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:24:58,174 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:24:58,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:24:58 BoogieIcfgContainer [2024-10-24 11:24:58,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:24:58,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:24:58,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:24:58,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:24:58,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:24:56" (1/3) ... [2024-10-24 11:24:58,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c649c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:24:58, skipping insertion in model container [2024-10-24 11:24:58,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:57" (2/3) ... [2024-10-24 11:24:58,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c649c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:24:58, skipping insertion in model container [2024-10-24 11:24:58,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:24:58" (3/3) ... [2024-10-24 11:24:58,183 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-24.i [2024-10-24 11:24:58,198 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:24:58,198 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:24:58,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:24:58,253 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;@11f43919, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:24:58,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:24:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 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-10-24 11:24:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:24:58,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:58,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] [2024-10-24 11:24:58,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:58,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash -861634093, now seen corresponding path program 1 times [2024-10-24 11:24:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423305213] [2024-10-24 11:24:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:24:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:24:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:24:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:24:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:24:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:24:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:24:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:24:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:24:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:24:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423305213] [2024-10-24 11:24:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423305213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:58,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:24:58,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565936578] [2024-10-24 11:24:58,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:58,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:24:58,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:24:58,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:24:58,705 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 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) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (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-10-24 11:24:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:58,755 INFO L93 Difference]: Finished difference Result 185 states and 291 transitions. [2024-10-24 11:24:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:24:58,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (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 119 [2024-10-24 11:24:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:58,766 INFO L225 Difference]: With dead ends: 185 [2024-10-24 11:24:58,766 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 11:24:58,770 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-10-24 11:24:58,776 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:58,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 11:24:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-24 11:24:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 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-10-24 11:24:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-24 11:24:58,819 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-10-24 11:24:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:58,819 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-24 11:24:58,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (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-10-24 11:24:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-24 11:24:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:24:58,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:58,823 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] [2024-10-24 11:24:58,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:24:58,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:58,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash -915902451, now seen corresponding path program 1 times [2024-10-24 11:24:58,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214658604] [2024-10-24 11:24:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:58,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:24:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:24:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:24:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:24:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:24:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:24:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:24:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:24:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:24:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:24:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214658604] [2024-10-24 11:24:59,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214658604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:59,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:59,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:24:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490710473] [2024-10-24 11:24:59,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:59,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:24:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:24:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:24:59,196 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-24 11:24:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:59,242 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-24 11:24:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:24:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 119 [2024-10-24 11:24:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:59,246 INFO L225 Difference]: With dead ends: 184 [2024-10-24 11:24:59,246 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:24:59,246 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-10-24 11:24:59,248 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:59,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:24:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:24:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 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-10-24 11:24:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-10-24 11:24:59,270 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 119 [2024-10-24 11:24:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:59,272 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-10-24 11:24:59,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-24 11:24:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-10-24 11:24:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:24:59,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:59,276 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] [2024-10-24 11:24:59,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:24:59,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:59,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash -697047733, now seen corresponding path program 1 times [2024-10-24 11:24:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228614258] [2024-10-24 11:24:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:24:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:24:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:24:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:24:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:24:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:24:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:24:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:24:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:24:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:24:59,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:59,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228614258] [2024-10-24 11:24:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228614258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:59,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:59,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:24:59,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680207073] [2024-10-24 11:24:59,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:59,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:24:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:59,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:24:59,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:24:59,490 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-24 11:24:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:59,531 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-10-24 11:24:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:24:59,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 119 [2024-10-24 11:24:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:59,537 INFO L225 Difference]: With dead ends: 186 [2024-10-24 11:24:59,538 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 11:24:59,538 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-10-24 11:24:59,542 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:59,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 11:24:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 11:24:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 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-10-24 11:24:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-24 11:24:59,553 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 119 [2024-10-24 11:24:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:59,554 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-24 11:24:59,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-24 11:24:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-24 11:24:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:24:59,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:59,556 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] [2024-10-24 11:24:59,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:24:59,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:59,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1976911411, now seen corresponding path program 1 times [2024-10-24 11:24:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:59,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950050263] [2024-10-24 11:24:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:24:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:24:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:24:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:24:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:24:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:24:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:24:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:24:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:24:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:24:59,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:59,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950050263] [2024-10-24 11:24:59,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950050263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:59,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:59,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:24:59,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246629548] [2024-10-24 11:24:59,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:59,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:24:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:59,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:24:59,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:24:59,806 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-24 11:24:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:59,849 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-10-24 11:24:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:24:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 119 [2024-10-24 11:24:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:59,852 INFO L225 Difference]: With dead ends: 190 [2024-10-24 11:24:59,852 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 11:24:59,854 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-10-24 11:24:59,855 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:59,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 374 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 11:24:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-24 11:24:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 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-10-24 11:24:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-24 11:24:59,866 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 119 [2024-10-24 11:24:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:59,867 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-24 11:24:59,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-24 11:24:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-24 11:24:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:24:59,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:59,869 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] [2024-10-24 11:24:59,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:24:59,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:59,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1508709259, now seen corresponding path program 1 times [2024-10-24 11:24:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148437931] [2024-10-24 11:24:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148437931] [2024-10-24 11:25:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148437931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:00,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:25:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043472734] [2024-10-24 11:25:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:25:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:25:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:25:00,051 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-24 11:25:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:00,096 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-10-24 11:25:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:25:00,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 119 [2024-10-24 11:25:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:00,099 INFO L225 Difference]: With dead ends: 194 [2024-10-24 11:25:00,099 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 11:25:00,100 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-10-24 11:25:00,101 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:00,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:25:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 11:25:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-24 11:25:00,114 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-10-24 11:25:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-10-24 11:25:00,115 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 119 [2024-10-24 11:25:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:00,119 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-10-24 11:25:00,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-24 11:25:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-10-24 11:25:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:00,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:00,120 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] [2024-10-24 11:25:00,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:25:00,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1565967561, now seen corresponding path program 1 times [2024-10-24 11:25:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359873735] [2024-10-24 11:25:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359873735] [2024-10-24 11:25:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359873735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:00,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:00,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:25:00,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763474557] [2024-10-24 11:25:00,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:00,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:25:00,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:00,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:25:00,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:25:00,312 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-24 11:25:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:00,345 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-10-24 11:25:00,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:25:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 119 [2024-10-24 11:25:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:00,348 INFO L225 Difference]: With dead ends: 198 [2024-10-24 11:25:00,349 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:25:00,349 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-10-24 11:25:00,351 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:00,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:25:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:25:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-24 11:25:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 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-10-24 11:25:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-10-24 11:25:00,363 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 119 [2024-10-24 11:25:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:00,364 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-10-24 11:25:00,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-24 11:25:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-10-24 11:25:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:00,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:00,369 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] [2024-10-24 11:25:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:25:00,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1566027143, now seen corresponding path program 1 times [2024-10-24 11:25:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915239934] [2024-10-24 11:25:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:00,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:00,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:00,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915239934] [2024-10-24 11:25:00,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915239934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:00,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:00,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:25:00,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915743499] [2024-10-24 11:25:00,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:00,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:25:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:25:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:00,986 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-10-24 11:25:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:01,269 INFO L93 Difference]: Finished difference Result 272 states and 384 transitions. [2024-10-24 11:25:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:25:01,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 119 [2024-10-24 11:25:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:01,271 INFO L225 Difference]: With dead ends: 272 [2024-10-24 11:25:01,272 INFO L226 Difference]: Without dead ends: 173 [2024-10-24 11:25:01,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:25:01,273 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 205 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:01,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 520 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:25:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-24 11:25:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-10-24 11:25:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 145 states have (on average 1.3517241379310345) internal successors, (196), 146 states have internal predecessors, (196), 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-10-24 11:25:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2024-10-24 11:25:01,295 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 119 [2024-10-24 11:25:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:01,296 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2024-10-24 11:25:01,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-10-24 11:25:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2024-10-24 11:25:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:25:01,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:01,297 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] [2024-10-24 11:25:01,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:25:01,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1300953276, now seen corresponding path program 1 times [2024-10-24 11:25:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717307579] [2024-10-24 11:25:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717307579] [2024-10-24 11:25:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717307579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:01,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:01,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:25:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638598091] [2024-10-24 11:25:01,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:01,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:25:01,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:25:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:01,943 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-10-24 11:25:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:02,071 INFO L93 Difference]: Finished difference Result 500 states and 704 transitions. [2024-10-24 11:25:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:25:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 120 [2024-10-24 11:25:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:02,076 INFO L225 Difference]: With dead ends: 500 [2024-10-24 11:25:02,076 INFO L226 Difference]: Without dead ends: 331 [2024-10-24 11:25:02,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:25:02,078 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 208 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:02,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 566 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-24 11:25:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 188. [2024-10-24 11:25:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.361963190184049) internal successors, (222), 164 states have internal predecessors, (222), 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-10-24 11:25:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 266 transitions. [2024-10-24 11:25:02,099 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 266 transitions. Word has length 120 [2024-10-24 11:25:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:02,099 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 266 transitions. [2024-10-24 11:25:02,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-10-24 11:25:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 266 transitions. [2024-10-24 11:25:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:25:02,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:02,103 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] [2024-10-24 11:25:02,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:25:02,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:02,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash -504485058, now seen corresponding path program 1 times [2024-10-24 11:25:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:02,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824103807] [2024-10-24 11:25:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:02,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824103807] [2024-10-24 11:25:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824103807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:02,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:25:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048965893] [2024-10-24 11:25:02,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:02,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:25:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:02,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:25:02,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:02,688 INFO L87 Difference]: Start difference. First operand 188 states and 266 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-10-24 11:25:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:02,809 INFO L93 Difference]: Finished difference Result 518 states and 729 transitions. [2024-10-24 11:25:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:25:02,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 120 [2024-10-24 11:25:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:02,811 INFO L225 Difference]: With dead ends: 518 [2024-10-24 11:25:02,811 INFO L226 Difference]: Without dead ends: 331 [2024-10-24 11:25:02,812 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-10-24 11:25:02,814 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 211 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 577 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-10-24 11:25:02,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 577 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-24 11:25:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 190. [2024-10-24 11:25:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 165 states have (on average 1.3636363636363635) internal successors, (225), 166 states have internal predecessors, (225), 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-10-24 11:25:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 269 transitions. [2024-10-24 11:25:02,827 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 269 transitions. Word has length 120 [2024-10-24 11:25:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:02,828 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 269 transitions. [2024-10-24 11:25:02,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-10-24 11:25:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 269 transitions. [2024-10-24 11:25:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:25:02,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:02,830 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] [2024-10-24 11:25:02,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:25:02,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:02,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1160404666, now seen corresponding path program 1 times [2024-10-24 11:25:02,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:02,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970831257] [2024-10-24 11:25:02,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970831257] [2024-10-24 11:25:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970831257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:03,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:03,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:25:03,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029461517] [2024-10-24 11:25:03,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:03,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:25:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:03,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:25:03,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:25:03,648 INFO L87 Difference]: Start difference. First operand 190 states and 269 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:25:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:03,881 INFO L93 Difference]: Finished difference Result 433 states and 612 transitions. [2024-10-24 11:25:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:25:03,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2024-10-24 11:25:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:03,883 INFO L225 Difference]: With dead ends: 433 [2024-10-24 11:25:03,884 INFO L226 Difference]: Without dead ends: 244 [2024-10-24 11:25:03,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:25:03,884 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 199 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:03,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 686 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:25:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-24 11:25:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 189. [2024-10-24 11:25:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 164 states have (on average 1.3658536585365855) internal successors, (224), 165 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-10-24 11:25:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 268 transitions. [2024-10-24 11:25:03,900 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 268 transitions. Word has length 120 [2024-10-24 11:25:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:03,900 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 268 transitions. [2024-10-24 11:25:03,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:25:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 268 transitions. [2024-10-24 11:25:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:25:03,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:03,902 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] [2024-10-24 11:25:03,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:25:03,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -645033668, now seen corresponding path program 1 times [2024-10-24 11:25:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614026543] [2024-10-24 11:25:03,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614026543] [2024-10-24 11:25:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614026543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:04,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:04,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:25:04,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553853844] [2024-10-24 11:25:04,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:04,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:25:04,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:25:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:25:04,644 INFO L87 Difference]: Start difference. First operand 189 states and 268 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:25:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:04,829 INFO L93 Difference]: Finished difference Result 416 states and 587 transitions. [2024-10-24 11:25:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:25:04,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2024-10-24 11:25:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:04,832 INFO L225 Difference]: With dead ends: 416 [2024-10-24 11:25:04,832 INFO L226 Difference]: Without dead ends: 228 [2024-10-24 11:25:04,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:25:04,833 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 321 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:04,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 448 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-24 11:25:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 185. [2024-10-24 11:25:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 160 states have (on average 1.35625) internal successors, (217), 161 states have internal predecessors, (217), 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-10-24 11:25:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2024-10-24 11:25:04,846 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 120 [2024-10-24 11:25:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:04,847 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2024-10-24 11:25:04,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:25:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2024-10-24 11:25:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:25:04,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:04,848 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] [2024-10-24 11:25:04,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:25:04,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:04,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:04,849 INFO L85 PathProgramCache]: Analyzing trace with hash -187312502, now seen corresponding path program 1 times [2024-10-24 11:25:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549092821] [2024-10-24 11:25:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:05,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:05,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549092821] [2024-10-24 11:25:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549092821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:05,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:25:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324583008] [2024-10-24 11:25:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:05,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:25:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:05,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:25:05,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:05,268 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-10-24 11:25:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:05,377 INFO L93 Difference]: Finished difference Result 528 states and 742 transitions. [2024-10-24 11:25:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:25:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 121 [2024-10-24 11:25:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:05,380 INFO L225 Difference]: With dead ends: 528 [2024-10-24 11:25:05,380 INFO L226 Difference]: Without dead ends: 344 [2024-10-24 11:25:05,380 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-10-24 11:25:05,381 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 252 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:05,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 538 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-24 11:25:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 211. [2024-10-24 11:25:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 187 states have internal predecessors, (254), 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-10-24 11:25:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 298 transitions. [2024-10-24 11:25:05,394 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 298 transitions. Word has length 121 [2024-10-24 11:25:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:05,394 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 298 transitions. [2024-10-24 11:25:05,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-10-24 11:25:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 298 transitions. [2024-10-24 11:25:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:25:05,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:05,396 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] [2024-10-24 11:25:05,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:25:05,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:05,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:05,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1775660404, now seen corresponding path program 1 times [2024-10-24 11:25:05,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:05,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635702497] [2024-10-24 11:25:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635702497] [2024-10-24 11:25:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635702497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:05,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:05,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:25:05,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956520019] [2024-10-24 11:25:05,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:05,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:25:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:05,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:25:05,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:05,734 INFO L87 Difference]: Start difference. First operand 211 states and 298 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-10-24 11:25:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:05,873 INFO L93 Difference]: Finished difference Result 554 states and 777 transitions. [2024-10-24 11:25:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:25:05,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 121 [2024-10-24 11:25:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:05,876 INFO L225 Difference]: With dead ends: 554 [2024-10-24 11:25:05,876 INFO L226 Difference]: Without dead ends: 344 [2024-10-24 11:25:05,877 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-10-24 11:25:05,877 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 132 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:05,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 784 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-24 11:25:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 215. [2024-10-24 11:25:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 190 states have (on average 1.368421052631579) internal successors, (260), 191 states have internal predecessors, (260), 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-10-24 11:25:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 304 transitions. [2024-10-24 11:25:05,891 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 304 transitions. Word has length 121 [2024-10-24 11:25:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:05,891 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 304 transitions. [2024-10-24 11:25:05,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-10-24 11:25:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2024-10-24 11:25:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:25:05,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:05,893 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] [2024-10-24 11:25:05,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:25:05,894 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:05,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash -249352116, now seen corresponding path program 1 times [2024-10-24 11:25:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:05,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021358281] [2024-10-24 11:25:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:05,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021358281] [2024-10-24 11:25:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021358281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:06,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:25:06,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849279065] [2024-10-24 11:25:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:06,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:25:06,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:06,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:25:06,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:25:06,567 INFO L87 Difference]: Start difference. First operand 215 states and 304 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:25:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:06,760 INFO L93 Difference]: Finished difference Result 466 states and 657 transitions. [2024-10-24 11:25:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:25:06,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2024-10-24 11:25:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:06,762 INFO L225 Difference]: With dead ends: 466 [2024-10-24 11:25:06,762 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 11:25:06,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:25:06,763 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 244 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:06,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 557 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 11:25:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 214. [2024-10-24 11:25:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 189 states have (on average 1.3597883597883598) internal successors, (257), 190 states have internal predecessors, (257), 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-10-24 11:25:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2024-10-24 11:25:06,776 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 121 [2024-10-24 11:25:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:06,777 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2024-10-24 11:25:06,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:25:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2024-10-24 11:25:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 11:25:06,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:06,778 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] [2024-10-24 11:25:06,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:25:06,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1837700018, now seen corresponding path program 1 times [2024-10-24 11:25:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:06,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14307625] [2024-10-24 11:25:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14307625] [2024-10-24 11:25:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14307625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:25:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755652064] [2024-10-24 11:25:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:07,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:25:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:25:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:25:07,340 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:25:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:07,520 INFO L93 Difference]: Finished difference Result 465 states and 652 transitions. [2024-10-24 11:25:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:25:07,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2024-10-24 11:25:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:07,522 INFO L225 Difference]: With dead ends: 465 [2024-10-24 11:25:07,522 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 11:25:07,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:25:07,524 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 279 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:07,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 507 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 11:25:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2024-10-24 11:25:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 160 states have (on average 1.3375) internal successors, (214), 161 states have internal predecessors, (214), 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-10-24 11:25:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 258 transitions. [2024-10-24 11:25:07,536 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 258 transitions. Word has length 121 [2024-10-24 11:25:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:07,537 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 258 transitions. [2024-10-24 11:25:07,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:25:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 258 transitions. [2024-10-24 11:25:07,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:25:07,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:07,538 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] [2024-10-24 11:25:07,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:25:07,539 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:07,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:07,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1520228225, now seen corresponding path program 1 times [2024-10-24 11:25:07,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:07,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397648795] [2024-10-24 11:25:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:08,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:08,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397648795] [2024-10-24 11:25:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397648795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:08,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:08,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:25:08,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4143325] [2024-10-24 11:25:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:08,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:25:08,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:25:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:25:08,413 INFO L87 Difference]: Start difference. First operand 185 states and 258 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-10-24 11:25:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:08,862 INFO L93 Difference]: Finished difference Result 442 states and 614 transitions. [2024-10-24 11:25:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:25:08,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 122 [2024-10-24 11:25:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:08,864 INFO L225 Difference]: With dead ends: 442 [2024-10-24 11:25:08,864 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 11:25:08,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:25:08,865 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 168 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:08,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 737 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:25:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 11:25:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 196. [2024-10-24 11:25:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 172 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-10-24 11:25:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 273 transitions. [2024-10-24 11:25:08,884 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 273 transitions. Word has length 122 [2024-10-24 11:25:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:08,884 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 273 transitions. [2024-10-24 11:25:08,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-10-24 11:25:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 273 transitions. [2024-10-24 11:25:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 11:25:08,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:08,886 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] [2024-10-24 11:25:08,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:25:08,886 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:08,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1865983930, now seen corresponding path program 1 times [2024-10-24 11:25:08,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:08,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778041679] [2024-10-24 11:25:08,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:08,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:25:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:25:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:25:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:25:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:25:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:25:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:25:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:25:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:25:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:25:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:25:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:25:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:25:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:25:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:25:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:09,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:25:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778041679] [2024-10-24 11:25:09,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778041679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:09,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:09,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:25:09,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833914117] [2024-10-24 11:25:09,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:09,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:25:09,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:25:09,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:25:09,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:25:09,041 INFO L87 Difference]: Start difference. First operand 196 states and 273 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-10-24 11:25:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:09,089 INFO L93 Difference]: Finished difference Result 397 states and 553 transitions. [2024-10-24 11:25:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:25:09,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 123 [2024-10-24 11:25:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:09,091 INFO L225 Difference]: With dead ends: 397 [2024-10-24 11:25:09,091 INFO L226 Difference]: Without dead ends: 202 [2024-10-24 11:25:09,092 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-10-24 11:25:09,092 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:09,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:25:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-24 11:25:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-10-24 11:25:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 178 states have internal predecessors, (235), 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-10-24 11:25:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2024-10-24 11:25:09,114 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 123 [2024-10-24 11:25:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:09,115 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2024-10-24 11:25:09,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-10-24 11:25:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2024-10-24 11:25:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 11:25:09,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:09,117 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-10-24 11:25:09,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:25:09,117 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:09,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:09,117 INFO L85 PathProgramCache]: Analyzing trace with hash 676281222, now seen corresponding path program 1 times [2024-10-24 11:25:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:25:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917428724] [2024-10-24 11:25:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:25:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:25:09,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:25:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:25:09,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:25:09,328 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:25:09,329 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:25:09,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:25:09,333 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:25:09,498 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:25:09,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:25:09 BoogieIcfgContainer [2024-10-24 11:25:09,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:25:09,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:25:09,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:25:09,503 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:25:09,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:24:58" (3/4) ... [2024-10-24 11:25:09,505 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:25:09,506 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:25:09,508 INFO L158 Benchmark]: Toolchain (without parser) took 12694.15ms. Allocated memory was 172.0MB in the beginning and 543.2MB in the end (delta: 371.2MB). Free memory was 116.6MB in the beginning and 492.8MB in the end (delta: -376.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:25:09,508 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:25:09,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.23ms. Allocated memory is still 172.0MB. Free memory was 116.3MB in the beginning and 100.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:25:09,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.51ms. Allocated memory is still 172.0MB. Free memory was 100.2MB in the beginning and 96.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:25:09,509 INFO L158 Benchmark]: Boogie Preprocessor took 91.16ms. Allocated memory is still 172.0MB. Free memory was 96.5MB in the beginning and 91.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:25:09,509 INFO L158 Benchmark]: RCFGBuilder took 812.99ms. Allocated memory is still 172.0MB. Free memory was 91.5MB in the beginning and 106.6MB in the end (delta: -15.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-10-24 11:25:09,510 INFO L158 Benchmark]: TraceAbstraction took 11324.35ms. Allocated memory was 172.0MB in the beginning and 543.2MB in the end (delta: 371.2MB). Free memory was 105.7MB in the beginning and 492.8MB in the end (delta: -387.1MB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. [2024-10-24 11:25:09,510 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 543.2MB. Free memory is still 492.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:25:09,511 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.09ms. Allocated memory is still 172.0MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.23ms. Allocated memory is still 172.0MB. Free memory was 116.3MB in the beginning and 100.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.51ms. Allocated memory is still 172.0MB. Free memory was 100.2MB in the beginning and 96.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.16ms. Allocated memory is still 172.0MB. Free memory was 96.5MB in the beginning and 91.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 812.99ms. Allocated memory is still 172.0MB. Free memory was 91.5MB in the beginning and 106.6MB in the end (delta: -15.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11324.35ms. Allocated memory was 172.0MB in the beginning and 543.2MB in the end (delta: 371.2MB). Free memory was 105.7MB in the beginning and 492.8MB in the end (delta: -387.1MB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 543.2MB. Free memory is still 492.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 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]); [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, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 18, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2226 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2222 mSDsluCounter, 8181 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5777 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1457 IncrementalHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 2404 mSDtfsCounter, 1457 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=13, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 817 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2166 NumberOfCodeBlocks, 2166 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2025 ConstructedInterpolants, 0 QuantifiedInterpolants, 4478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 7140/7140 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-10-24 11:25:09,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/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 /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-24 11:25:11,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:25:11,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:25:11,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:25:11,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:25:11,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:25:11,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:25:11,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:25:11,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:25:11,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:25:11,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:25:11,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:25:11,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:25:11,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:25:11,863 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:25:11,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:25:11,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:25:11,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:25:11,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:25:11,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:25:11,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:25:11,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:25:11,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:25:11,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:25:11,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:25:11,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:25:11,870 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:25:11,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:25:11,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:25:11,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:25:11,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:25:11,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:25:11,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:25:11,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:25:11,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:25:11,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:25:11,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:25:11,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:25:11,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:25:11,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:25:11,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:25:11,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:25:11,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:25:11,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:25:11,877 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:25:11,877 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-10-24 11:25:12,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:25:12,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:25:12,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:25:12,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:25:12,202 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:25:12,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2024-10-24 11:25:13,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:25:13,997 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:25:13,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2024-10-24 11:25:14,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce762977/464c332d57734b57afceb777cb584176/FLAGaefe08e9f [2024-10-24 11:25:14,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce762977/464c332d57734b57afceb777cb584176 [2024-10-24 11:25:14,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:25:14,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:25:14,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:25:14,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:25:14,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:25:14,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f9adc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14, skipping insertion in model container [2024-10-24 11:25:14,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:25:14,603 WARN L248 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-10-24 11:25:14,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:25:14,711 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:25:14,724 WARN L248 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-10-24 11:25:14,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:25:14,805 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:25:14,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14 WrapperNode [2024-10-24 11:25:14,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:25:14,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:25:14,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:25:14,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:25:14,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,894 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-10-24 11:25:14,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:25:14,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:25:14,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:25:14,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:25:14,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,962 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-10-24 11:25:14,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:14,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:15,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:15,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:15,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:15,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:25:15,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:25:15,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:25:15,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:25:15,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (1/1) ... [2024-10-24 11:25:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:25:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:25:15,068 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-10-24 11:25:15,071 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-10-24 11:25:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:25:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:25:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:25:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:25:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:25:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:25:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:25:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:25:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:25:15,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:25:15,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:25:15,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:25:15,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:25:15,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:25:15,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:25:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:25:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:25:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:25:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:25:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:25:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:25:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:25:15,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:25:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:25:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:25:15,311 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:25:15,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:25:33,790 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-24 11:25:33,790 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:25:33,849 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:25:33,849 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:25:33,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:25:33 BoogieIcfgContainer [2024-10-24 11:25:33,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:25:33,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:25:33,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:25:33,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:25:33,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:25:14" (1/3) ... [2024-10-24 11:25:33,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c768657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:25:33, skipping insertion in model container [2024-10-24 11:25:33,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:25:14" (2/3) ... [2024-10-24 11:25:33,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c768657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:25:33, skipping insertion in model container [2024-10-24 11:25:33,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:25:33" (3/3) ... [2024-10-24 11:25:33,859 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-24.i [2024-10-24 11:25:33,875 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:25:33,875 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:25:33,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:25:33,945 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;@42cee851, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:25:33,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:25:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 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-10-24 11:25:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:33,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:33,965 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] [2024-10-24 11:25:33,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:33,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -861634093, now seen corresponding path program 1 times [2024-10-24 11:25:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:33,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181830447] [2024-10-24 11:25:33,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:33,983 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-10-24 11:25:33,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:33,986 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-10-24 11:25:33,987 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-10-24 11:25:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:34,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:25:34,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 11:25:35,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:35,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181830447] [2024-10-24 11:25:35,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181830447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:35,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:35,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:25:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194702186] [2024-10-24 11:25:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:35,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:25:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:35,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:25:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:25:35,068 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 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) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-10-24 11:25:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:35,192 INFO L93 Difference]: Finished difference Result 185 states and 291 transitions. [2024-10-24 11:25:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:25:35,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 119 [2024-10-24 11:25:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:35,201 INFO L225 Difference]: With dead ends: 185 [2024-10-24 11:25:35,201 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 11:25:35,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:25:35,206 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:35,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 11:25:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-24 11:25:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 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-10-24 11:25:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-24 11:25:35,243 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-10-24 11:25:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:35,244 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-24 11:25:35,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-10-24 11:25:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-24 11:25:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:35,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:35,247 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] [2024-10-24 11:25:35,276 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-10-24 11:25:35,447 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-10-24 11:25:35,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:35,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash -915902451, now seen corresponding path program 1 times [2024-10-24 11:25:35,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:35,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207032415] [2024-10-24 11:25:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:35,450 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-10-24 11:25:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:35,451 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-10-24 11:25:35,453 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-10-24 11:25:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:36,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:25:36,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:36,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:36,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207032415] [2024-10-24 11:25:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207032415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:36,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:25:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932005406] [2024-10-24 11:25:36,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:36,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:25:36,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:25:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:25:36,618 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-24 11:25:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:36,952 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-24 11:25:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:25:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 119 [2024-10-24 11:25:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:36,955 INFO L225 Difference]: With dead ends: 184 [2024-10-24 11:25:36,955 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:25:36,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 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-10-24 11:25:36,957 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:36,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:25:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:25:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:25:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 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-10-24 11:25:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-10-24 11:25:36,968 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 119 [2024-10-24 11:25:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:36,969 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-10-24 11:25:36,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-24 11:25:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-10-24 11:25:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:36,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:36,972 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] [2024-10-24 11:25:37,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:25:37,172 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-10-24 11:25:37,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:37,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash -697047733, now seen corresponding path program 1 times [2024-10-24 11:25:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:37,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798087448] [2024-10-24 11:25:37,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:37,175 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-10-24 11:25:37,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:37,177 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-10-24 11:25:37,179 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-10-24 11:25:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:38,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:25:38,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:39,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:39,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:39,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798087448] [2024-10-24 11:25:39,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798087448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:39,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:39,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:25:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222534488] [2024-10-24 11:25:39,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:39,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:25:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:39,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:25:39,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:25:39,303 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10-24 11:25:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:40,930 INFO L93 Difference]: Finished difference Result 233 states and 339 transitions. [2024-10-24 11:25:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:25:40,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 119 [2024-10-24 11:25:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:40,932 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:25:40,932 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 11:25:40,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:40,934 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 66 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:40,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 498 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:25:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 11:25:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 108. [2024-10-24 11:25:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 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-10-24 11:25:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-10-24 11:25:40,959 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 119 [2024-10-24 11:25:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:40,963 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-10-24 11:25:40,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10-24 11:25:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-10-24 11:25:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:40,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:40,965 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] [2024-10-24 11:25:40,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:25:41,166 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-10-24 11:25:41,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1976911411, now seen corresponding path program 1 times [2024-10-24 11:25:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:41,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612190948] [2024-10-24 11:25:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:41,169 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-10-24 11:25:41,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:41,172 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-10-24 11:25:41,173 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-10-24 11:25:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:42,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:25:42,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:42,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:42,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:42,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612190948] [2024-10-24 11:25:42,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612190948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:42,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:42,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:25:42,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515063315] [2024-10-24 11:25:42,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:42,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:25:42,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:42,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:25:42,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:25:42,742 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10-24 11:25:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:43,586 INFO L93 Difference]: Finished difference Result 220 states and 320 transitions. [2024-10-24 11:25:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:25:43,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 119 [2024-10-24 11:25:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:43,591 INFO L225 Difference]: With dead ends: 220 [2024-10-24 11:25:43,592 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:25:43,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:25:43,594 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:43,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:25:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:25:43,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-24 11:25:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 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-10-24 11:25:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-10-24 11:25:43,603 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 119 [2024-10-24 11:25:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:43,604 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-10-24 11:25:43,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10-24 11:25:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-10-24 11:25:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:43,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:43,606 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] [2024-10-24 11:25:43,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:25:43,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:43,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:43,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1508709259, now seen corresponding path program 1 times [2024-10-24 11:25:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108131005] [2024-10-24 11:25:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:43,808 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-10-24 11:25:43,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:43,812 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:25:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:44,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:25:44,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:45,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:45,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:45,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108131005] [2024-10-24 11:25:45,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108131005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:45,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:45,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:25:45,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519234739] [2024-10-24 11:25:45,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:45,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:25:45,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:45,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:25:45,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:45,457 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-10-24 11:25:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:46,702 INFO L93 Difference]: Finished difference Result 226 states and 325 transitions. [2024-10-24 11:25:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:25:46,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 119 [2024-10-24 11:25:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:46,704 INFO L225 Difference]: With dead ends: 226 [2024-10-24 11:25:46,704 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 11:25:46,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:46,705 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:46,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 603 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 11:25:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 11:25:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-24 11:25:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 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-10-24 11:25:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-10-24 11:25:46,714 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 119 [2024-10-24 11:25:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:46,714 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-10-24 11:25:46,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-10-24 11:25:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-10-24 11:25:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:46,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:46,716 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] [2024-10-24 11:25:46,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:25:46,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:46,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:46,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1565967561, now seen corresponding path program 1 times [2024-10-24 11:25:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282107396] [2024-10-24 11:25:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:46,919 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-10-24 11:25:46,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:46,922 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:46,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:25:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:47,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:25:47,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:25:48,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:48,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282107396] [2024-10-24 11:25:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282107396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:48,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:48,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:25:48,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10553200] [2024-10-24 11:25:48,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:48,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:25:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:48,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:25:48,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:25:48,980 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-10-24 11:25:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:50,519 INFO L93 Difference]: Finished difference Result 230 states and 329 transitions. [2024-10-24 11:25:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:25:50,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 119 [2024-10-24 11:25:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:50,521 INFO L225 Difference]: With dead ends: 230 [2024-10-24 11:25:50,521 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 11:25:50,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:25:50,522 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:50,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 718 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:25:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 11:25:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-10-24 11:25:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 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-10-24 11:25:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2024-10-24 11:25:50,530 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 119 [2024-10-24 11:25:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:50,530 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2024-10-24 11:25:50,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-10-24 11:25:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2024-10-24 11:25:50,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 11:25:50,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:50,532 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] [2024-10-24 11:25:50,564 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:25:50,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:50,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:50,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:50,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1566027143, now seen corresponding path program 1 times [2024-10-24 11:25:50,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:50,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256074378] [2024-10-24 11:25:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:50,735 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-10-24 11:25:50,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:50,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:50,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:25:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:52,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:25:52,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:26:06,985 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-24 11:26:06,986 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 103 treesize of output 59 [2024-10-24 11:26:08,919 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 11:26:08,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 58