./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-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:28:06,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:28:06,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:28:06,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:28:06,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:28:06,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:28:06,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:28:06,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:28:06,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:28:06,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:28:06,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:28:06,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:28:06,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:28:06,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:28:06,643 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:28:06,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:28:06,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:28:06,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:28:06,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:28:06,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:28:06,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:28:06,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:28:06,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:28:06,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:28:06,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:28:06,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:28:06,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:28:06,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:28:06,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:28:06,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:28:06,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:28:06,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:28:06,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:28:06,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:28:06,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:28:06,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:28:06,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:28:06,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:28:06,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:28:06,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:28:06,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:28:06,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:28:06,654 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f [2024-10-11 13:28:06,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:28:06,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:28:06,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:28:06,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:28:06,909 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:28:06,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i [2024-10-11 13:28:08,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:28:08,523 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:28:08,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i [2024-10-11 13:28:08,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c43ca679/deeed01cab9648409f93da1e79350ea0/FLAG565ec1576 [2024-10-11 13:28:08,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c43ca679/deeed01cab9648409f93da1e79350ea0 [2024-10-11 13:28:08,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:28:08,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:28:08,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:28:08,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:28:08,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:28:08,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:28:08" (1/1) ... [2024-10-11 13:28:08,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34be6b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:08, skipping insertion in model container [2024-10-11 13:28:08,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:28:08" (1/1) ... [2024-10-11 13:28:08,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:28:08,800 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-49.i[917,930] [2024-10-11 13:28:08,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:28:08,922 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:28:08,931 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-49.i[917,930] [2024-10-11 13:28:08,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:28:09,006 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:28:09,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09 WrapperNode [2024-10-11 13:28:09,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:28:09,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:28:09,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:28:09,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:28:09,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,104 INFO L138 Inliner]: procedures = 29, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 674 [2024-10-11 13:28:09,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:28:09,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:28:09,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:28:09,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:28:09,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,160 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2024-10-11 13:28:09,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:28:09,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:28:09,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:28:09,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:28:09,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (1/1) ... [2024-10-11 13:28:09,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:28:09,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:28:09,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:28:09,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:28:09,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:28:09,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:28:09,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:28:09,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:28:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:28:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:28:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:28:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:28:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:28:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:28:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:28:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:28:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:28:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:28:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:28:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:28:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:28:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:28:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:28:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:28:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:28:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:28:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:28:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:28:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:28:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:28:09,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:28:09,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:28:09,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:28:09,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:28:09,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:28:09,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:28:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:28:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:28:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:28:09,513 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:28:09,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:28:10,124 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2024-10-11 13:28:10,124 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:28:10,158 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:28:10,158 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:28:10,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:28:10 BoogieIcfgContainer [2024-10-11 13:28:10,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:28:10,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:28:10,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:28:10,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:28:10,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:28:08" (1/3) ... [2024-10-11 13:28:10,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0c8c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:28:10, skipping insertion in model container [2024-10-11 13:28:10,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:09" (2/3) ... [2024-10-11 13:28:10,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0c8c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:28:10, skipping insertion in model container [2024-10-11 13:28:10,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:28:10" (3/3) ... [2024-10-11 13:28:10,168 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-49.i [2024-10-11 13:28:10,182 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:28:10,183 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:28:10,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:28:10,247 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;@cece57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:28:10,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:28:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 112 states have (on average 1.5) internal successors, (168), 113 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:28:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 13:28:10,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:10,268 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:10,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:10,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash 665347915, now seen corresponding path program 1 times [2024-10-11 13:28:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:28:10,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558485570] [2024-10-11 13:28:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:28:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:28:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:28:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:28:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:28:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:28:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:28:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:28:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:28:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:28:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:28:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:28:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:28:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:28:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:28:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:28:10,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:28:10,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558485570] [2024-10-11 13:28:10,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558485570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:28:10,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:28:10,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:28:10,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494625341] [2024-10-11 13:28:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:28:10,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:28:10,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:28:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:28:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:28:10,809 INFO L87 Difference]: Start difference. First operand has 129 states, 112 states have (on average 1.5) internal successors, (168), 113 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:28:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:10,874 INFO L93 Difference]: Finished difference Result 255 states and 404 transitions. [2024-10-11 13:28:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:28:10,877 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-11 13:28:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:10,888 INFO L225 Difference]: With dead ends: 255 [2024-10-11 13:28:10,888 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 13:28:10,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-11 13:28:10,897 INFO L432 NwaCegarLoop]: 187 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, 187 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-11 13:28:10,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:28:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 13:28:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-11 13:28:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 111 states have internal predecessors, (163), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:28:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2024-10-11 13:28:10,952 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 191 transitions. Word has length 112 [2024-10-11 13:28:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:10,953 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 191 transitions. [2024-10-11 13:28:10,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:28:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2024-10-11 13:28:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 13:28:10,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:10,956 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:10,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:28:10,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:10,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1307695373, now seen corresponding path program 1 times [2024-10-11 13:28:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:28:10,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116482541] [2024-10-11 13:28:10,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:10,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:28:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:28:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:28:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:28:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:28:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:28:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:28:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:28:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:28:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:28:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:28:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:28:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:28:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:28:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:28:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:28:11,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:28:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116482541] [2024-10-11 13:28:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116482541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:28:11,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:28:11,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:28:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418337736] [2024-10-11 13:28:11,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:28:11,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:28:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:28:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:28:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:28:11,736 INFO L87 Difference]: Start difference. First operand 127 states and 191 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:28:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:12,045 INFO L93 Difference]: Finished difference Result 335 states and 501 transitions. [2024-10-11 13:28:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:28:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-11 13:28:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:12,048 INFO L225 Difference]: With dead ends: 335 [2024-10-11 13:28:12,048 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 13:28:12,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:28:12,051 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 117 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:12,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 722 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:28:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 13:28:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-10-11 13:28:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 181 states have (on average 1.4585635359116023) internal successors, (264), 182 states have internal predecessors, (264), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:28:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 308 transitions. [2024-10-11 13:28:12,074 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 308 transitions. Word has length 112 [2024-10-11 13:28:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:12,074 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 308 transitions. [2024-10-11 13:28:12,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:28:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 308 transitions. [2024-10-11 13:28:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:28:12,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:12,077 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:12,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:28:12,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:12,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1568005112, now seen corresponding path program 1 times [2024-10-11 13:28:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:28:12,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776593176] [2024-10-11 13:28:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:12,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:28:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:28:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:28:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:28:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:28:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:28:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:28:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:28:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:28:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:28:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:28:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:28:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:28:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:28:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:28:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:28:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:28:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776593176] [2024-10-11 13:28:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776593176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505869338] [2024-10-11 13:28:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:13,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:28:13,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:28:13,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:28:13,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:28:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:13,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 13:28:13,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:14,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:28:14,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2024-10-11 13:28:14,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-10-11 13:28:14,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-11 13:28:14,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:28:14,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 42 [2024-10-11 13:28:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:28:15,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:15,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 182 [2024-10-11 13:28:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:28:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505869338] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:15,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:28:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 9] total 24 [2024-10-11 13:28:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660432535] [2024-10-11 13:28:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:28:15,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:28:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:28:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:28:15,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:28:15,969 INFO L87 Difference]: Start difference. First operand 206 states and 308 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:28:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:16,567 INFO L93 Difference]: Finished difference Result 602 states and 899 transitions. [2024-10-11 13:28:16,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:28:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-11 13:28:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:16,576 INFO L225 Difference]: With dead ends: 602 [2024-10-11 13:28:16,576 INFO L226 Difference]: Without dead ends: 397 [2024-10-11 13:28:16,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:28:16,579 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 705 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:16,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1299 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:28:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-11 13:28:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 393. [2024-10-11 13:28:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 354 states have (on average 1.4661016949152543) internal successors, (519), 357 states have internal predecessors, (519), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:28:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 587 transitions. [2024-10-11 13:28:16,623 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 587 transitions. Word has length 114 [2024-10-11 13:28:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 587 transitions. [2024-10-11 13:28:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:28:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 587 transitions. [2024-10-11 13:28:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:28:16,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:16,627 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:16,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:28:16,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:28:16,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2046903814, now seen corresponding path program 1 times [2024-10-11 13:28:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:28:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178506696] [2024-10-11 13:28:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:28:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:28:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:28:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:28:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:28:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:28:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:28:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:28:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:28:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:28:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:28:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:28:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:28:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:28:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:28:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:28:17,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:28:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178506696] [2024-10-11 13:28:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178506696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:28:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:28:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:28:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680622134] [2024-10-11 13:28:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:28:17,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:28:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:28:17,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:28:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:28:17,239 INFO L87 Difference]: Start difference. First operand 393 states and 587 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:28:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:17,432 INFO L93 Difference]: Finished difference Result 813 states and 1211 transitions. [2024-10-11 13:28:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:28:17,433 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-11 13:28:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:17,438 INFO L225 Difference]: With dead ends: 813 [2024-10-11 13:28:17,438 INFO L226 Difference]: Without dead ends: 421 [2024-10-11 13:28:17,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:28:17,441 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 453 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:17,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 781 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:28:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-11 13:28:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 391. [2024-10-11 13:28:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 352 states have (on average 1.4630681818181819) internal successors, (515), 355 states have internal predecessors, (515), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:28:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 583 transitions. [2024-10-11 13:28:17,465 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 583 transitions. Word has length 114 [2024-10-11 13:28:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:17,465 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 583 transitions. [2024-10-11 13:28:17,466 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:28:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 583 transitions. [2024-10-11 13:28:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:28:17,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:17,468 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:17,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:28:17,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:17,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1945190593, now seen corresponding path program 1 times [2024-10-11 13:28:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:28:17,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568940975] [2024-10-11 13:28:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:28:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:28:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:28:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:28:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:28:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:28:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:28:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:28:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:28:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:28:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:28:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:28:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:28:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:28:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:28:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:28:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:28:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568940975] [2024-10-11 13:28:18,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568940975] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43051132] [2024-10-11 13:28:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:18,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:28:18,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:28:18,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:28:18,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:28:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:18,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:28:18,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:18,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:28:18,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-11 13:28:19,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:28:19,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:28:19,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:28:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-11 13:28:19,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:19,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43051132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:19,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:28:19,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-10-11 13:28:19,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49445555] [2024-10-11 13:28:19,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:28:19,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 13:28:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:28:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 13:28:19,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:28:19,812 INFO L87 Difference]: Start difference. First operand 391 states and 583 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 7 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-11 13:28:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:20,565 INFO L93 Difference]: Finished difference Result 814 states and 1194 transitions. [2024-10-11 13:28:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:28:20,566 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 7 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 114 [2024-10-11 13:28:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:20,569 INFO L225 Difference]: With dead ends: 814 [2024-10-11 13:28:20,569 INFO L226 Difference]: Without dead ends: 424 [2024-10-11 13:28:20,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:28:20,572 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 396 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:20,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1418 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:28:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-11 13:28:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 407. [2024-10-11 13:28:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 364 states have (on average 1.4423076923076923) internal successors, (525), 367 states have internal predecessors, (525), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:28:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 593 transitions. [2024-10-11 13:28:20,612 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 593 transitions. Word has length 114 [2024-10-11 13:28:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:20,612 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 593 transitions. [2024-10-11 13:28:20,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 7 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-11 13:28:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 593 transitions. [2024-10-11 13:28:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:28:20,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:20,615 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:20,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 13:28:20,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:28:20,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:20,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:20,820 INFO L85 PathProgramCache]: Analyzing trace with hash -563684795, now seen corresponding path program 1 times [2024-10-11 13:28:20,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:28:20,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765892292] [2024-10-11 13:28:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:20,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:28:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:28:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:28:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:28:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:28:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:28:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:28:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:28:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:28:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:28:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:28:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:28:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:28:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:28:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:28:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-11 13:28:21,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:28:21,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765892292] [2024-10-11 13:28:21,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765892292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:21,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866534022] [2024-10-11 13:28:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:21,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:28:21,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:28:21,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:28:21,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 13:28:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:21,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:28:21,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:22,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:28:22,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:28:22,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:28:22,871 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-11 13:28:22,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2024-10-11 13:28:22,923 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 13:28:22,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-10-11 13:28:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-11 13:28:22,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866534022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:23,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:28:23,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-10-11 13:28:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27921466] [2024-10-11 13:28:23,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:28:23,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 13:28:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:28:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 13:28:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:28:23,068 INFO L87 Difference]: Start difference. First operand 407 states and 593 transitions. Second operand has 19 states, 17 states have (on average 5.588235294117647) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-11 13:28:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:23,825 INFO L93 Difference]: Finished difference Result 1130 states and 1625 transitions. [2024-10-11 13:28:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:28:23,826 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.588235294117647) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) Word has length 116 [2024-10-11 13:28:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:23,832 INFO L225 Difference]: With dead ends: 1130 [2024-10-11 13:28:23,833 INFO L226 Difference]: Without dead ends: 724 [2024-10-11 13:28:23,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2024-10-11 13:28:23,835 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1372 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:23,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 1291 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:28:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-10-11 13:28:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 431. [2024-10-11 13:28:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 384 states have (on average 1.4296875) internal successors, (549), 387 states have internal predecessors, (549), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:28:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 617 transitions. [2024-10-11 13:28:23,889 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 617 transitions. Word has length 116 [2024-10-11 13:28:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:23,890 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 617 transitions. [2024-10-11 13:28:23,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.588235294117647) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-11 13:28:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 617 transitions. [2024-10-11 13:28:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:28:23,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:23,894 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:23,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 13:28:24,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:28:24,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:24,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -305519357, now seen corresponding path program 1 times [2024-10-11 13:28:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:28:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755093236] [2024-10-11 13:28:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:28:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:28:24,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:28:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:28:24,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:28:24,286 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:28:24,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:28:24,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:28:24,292 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:24,405 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:28:24,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:28:24 BoogieIcfgContainer [2024-10-11 13:28:24,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:28:24,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:28:24,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:28:24,409 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:28:24,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:28:10" (3/4) ... [2024-10-11 13:28:24,411 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:28:24,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:28:24,413 INFO L158 Benchmark]: Toolchain (without parser) took 15847.85ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 138.1MB in the beginning and 196.4MB in the end (delta: -58.3MB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. [2024-10-11 13:28:24,413 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 121.6MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:28:24,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.05ms. Allocated memory is still 165.7MB. Free memory was 137.9MB in the beginning and 119.6MB in the end (delta: 18.3MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-10-11 13:28:24,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.24ms. Allocated memory is still 165.7MB. Free memory was 119.6MB in the beginning and 114.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:28:24,414 INFO L158 Benchmark]: Boogie Preprocessor took 130.84ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 109.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:28:24,414 INFO L158 Benchmark]: RCFGBuilder took 921.99ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 56.7MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-11 13:28:24,414 INFO L158 Benchmark]: TraceAbstraction took 14246.11ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 55.6MB in the beginning and 197.5MB in the end (delta: -141.9MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2024-10-11 13:28:24,415 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 375.4MB. Free memory was 197.5MB in the beginning and 196.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:28:24,416 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 121.6MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.05ms. Allocated memory is still 165.7MB. Free memory was 137.9MB in the beginning and 119.6MB in the end (delta: 18.3MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.24ms. Allocated memory is still 165.7MB. Free memory was 119.6MB in the beginning and 114.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.84ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 109.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 921.99ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 56.7MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14246.11ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 55.6MB in the beginning and 197.5MB in the end (delta: -141.9MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 375.4MB. Free memory was 197.5MB in the beginning and 196.4MB in the end (delta: 1.0MB). 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. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0][0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1][0]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[0][1]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[1][1]); [L29-L31] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L29-L31] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L29-L31] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L32] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L33] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L34-L36] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L34-L36] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L34-L36] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L37] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L38] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L42] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0][0]); [L43] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1][0]); [L44] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[0][1]); [L45] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer = &(unsigned_short_int_Array_0[1][1]); [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L77] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L79] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L80] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L82] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L83] float_Array_0[0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L84] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L87] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L89] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L90] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L92] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L93] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L95] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L96] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L97] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L97] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L97] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L98] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L111] RET updateVariables() [L112] CALL step() [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L49] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) [L50] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L50] EXPR 50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L50] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L50] COND FALSE !((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) [L53] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L53] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) = (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))) [L55] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L55] COND TRUE ! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L56] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L56] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L56] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L56] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) [L56] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L56] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L56] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) [L59] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L59] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L62] COND TRUE (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f [L63] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L63] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L63] COND FALSE !((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) [L66] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L66] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50)) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L103] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))))) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))))) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L103-L104] return (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= 64.5f) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) >= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) ((((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) < 0 ) ? -(((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))) : (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) > ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == ((unsigned short int) 50))) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && (((50 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) <= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) ((! (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))))) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) >= (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={7:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={7:6}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3044 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3043 mSDsluCounter, 5698 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4627 mSDsCounter, 223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1529 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 223 mSolverCounterUnsat, 1071 mSDtfsCounter, 1529 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 660 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=6, InterpolantAutomatonStates: 49, 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, 6 MinimizatonAttempts, 347 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1130 ConstructedInterpolants, 3 QuantifiedInterpolants, 11569 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1316 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 3088/3640 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-11 13:28:24,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:28:26,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:28:26,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:28:26,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:28:26,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:28:26,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:28:26,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:28:26,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:28:26,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:28:26,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:28:26,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:28:26,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:28:26,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:28:26,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:28:26,818 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:28:26,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:28:26,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:28:26,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:28:26,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:28:26,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:28:26,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:28:26,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:28:26,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:28:26,823 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:28:26,824 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:28:26,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:28:26,824 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:28:26,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:28:26,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:28:26,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:28:26,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:28:26,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:28:26,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:28:26,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:28:26,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:28:26,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:28:26,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:28:26,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:28:26,829 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:28:26,829 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:28:26,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:28:26,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:28:26,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:28:26,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:28:26,830 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:28:26,830 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b91f1f51b5e066a8b0d7e6d03754d28953e63e6dd17294fbe476ba36b896c8f [2024-10-11 13:28:27,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:28:27,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:28:27,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:28:27,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:28:27,183 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:28:27,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i [2024-10-11 13:28:28,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:28:28,876 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:28:28,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-49.i [2024-10-11 13:28:28,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/021abcc31/7f69403c7fa7488aa7c70512eb83d4d3/FLAG40ffe266f [2024-10-11 13:28:29,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/021abcc31/7f69403c7fa7488aa7c70512eb83d4d3 [2024-10-11 13:28:29,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:28:29,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:28:29,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:28:29,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:28:29,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:28:29,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd96c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29, skipping insertion in model container [2024-10-11 13:28:29,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:28:29,469 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-49.i[917,930] [2024-10-11 13:28:29,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:28:29,590 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:28:29,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-49.i[917,930] [2024-10-11 13:28:29,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:28:29,695 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:28:29,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29 WrapperNode [2024-10-11 13:28:29,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:28:29,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:28:29,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:28:29,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:28:29,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,786 INFO L138 Inliner]: procedures = 33, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 659 [2024-10-11 13:28:29,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:28:29,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:28:29,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:28:29,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:28:29,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,851 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2024-10-11 13:28:29,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:28:29,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:28:29,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:28:29,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:28:29,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (1/1) ... [2024-10-11 13:28:29,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:28:29,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:28:29,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:28:29,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:28:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:28:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:28:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:28:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:28:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:28:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:28:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:28:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:28:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:28:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:28:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:28:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:28:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:28:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:28:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:28:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:28:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:28:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:28:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:28:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:28:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:28:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:28:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:28:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:28:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:28:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:28:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:28:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:28:30,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:28:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:28:30,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:28:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:28:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:28:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:28:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:28:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:28:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:28:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:28:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:28:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:28:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:28:30,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:28:30,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:28:30,966 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2024-10-11 13:28:30,966 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:28:31,009 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:28:31,009 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:28:31,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:28:31 BoogieIcfgContainer [2024-10-11 13:28:31,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:28:31,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:28:31,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:28:31,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:28:31,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:28:29" (1/3) ... [2024-10-11 13:28:31,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158a2cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:28:31, skipping insertion in model container [2024-10-11 13:28:31,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:28:29" (2/3) ... [2024-10-11 13:28:31,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158a2cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:28:31, skipping insertion in model container [2024-10-11 13:28:31,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:28:31" (3/3) ... [2024-10-11 13:28:31,018 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-49.i [2024-10-11 13:28:31,036 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:28:31,036 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:28:31,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:28:31,121 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;@457aead, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:28:31,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:28:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:28:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:28:31,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:31,145 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:31,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:31,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2062007830, now seen corresponding path program 1 times [2024-10-11 13:28:31,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:28:31,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948223975] [2024-10-11 13:28:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:31,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-11 13:28:31,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:28:31,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:28:31,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:28:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:31,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:28:31,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-11 13:28:31,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:28:31,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:28:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948223975] [2024-10-11 13:28:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948223975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:28:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:28:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:28:31,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088057863] [2024-10-11 13:28:31,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:28:31,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:28:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:28:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:28:31,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:28:31,570 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:28:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:31,616 INFO L93 Difference]: Finished difference Result 243 states and 388 transitions. [2024-10-11 13:28:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:28:31,619 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-11 13:28:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:31,626 INFO L225 Difference]: With dead ends: 243 [2024-10-11 13:28:31,626 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 13:28:31,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-11 13:28:31,633 INFO L432 NwaCegarLoop]: 179 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, 179 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-11 13:28:31,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:28:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 13:28:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 13:28:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 105 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:28:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2024-10-11 13:28:31,680 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 110 [2024-10-11 13:28:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:31,680 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2024-10-11 13:28:31,680 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:28:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2024-10-11 13:28:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:28:31,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:31,686 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:31,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:28:31,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:28:31,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1484175426, now seen corresponding path program 1 times [2024-10-11 13:28:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:28:31,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011114317] [2024-10-11 13:28:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:31,889 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-11 13:28:31,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:28:31,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:28:31,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:28:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:32,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:28:32,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:32,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:28:32,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-10-11 13:28:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:28:32,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:28:32,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:28:32,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011114317] [2024-10-11 13:28:32,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011114317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:28:32,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:28:32,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:28:32,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986436757] [2024-10-11 13:28:32,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:28:32,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:28:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:28:32,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:28:32,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:28:32,372 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:28:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:32,713 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2024-10-11 13:28:32,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:28:32,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-11 13:28:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:32,716 INFO L225 Difference]: With dead ends: 320 [2024-10-11 13:28:32,716 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 13:28:32,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:28:32,718 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 113 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:32,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 690 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:28:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 13:28:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-10-11 13:28:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 172 states have (on average 1.4651162790697674) internal successors, (252), 173 states have internal predecessors, (252), 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-11 13:28:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 296 transitions. [2024-10-11 13:28:32,752 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 296 transitions. Word has length 110 [2024-10-11 13:28:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:32,754 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 296 transitions. [2024-10-11 13:28:32,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:28:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 296 transitions. [2024-10-11 13:28:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 13:28:32,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:32,756 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:32,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:28:32,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:28:32,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:32,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:32,958 INFO L85 PathProgramCache]: Analyzing trace with hash -957926141, now seen corresponding path program 1 times [2024-10-11 13:28:32,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:28:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643344558] [2024-10-11 13:28:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:32,959 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-11 13:28:32,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:28:32,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:28:32,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:28:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:33,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 13:28:33,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:33,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:28:33,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:28:34,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:28:34,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 13:28:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-11 13:28:34,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:34,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:28:34,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643344558] [2024-10-11 13:28:34,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643344558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:34,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [631818770] [2024-10-11 13:28:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:34,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:28:34,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:28:34,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:28:34,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 13:28:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:35,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:28:35,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:35,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:28:36,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:28:37,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:28:37,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 13:28:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-11 13:28:37,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:37,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [631818770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:37,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:28:37,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-11 13:28:37,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508887375] [2024-10-11 13:28:37,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:28:37,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 13:28:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:28:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 13:28:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:28:37,512 INFO L87 Difference]: Start difference. First operand 197 states and 296 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:28:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:38,169 INFO L93 Difference]: Finished difference Result 410 states and 606 transitions. [2024-10-11 13:28:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:28:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 112 [2024-10-11 13:28:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:38,173 INFO L225 Difference]: With dead ends: 410 [2024-10-11 13:28:38,173 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 13:28:38,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2024-10-11 13:28:38,176 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 275 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:38,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1175 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:28:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 13:28:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2024-10-11 13:28:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 178 states have (on average 1.4438202247191012) internal successors, (257), 179 states have internal predecessors, (257), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:28:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 301 transitions. [2024-10-11 13:28:38,198 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 301 transitions. Word has length 112 [2024-10-11 13:28:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:38,199 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 301 transitions. [2024-10-11 13:28:38,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-11 13:28:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 301 transitions. [2024-10-11 13:28:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:28:38,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:38,201 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:38,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-10-11 13:28:38,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:28:38,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate-clean/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-11 13:28:38,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:38,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:38,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1753774153, now seen corresponding path program 1 times [2024-10-11 13:28:38,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:28:38,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332066207] [2024-10-11 13:28:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:38,605 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-11 13:28:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:28:38,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 13:28:38,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:28:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:38,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:28:38,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:39,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:28:40,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:28:40,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 34 [2024-10-11 13:28:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:28:40,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:41,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:28:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332066207] [2024-10-11 13:28:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332066207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:41,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [606867113] [2024-10-11 13:28:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:41,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:28:41,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:28:41,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:28:41,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-11 13:28:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:41,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:28:41,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:42,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:28:43,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-10-11 13:28:43,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 43 [2024-10-11 13:28:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:28:43,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:28:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [606867113] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:28:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 13] total 30 [2024-10-11 13:28:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013787597] [2024-10-11 13:28:44,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:28:44,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:28:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:28:44,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:28:44,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1170, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 13:28:44,606 INFO L87 Difference]: Start difference. First operand 205 states and 301 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:28:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:45,330 INFO L93 Difference]: Finished difference Result 772 states and 1131 transitions. [2024-10-11 13:28:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:28:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-11 13:28:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:45,334 INFO L225 Difference]: With dead ends: 772 [2024-10-11 13:28:45,335 INFO L226 Difference]: Without dead ends: 568 [2024-10-11 13:28:45,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=293, Invalid=1513, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 13:28:45,337 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 545 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:45,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1666 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:28:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-11 13:28:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 462. [2024-10-11 13:28:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 419 states have (on average 1.477326968973747) internal successors, (619), 422 states have internal predecessors, (619), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:28:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 687 transitions. [2024-10-11 13:28:45,377 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 687 transitions. Word has length 114 [2024-10-11 13:28:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:45,378 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 687 transitions. [2024-10-11 13:28:45,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:28:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 687 transitions. [2024-10-11 13:28:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:28:45,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:45,380 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:45,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:28:45,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-11 13:28:45,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:28:45,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:45,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1861134773, now seen corresponding path program 1 times [2024-10-11 13:28:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:28:45,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898322049] [2024-10-11 13:28:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:45,783 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-11 13:28:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:28:45,786 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 13:28:45,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:28:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:46,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:28:46,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:46,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:28:46,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:28:46,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 13:28:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:28:46,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:48,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:28:48,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898322049] [2024-10-11 13:28:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898322049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:48,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [82400195] [2024-10-11 13:28:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:48,351 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:28:48,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:28:48,352 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:28:48,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-11 13:28:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:49,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:28:49,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:49,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:28:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-11 13:28:50,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:28:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:28:51,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:28:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [82400195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:28:51,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:28:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-11 13:28:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146916367] [2024-10-11 13:28:51,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:28:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:28:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:28:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:28:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=234, Unknown=1, NotChecked=0, Total=306 [2024-10-11 13:28:51,718 INFO L87 Difference]: Start difference. First operand 462 states and 687 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-11 13:28:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:28:52,256 INFO L93 Difference]: Finished difference Result 1364 states and 2028 transitions. [2024-10-11 13:28:52,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:28:52,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 114 [2024-10-11 13:28:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:28:52,262 INFO L225 Difference]: With dead ends: 1364 [2024-10-11 13:28:52,263 INFO L226 Difference]: Without dead ends: 903 [2024-10-11 13:28:52,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=122, Invalid=339, Unknown=1, NotChecked=0, Total=462 [2024-10-11 13:28:52,267 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1063 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:28:52,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1177 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:28:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-10-11 13:28:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 622. [2024-10-11 13:28:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 579 states have (on average 1.5008635578583764) internal successors, (869), 582 states have internal predecessors, (869), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:28:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 937 transitions. [2024-10-11 13:28:52,331 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 937 transitions. Word has length 114 [2024-10-11 13:28:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:28:52,332 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 937 transitions. [2024-10-11 13:28:52,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-11 13:28:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 937 transitions. [2024-10-11 13:28:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:28:52,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:28:52,333 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:28:52,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 13:28:52,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-11 13:28:52,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:28:52,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:28:52,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:28:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1759421552, now seen corresponding path program 1 times [2024-10-11 13:28:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:28:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705604733] [2024-10-11 13:28:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:28:52,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:28:52,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:28:52,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 13:28:52,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 13:28:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:28:52,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:28:52,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:28:53,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-11 13:28:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:28:53,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:02,126 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2024-10-11 13:29:02,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 48 [2024-10-11 13:29:06,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705604733] [2024-10-11 13:29:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705604733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1368804878] [2024-10-11 13:29:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:06,245 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:29:06,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:29:06,246 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:29:06,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-11 13:29:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:06,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:29:06,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:06,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-11 13:29:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:29:06,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1368804878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:06,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:29:06,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-11 13:29:06,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791065966] [2024-10-11 13:29:06,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:06,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:06,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=223, Unknown=3, NotChecked=0, Total=272 [2024-10-11 13:29:06,912 INFO L87 Difference]: Start difference. First operand 622 states and 937 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:29:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:07,188 INFO L93 Difference]: Finished difference Result 1253 states and 1880 transitions. [2024-10-11 13:29:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:07,191 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-11 13:29:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:07,194 INFO L225 Difference]: With dead ends: 1253 [2024-10-11 13:29:07,194 INFO L226 Difference]: Without dead ends: 632 [2024-10-11 13:29:07,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2024-10-11 13:29:07,198 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 111 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:07,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 818 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:29:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-11 13:29:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630. [2024-10-11 13:29:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 585 states have (on average 1.4871794871794872) internal successors, (870), 588 states have internal predecessors, (870), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:29:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 938 transitions. [2024-10-11 13:29:07,237 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 938 transitions. Word has length 114 [2024-10-11 13:29:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:07,237 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 938 transitions. [2024-10-11 13:29:07,238 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:29:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 938 transitions. [2024-10-11 13:29:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:29:07,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:07,240 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:29:07,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-11 13:29:07,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-10-11 13:29:07,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:29:07,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:07,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash 165426251, now seen corresponding path program 1 times [2024-10-11 13:29:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499033906] [2024-10-11 13:29:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:07,642 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-11 13:29:07,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:07,643 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-11 13:29:07,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 13:29:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:07,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 13:29:07,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:08,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:29:09,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:29:09,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2024-10-11 13:29:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:29:09,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:10,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:10,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499033906] [2024-10-11 13:29:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499033906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:10,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1633065152] [2024-10-11 13:29:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:10,034 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:29:10,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:29:10,037 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:29:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-10-11 13:29:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 13:29:10,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:11,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:29:12,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-10-11 13:29:12,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2024-10-11 13:29:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:29:12,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:29:13,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1633065152] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:13,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:29:13,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 12] total 29 [2024-10-11 13:29:13,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142347963] [2024-10-11 13:29:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:13,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:29:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:29:13,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1108, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:29:13,432 INFO L87 Difference]: Start difference. First operand 630 states and 938 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:29:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:14,438 INFO L93 Difference]: Finished difference Result 1696 states and 2510 transitions. [2024-10-11 13:29:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:29:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-11 13:29:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:14,445 INFO L225 Difference]: With dead ends: 1696 [2024-10-11 13:29:14,445 INFO L226 Difference]: Without dead ends: 1067 [2024-10-11 13:29:14,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 13:29:14,448 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 408 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:14,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 2419 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:29:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-10-11 13:29:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 631. [2024-10-11 13:29:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 586 states have (on average 1.4880546075085324) internal successors, (872), 589 states have internal predecessors, (872), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:29:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 940 transitions. [2024-10-11 13:29:14,493 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 940 transitions. Word has length 114 [2024-10-11 13:29:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:14,493 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 940 transitions. [2024-10-11 13:29:14,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:29:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 940 transitions. [2024-10-11 13:29:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:29:14,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:14,495 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:29:14,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 13:29:14,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-10-11 13:29:14,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:29:14,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:14,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1642280055, now seen corresponding path program 1 times [2024-10-11 13:29:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605919962] [2024-10-11 13:29:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:14,901 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-11 13:29:14,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:14,903 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-11 13:29:14,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 13:29:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:29:15,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:16,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-10-11 13:29:16,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:29:16,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2024-10-11 13:29:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-11 13:29:16,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:29:16,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:16,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605919962] [2024-10-11 13:29:16,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605919962] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:16,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:29:16,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2024-10-11 13:29:16,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699906994] [2024-10-11 13:29:16,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:16,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:29:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:16,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:29:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:29:16,533 INFO L87 Difference]: Start difference. First operand 631 states and 940 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:29:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:16,990 INFO L93 Difference]: Finished difference Result 1379 states and 2035 transitions. [2024-10-11 13:29:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:29:16,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-11 13:29:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:16,994 INFO L225 Difference]: With dead ends: 1379 [2024-10-11 13:29:16,994 INFO L226 Difference]: Without dead ends: 749 [2024-10-11 13:29:16,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:29:16,997 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 141 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:16,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2132 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:29:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-10-11 13:29:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 631. [2024-10-11 13:29:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 586 states have (on average 1.4880546075085324) internal successors, (872), 589 states have internal predecessors, (872), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:29:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 940 transitions. [2024-10-11 13:29:17,042 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 940 transitions. Word has length 114 [2024-10-11 13:29:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:17,042 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 940 transitions. [2024-10-11 13:29:17,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:29:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 940 transitions. [2024-10-11 13:29:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:29:17,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:17,044 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:29:17,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 13:29:17,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-11 13:29:17,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:17,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 19220625, now seen corresponding path program 1 times [2024-10-11 13:29:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433899586] [2024-10-11 13:29:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:17,247 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-11 13:29:17,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:17,250 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-11 13:29:17,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 13:29:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:29:17,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:18,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-10-11 13:29:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:29:18,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:26,710 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2024-10-11 13:29:26,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 48