./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-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f81eb34c60dcaea85edbe1be61380039c4cd459b327890e24dee350b4faadfa0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:33:54,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:33:54,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:33:54,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:33:54,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:33:54,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:33:54,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:33:54,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:33:54,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:33:54,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:33:54,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:33:54,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:33:54,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:33:54,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:33:54,168 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:33:54,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:33:54,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:33:54,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:33:54,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:33:54,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:33:54,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:33:54,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:33:54,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:33:54,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:33:54,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:33:54,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:33:54,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:33:54,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:33:54,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:33:54,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:33:54,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:33:54,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:33:54,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:33:54,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:33:54,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:33:54,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:33:54,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:33:54,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:33:54,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:33:54,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:33:54,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:33:54,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:33:54,178 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f81eb34c60dcaea85edbe1be61380039c4cd459b327890e24dee350b4faadfa0 [2024-11-20 08:33:54,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:33:54,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:33:54,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:33:54,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:33:54,481 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:33:54,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i [2024-11-20 08:33:55,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:33:56,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:33:56,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i [2024-11-20 08:33:56,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19aa9c057/0b25c5f63f794169add27453bfc6a8f0/FLAGd01b342d1 [2024-11-20 08:33:56,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19aa9c057/0b25c5f63f794169add27453bfc6a8f0 [2024-11-20 08:33:56,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:33:56,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:33:56,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:33:56,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:33:56,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:33:56,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1623c20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56, skipping insertion in model container [2024-11-20 08:33:56,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:33:56,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i[917,930] [2024-11-20 08:33:56,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:33:56,443 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:33:56,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i[917,930] [2024-11-20 08:33:56,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:33:56,520 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:33:56,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56 WrapperNode [2024-11-20 08:33:56,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:33:56,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:33:56,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:33:56,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:33:56,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,630 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2024-11-20 08:33:56,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:33:56,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:33:56,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:33:56,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:33:56,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,698 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2024-11-20 08:33:56,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:33:56,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:33:56,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:33:56,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:33:56,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (1/1) ... [2024-11-20 08:33:56,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:33:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:33:56,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:33:56,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:33:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:33:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:33:56,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:33:56,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:33:56,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:33:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:33:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 08:33:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:33:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:33:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:33:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:33:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:33:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-20 08:33:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:33:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:33:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:33:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:33:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:33:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-20 08:33:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:33:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:33:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:33:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:33:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:33:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 08:33:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:33:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:33:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:33:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:33:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:33:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-20 08:33:56,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:33:56,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:33:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:33:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:33:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:33:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:33:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:33:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 08:33:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:33:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:33:57,005 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:33:57,007 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:33:57,525 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-20 08:33:57,525 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:33:57,538 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:33:57,538 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:33:57,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:33:57 BoogieIcfgContainer [2024-11-20 08:33:57,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:33:57,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:33:57,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:33:57,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:33:57,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:33:56" (1/3) ... [2024-11-20 08:33:57,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fedbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:33:57, skipping insertion in model container [2024-11-20 08:33:57,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:33:56" (2/3) ... [2024-11-20 08:33:57,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fedbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:33:57, skipping insertion in model container [2024-11-20 08:33:57,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:33:57" (3/3) ... [2024-11-20 08:33:57,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-26.i [2024-11-20 08:33:57,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:33:57,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:33:57,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:33:57,621 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;@751b3220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:33:57,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:33:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:33:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:33:57,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:33:57,641 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:33:57,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:33:57,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:33:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1509494359, now seen corresponding path program 1 times [2024-11-20 08:33:57,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:33:57,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413690047] [2024-11-20 08:33:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:33:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:33:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 08:33:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:33:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:33:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:33:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:33:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:33:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:33:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:33:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:33:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:33:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:33:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413690047] [2024-11-20 08:33:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413690047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:33:58,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:33:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:33:58,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015841636] [2024-11-20 08:33:58,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:33:58,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:33:58,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:33:58,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:33:58,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:33:58,177 INFO L87 Difference]: Start difference. First operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-20 08:33:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:33:58,211 INFO L93 Difference]: Finished difference Result 179 states and 271 transitions. [2024-11-20 08:33:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:33:58,214 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-20 08:33:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:33:58,222 INFO L225 Difference]: With dead ends: 179 [2024-11-20 08:33:58,222 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 08:33:58,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:33:58,232 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:33:58,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:33:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 08:33:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 08:33:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:33:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-20 08:33:58,284 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2024-11-20 08:33:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:33:58,285 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-20 08:33:58,286 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-20 08:33:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-20 08:33:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:33:58,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:33:58,291 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:33:58,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:33:58,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:33:58,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:33:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash 359888411, now seen corresponding path program 1 times [2024-11-20 08:33:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:33:58,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036995460] [2024-11-20 08:33:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:33:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:33:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 08:33:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:33:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:33:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:33:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:33:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:33:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:33:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:33:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:33:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:33:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:33:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036995460] [2024-11-20 08:33:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036995460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:33:58,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:33:58,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:33:58,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948005964] [2024-11-20 08:33:58,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:33:58,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:33:58,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:33:58,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:33:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:33:58,683 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:33:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:33:58,724 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2024-11-20 08:33:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:33:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-20 08:33:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:33:58,727 INFO L225 Difference]: With dead ends: 178 [2024-11-20 08:33:58,727 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 08:33:58,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:33:58,729 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:33:58,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:33:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 08:33:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-20 08:33:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:33:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-20 08:33:58,749 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2024-11-20 08:33:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:33:58,751 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-20 08:33:58,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:33:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-20 08:33:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:33:58,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:33:58,755 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:33:58,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:33:58,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:33:58,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:33:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash 361735453, now seen corresponding path program 1 times [2024-11-20 08:33:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:33:58,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063344398] [2024-11-20 08:33:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:33:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:33:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 08:33:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:33:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:33:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:33:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:33:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:33:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:33:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:33:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:33:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:33:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:33:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:33:59,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063344398] [2024-11-20 08:33:59,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063344398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:33:59,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:33:59,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:33:59,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760688190] [2024-11-20 08:33:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:33:59,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:33:59,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:33:59,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:33:59,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:33:59,154 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:33:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:33:59,252 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2024-11-20 08:33:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:33:59,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-20 08:33:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:33:59,255 INFO L225 Difference]: With dead ends: 179 [2024-11-20 08:33:59,255 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 08:33:59,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:33:59,257 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:33:59,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:33:59,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 08:33:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 08:33:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:33:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-20 08:33:59,268 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 89 [2024-11-20 08:33:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:33:59,268 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-20 08:33:59,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:33:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-20 08:33:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:33:59,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:33:59,271 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:33:59,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:33:59,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:33:59,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:33:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -455912997, now seen corresponding path program 1 times [2024-11-20 08:33:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:33:59,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224671272] [2024-11-20 08:33:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:33:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:33:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:33:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519322554] [2024-11-20 08:33:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:33:59,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:33:59,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:33:59,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:33:59,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:33:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:33:59,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:33:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:34:00,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:34:00,083 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:34:00,084 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:34:00,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 08:34:00,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:34:00,291 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 08:34:00,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:34:00,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:34:00 BoogieIcfgContainer [2024-11-20 08:34:00,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:34:00,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:34:00,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:34:00,425 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:34:00,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:33:57" (3/4) ... [2024-11-20 08:34:00,428 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:34:00,429 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:34:00,430 INFO L158 Benchmark]: Toolchain (without parser) took 4300.49ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 107.7MB in the beginning and 85.5MB in the end (delta: 22.2MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-11-20 08:34:00,431 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:34:00,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.52ms. Allocated memory is still 161.5MB. Free memory was 107.3MB in the beginning and 90.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 08:34:00,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.14ms. Allocated memory is still 161.5MB. Free memory was 90.5MB in the beginning and 126.4MB in the end (delta: -35.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:34:00,432 INFO L158 Benchmark]: Boogie Preprocessor took 102.64ms. Allocated memory is still 161.5MB. Free memory was 126.4MB in the beginning and 121.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:34:00,432 INFO L158 Benchmark]: RCFGBuilder took 800.22ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 82.3MB in the end (delta: 39.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-20 08:34:00,433 INFO L158 Benchmark]: TraceAbstraction took 2882.57ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 81.5MB in the beginning and 86.6MB in the end (delta: -5.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-11-20 08:34:00,433 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 220.2MB. Free memory was 86.6MB in the beginning and 85.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:34:00,435 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.16ms. Allocated memory is still 96.5MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.52ms. Allocated memory is still 161.5MB. Free memory was 107.3MB in the beginning and 90.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.14ms. Allocated memory is still 161.5MB. Free memory was 90.5MB in the beginning and 126.4MB in the end (delta: -35.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.64ms. Allocated memory is still 161.5MB. Free memory was 126.4MB in the beginning and 121.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 800.22ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 82.3MB in the end (delta: 39.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2882.57ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 81.5MB in the beginning and 86.6MB in the end (delta: -5.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 220.2MB. Free memory was 86.6MB in the beginning and 85.5MB 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 86, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L25] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0][0]); [L26] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1][0]); [L27] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[0][1]); [L28] float* float_Array_0_arrayfloat_Array_0arrayVar3_Pointer = &(float_Array_0[1][1]); [L29-L31] signed long int signed_long_int_Array_0[1] = { -32 }; [L29-L31] signed long int signed_long_int_Array_0[1] = { -32 }; [L32] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L33-L35] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L33-L35] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L33-L35] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L36] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L37] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L38-L40] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L38-L40] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L38-L40] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L41] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L43-L45] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L43-L45] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L46] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L47] unsigned char last_1_unsigned_char_Array_0_1_ = 64; VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=0, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L83] EXPR unsigned_char_Array_0[1] [L83] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L93] RET updateLastVariables() [L94] CALL updateVariables() [L67] float_Array_0[0][1] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0][1] [L68] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L68] EXPR float_Array_0[0][1] [L68] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L68] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L69] float_Array_0[1][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1][1] [L70] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F [L70] EXPR float_Array_0[1][1] [L70] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] CALL assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] RET assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L71] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L72] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L72] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L72] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L73] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L73] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L73] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L74] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L74] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L74] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L75] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L77] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L78] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] RET updateVariables() [L95] CALL step() [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L51] (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) = ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) [L52] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L52] COND TRUE (- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4)))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L53] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L55] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L55] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L56] COND TRUE (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L57] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L57] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L61] signed long int stepLocal_0 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))); [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L62] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L62] COND FALSE !(stepLocal_0 != ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) [L86] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L86] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L86] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L86] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L86] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L86] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L86] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] EXPR ((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86-L87] return ((((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) ((0.85f - (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) + (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))))) && (((- last_1_unsigned_char_Array_0_1_) >= ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) != ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (((((10u) < (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (10u) : (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, 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_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 695 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 319 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 376 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:34:00,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f81eb34c60dcaea85edbe1be61380039c4cd459b327890e24dee350b4faadfa0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:34:02,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:34:02,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:34:02,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:34:02,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:34:02,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:34:02,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:34:02,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:34:02,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:34:02,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:34:02,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:34:02,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:34:02,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:34:02,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:34:02,739 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:34:02,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:34:02,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:34:02,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:34:02,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:34:02,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:34:02,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:34:02,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:34:02,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:34:02,745 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:34:02,746 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:34:02,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:34:02,746 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:34:02,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:34:02,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:34:02,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:34:02,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:34:02,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:34:02,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:34:02,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:34:02,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:34:02,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:34:02,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:34:02,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:34:02,755 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:34:02,756 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:34:02,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:34:02,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:34:02,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:34:02,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:34:02,757 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f81eb34c60dcaea85edbe1be61380039c4cd459b327890e24dee350b4faadfa0 [2024-11-20 08:34:03,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:34:03,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:34:03,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:34:03,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:34:03,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:34:03,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i [2024-11-20 08:34:04,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:34:04,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:34:04,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i [2024-11-20 08:34:04,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20ae71339/463b2f27090f46a99b13f7a27851c4a4/FLAGbc5db9b61 [2024-11-20 08:34:04,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20ae71339/463b2f27090f46a99b13f7a27851c4a4 [2024-11-20 08:34:05,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:34:05,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:34:05,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:34:05,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:34:05,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:34:05,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e48bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05, skipping insertion in model container [2024-11-20 08:34:05,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:34:05,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i[917,930] [2024-11-20 08:34:05,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:34:05,386 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:34:05,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-26.i[917,930] [2024-11-20 08:34:05,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:34:05,490 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:34:05,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05 WrapperNode [2024-11-20 08:34:05,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:34:05,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:34:05,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:34:05,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:34:05,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,584 INFO L138 Inliner]: procedures = 36, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-11-20 08:34:05,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:34:05,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:34:05,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:34:05,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:34:05,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,658 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2024-11-20 08:34:05,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:34:05,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:34:05,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:34:05,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:34:05,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (1/1) ... [2024-11-20 08:34:05,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:34:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:34:05,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:34:05,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:34:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:34:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:34:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:34:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:34:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:34:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:34:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-20 08:34:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 08:34:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 08:34:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 08:34:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 08:34:05,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 08:34:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 08:34:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 08:34:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 08:34:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 08:34:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-20 08:34:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 08:34:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:34:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:34:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-20 08:34:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-20 08:34:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-20 08:34:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-20 08:34:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-20 08:34:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-20 08:34:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-20 08:34:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-20 08:34:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-20 08:34:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-20 08:34:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:34:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:34:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:34:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:34:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:34:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:34:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:34:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:34:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:34:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 08:34:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 08:34:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 08:34:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-20 08:34:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-20 08:34:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-20 08:34:05,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-20 08:34:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 08:34:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 08:34:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 08:34:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 08:34:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-20 08:34:05,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-20 08:34:06,052 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:34:06,054 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:34:07,188 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-20 08:34:07,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:34:07,206 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:34:07,206 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:34:07,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:34:07 BoogieIcfgContainer [2024-11-20 08:34:07,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:34:07,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:34:07,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:34:07,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:34:07,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:34:05" (1/3) ... [2024-11-20 08:34:07,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6355de5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:34:07, skipping insertion in model container [2024-11-20 08:34:07,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:34:05" (2/3) ... [2024-11-20 08:34:07,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6355de5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:34:07, skipping insertion in model container [2024-11-20 08:34:07,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:34:07" (3/3) ... [2024-11-20 08:34:07,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-26.i [2024-11-20 08:34:07,232 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:34:07,233 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:34:07,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:34:07,325 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;@5694df47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:34:07,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:34:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:34:07,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:07,343 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:07,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:07,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1509494359, now seen corresponding path program 1 times [2024-11-20 08:34:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410074958] [2024-11-20 08:34:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:07,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:07,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:07,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:07,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:34:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:07,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:34:07,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-20 08:34:07,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:07,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410074958] [2024-11-20 08:34:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410074958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:07,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:07,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:34:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122324923] [2024-11-20 08:34:07,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:07,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:34:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:34:07,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:34:07,911 INFO L87 Difference]: Start difference. First operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-20 08:34:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:07,945 INFO L93 Difference]: Finished difference Result 179 states and 271 transitions. [2024-11-20 08:34:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:34:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-20 08:34:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:07,953 INFO L225 Difference]: With dead ends: 179 [2024-11-20 08:34:07,954 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 08:34:07,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:34:07,960 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:07,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:34:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 08:34:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 08:34:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-20 08:34:08,003 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2024-11-20 08:34:08,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:08,003 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-20 08:34:08,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-20 08:34:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-20 08:34:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:34:08,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:08,007 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:08,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:34:08,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:08,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:08,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash 359888411, now seen corresponding path program 1 times [2024-11-20 08:34:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:08,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299039211] [2024-11-20 08:34:08,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:08,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:08,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:08,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:08,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:34:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:08,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 08:34:08,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:08,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:08,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299039211] [2024-11-20 08:34:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299039211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:08,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:34:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722781725] [2024-11-20 08:34:08,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:08,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:34:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:08,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:34:08,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:34:08,701 INFO L87 Difference]: Start difference. First operand 89 states and 127 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:08,808 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2024-11-20 08:34:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:34:08,809 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-20 08:34:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:08,811 INFO L225 Difference]: With dead ends: 180 [2024-11-20 08:34:08,811 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 08:34:08,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:34:08,814 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:08,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:34:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 08:34:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-20 08:34:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-11-20 08:34:08,831 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 89 [2024-11-20 08:34:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:08,833 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-11-20 08:34:08,833 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-11-20 08:34:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:34:08,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:08,835 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:08,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 08:34:09,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:09,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:09,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash 361735453, now seen corresponding path program 1 times [2024-11-20 08:34:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:09,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817392178] [2024-11-20 08:34:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:09,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:09,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:09,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:09,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:34:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:09,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:34:09,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:09,633 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 95 treesize of output 41 [2024-11-20 08:34:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:09,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:09,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:09,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817392178] [2024-11-20 08:34:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817392178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:09,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:09,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:34:09,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950628308] [2024-11-20 08:34:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:09,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:34:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:34:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:34:09,684 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:10,602 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-11-20 08:34:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:34:10,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-20 08:34:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:10,605 INFO L225 Difference]: With dead ends: 184 [2024-11-20 08:34:10,605 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 08:34:10,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:34:10,607 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 121 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:10,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 434 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 08:34:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 08:34:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-20 08:34:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-20 08:34:10,621 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 89 [2024-11-20 08:34:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:10,621 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-20 08:34:10,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-20 08:34:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 08:34:10,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:10,625 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:10,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 08:34:10,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:10,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:10,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1492377065, now seen corresponding path program 1 times [2024-11-20 08:34:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604807853] [2024-11-20 08:34:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:10,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:10,836 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:10,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 08:34:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:11,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:34:11,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:11,275 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-11-20 08:34:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:11,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:11,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:11,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604807853] [2024-11-20 08:34:11,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604807853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:11,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:11,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590187100] [2024-11-20 08:34:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:11,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:11,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:11,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:11,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:11,301 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:11,701 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2024-11-20 08:34:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:11,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-20 08:34:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:11,703 INFO L225 Difference]: With dead ends: 183 [2024-11-20 08:34:11,703 INFO L226 Difference]: Without dead ends: 93 [2024-11-20 08:34:11,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:11,706 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:11,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:34:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-20 08:34:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-20 08:34:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-11-20 08:34:11,718 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 91 [2024-11-20 08:34:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:11,720 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-11-20 08:34:11,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-20 08:34:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 08:34:11,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:11,725 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:11,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 08:34:11,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:11,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:11,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1984941781, now seen corresponding path program 1 times [2024-11-20 08:34:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754779748] [2024-11-20 08:34:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:11,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:11,931 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:11,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 08:34:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:12,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:34:12,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:12,324 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 43 treesize of output 19 [2024-11-20 08:34:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:12,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:12,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:12,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754779748] [2024-11-20 08:34:12,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754779748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:12,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:12,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885587917] [2024-11-20 08:34:12,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:12,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:12,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:12,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:12,350 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:12,843 INFO L93 Difference]: Finished difference Result 181 states and 253 transitions. [2024-11-20 08:34:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:12,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-20 08:34:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:12,845 INFO L225 Difference]: With dead ends: 181 [2024-11-20 08:34:12,845 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 08:34:12,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:12,847 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 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.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:12,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:34:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 08:34:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 08:34:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2024-11-20 08:34:12,855 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 91 [2024-11-20 08:34:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:12,855 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2024-11-20 08:34:12,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2024-11-20 08:34:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 08:34:12,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:12,857 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:12,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 08:34:13,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:13,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:13,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1660065302, now seen corresponding path program 1 times [2024-11-20 08:34:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:13,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383591415] [2024-11-20 08:34:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:13,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:13,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:13,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:13,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 08:34:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:13,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:34:13,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:13,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:13,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383591415] [2024-11-20 08:34:13,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383591415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:13,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:13,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965039358] [2024-11-20 08:34:13,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:13,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:13,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:13,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:13,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:13,495 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:14,063 INFO L93 Difference]: Finished difference Result 179 states and 249 transitions. [2024-11-20 08:34:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:14,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-20 08:34:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:14,065 INFO L225 Difference]: With dead ends: 179 [2024-11-20 08:34:14,065 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 08:34:14,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:14,066 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:14,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:34:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 08:34:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 08:34:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2024-11-20 08:34:14,078 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 96 [2024-11-20 08:34:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:14,079 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2024-11-20 08:34:14,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2024-11-20 08:34:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 08:34:14,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:14,080 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:14,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-20 08:34:14,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:14,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:14,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:14,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1800613912, now seen corresponding path program 1 times [2024-11-20 08:34:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209997978] [2024-11-20 08:34:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:14,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:14,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:14,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:14,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 08:34:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:14,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:34:14,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:14,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:14,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:14,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209997978] [2024-11-20 08:34:14,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209997978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:14,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217491602] [2024-11-20 08:34:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:14,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:14,670 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:15,160 INFO L93 Difference]: Finished difference Result 179 states and 247 transitions. [2024-11-20 08:34:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:15,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-20 08:34:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:15,162 INFO L225 Difference]: With dead ends: 179 [2024-11-20 08:34:15,162 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 08:34:15,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:15,163 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:15,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:34:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 08:34:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 08:34:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2024-11-20 08:34:15,170 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 96 [2024-11-20 08:34:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:15,170 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2024-11-20 08:34:15,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2024-11-20 08:34:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 08:34:15,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:15,172 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:15,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 08:34:15,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:15,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:15,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:15,373 INFO L85 PathProgramCache]: Analyzing trace with hash -4824422, now seen corresponding path program 1 times [2024-11-20 08:34:15,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:15,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80323369] [2024-11-20 08:34:15,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:15,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:15,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:15,375 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:15,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 08:34:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:15,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:34:15,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:15,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:15,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80323369] [2024-11-20 08:34:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80323369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:15,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:34:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576212907] [2024-11-20 08:34:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:15,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:34:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:34:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:15,882 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:16,209 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2024-11-20 08:34:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:34:16,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-20 08:34:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:16,211 INFO L225 Difference]: With dead ends: 179 [2024-11-20 08:34:16,211 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 08:34:16,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:34:16,213 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:16,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:34:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 08:34:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 08:34:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:34:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-20 08:34:16,218 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 96 [2024-11-20 08:34:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:16,218 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-20 08:34:16,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-20 08:34:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 08:34:16,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:16,220 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:16,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 08:34:16,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:16,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:16,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 417877404, now seen corresponding path program 1 times [2024-11-20 08:34:16,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:16,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834113274] [2024-11-20 08:34:16,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:16,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:16,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:16,425 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:16,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 08:34:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:16,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 08:34:16,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:17,083 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 28 treesize of output 24 [2024-11-20 08:34:17,197 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 33 treesize of output 25 [2024-11-20 08:34:17,259 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 57 treesize of output 33 [2024-11-20 08:34:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:17,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:34:17,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:17,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834113274] [2024-11-20 08:34:17,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834113274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:34:17,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:34:17,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 08:34:17,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086706767] [2024-11-20 08:34:17,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:17,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 08:34:17,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:17,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 08:34:17,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:34:17,429 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:34:19,456 INFO L93 Difference]: Finished difference Result 251 states and 341 transitions. [2024-11-20 08:34:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 08:34:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-20 08:34:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:34:19,458 INFO L225 Difference]: With dead ends: 251 [2024-11-20 08:34:19,458 INFO L226 Difference]: Without dead ends: 163 [2024-11-20 08:34:19,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-20 08:34:19,459 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 90 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:34:19,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1101 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 08:34:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-20 08:34:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2024-11-20 08:34:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 142 states have internal predecessors, (188), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:34:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 216 transitions. [2024-11-20 08:34:19,481 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 216 transitions. Word has length 96 [2024-11-20 08:34:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:34:19,482 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 216 transitions. [2024-11-20 08:34:19,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:34:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 216 transitions. [2024-11-20 08:34:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 08:34:19,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:34:19,484 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:34:19,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-20 08:34:19,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:19,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:34:19,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:34:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1118941982, now seen corresponding path program 1 times [2024-11-20 08:34:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:34:19,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777097266] [2024-11-20 08:34:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:34:19,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:34:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:34:19,687 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:34:19,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 08:34:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:34:20,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 08:34:20,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:34:20,910 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 28 treesize of output 24 [2024-11-20 08:34:20,982 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 16 treesize of output 8 [2024-11-20 08:34:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-20 08:34:21,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:34:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:34:33,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:34:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777097266] [2024-11-20 08:34:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777097266] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:34:33,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:34:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2024-11-20 08:34:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185887854] [2024-11-20 08:34:33,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:34:33,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:34:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:34:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:34:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-20 08:34:33,893 INFO L87 Difference]: Start difference. First operand 158 states and 216 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:19,269 INFO L93 Difference]: Finished difference Result 404 states and 547 transitions. [2024-11-20 08:35:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 08:35:19,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-20 08:35:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:19,273 INFO L225 Difference]: With dead ends: 404 [2024-11-20 08:35:19,273 INFO L226 Difference]: Without dead ends: 245 [2024-11-20 08:35:19,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 08:35:19,275 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 243 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:19,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1398 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 34.0s Time] [2024-11-20 08:35:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-20 08:35:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 239. [2024-11-20 08:35:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 212 states have (on average 1.330188679245283) internal successors, (282), 215 states have internal predecessors, (282), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:35:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 324 transitions. [2024-11-20 08:35:19,293 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 324 transitions. Word has length 96 [2024-11-20 08:35:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:19,293 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 324 transitions. [2024-11-20 08:35:19,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 324 transitions. [2024-11-20 08:35:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 08:35:19,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:19,295 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:19,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-20 08:35:19,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:19,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:19,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1350245649, now seen corresponding path program 1 times [2024-11-20 08:35:19,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:19,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823280171] [2024-11-20 08:35:19,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:19,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:19,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:19,501 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:19,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 08:35:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:19,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:35:19,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:19,894 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-11-20 08:35:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:35:19,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:19,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823280171] [2024-11-20 08:35:19,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823280171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:19,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:19,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:35:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685198471] [2024-11-20 08:35:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:19,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:35:19,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:35:19,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:19,928 INFO L87 Difference]: Start difference. First operand 239 states and 324 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:20,419 INFO L93 Difference]: Finished difference Result 456 states and 620 transitions. [2024-11-20 08:35:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:35:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-20 08:35:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:20,422 INFO L225 Difference]: With dead ends: 456 [2024-11-20 08:35:20,422 INFO L226 Difference]: Without dead ends: 239 [2024-11-20 08:35:20,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:20,423 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:20,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:35:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-20 08:35:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-20 08:35:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 215 states have internal predecessors, (281), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:35:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 323 transitions. [2024-11-20 08:35:20,446 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 323 transitions. Word has length 96 [2024-11-20 08:35:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:20,446 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 323 transitions. [2024-11-20 08:35:20,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2024-11-20 08:35:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 08:35:20,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:20,448 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:20,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-20 08:35:20,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:20,649 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:20,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1772947475, now seen corresponding path program 1 times [2024-11-20 08:35:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:20,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603799430] [2024-11-20 08:35:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:20,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:20,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:20,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:20,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 08:35:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:21,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:35:21,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:21,113 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 43 treesize of output 19 [2024-11-20 08:35:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:35:21,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:21,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603799430] [2024-11-20 08:35:21,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603799430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:21,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:21,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:35:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647094753] [2024-11-20 08:35:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:21,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:35:21,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:35:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:21,145 INFO L87 Difference]: Start difference. First operand 239 states and 323 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:21,185 INFO L93 Difference]: Finished difference Result 450 states and 610 transitions. [2024-11-20 08:35:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:35:21,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-20 08:35:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:21,189 INFO L225 Difference]: With dead ends: 450 [2024-11-20 08:35:21,189 INFO L226 Difference]: Without dead ends: 233 [2024-11-20 08:35:21,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:21,190 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 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-11-20 08:35:21,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-20 08:35:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-20 08:35:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 206 states have (on average 1.3155339805825244) internal successors, (271), 209 states have internal predecessors, (271), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:35:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 313 transitions. [2024-11-20 08:35:21,206 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 313 transitions. Word has length 96 [2024-11-20 08:35:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:21,206 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 313 transitions. [2024-11-20 08:35:21,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 313 transitions. [2024-11-20 08:35:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 08:35:21,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:21,208 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:21,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-20 08:35:21,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:21,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:21,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash -504557523, now seen corresponding path program 1 times [2024-11-20 08:35:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:21,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239760397] [2024-11-20 08:35:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:21,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:21,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:21,411 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:21,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 08:35:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:21,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:35:21,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:21,835 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-11-20 08:35:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:35:21,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:21,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:21,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239760397] [2024-11-20 08:35:21,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239760397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:21,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:21,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:35:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881527230] [2024-11-20 08:35:21,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:21,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:35:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:35:21,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:21,886 INFO L87 Difference]: Start difference. First operand 233 states and 313 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:21,927 INFO L93 Difference]: Finished difference Result 444 states and 598 transitions. [2024-11-20 08:35:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:35:21,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-20 08:35:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:21,929 INFO L225 Difference]: With dead ends: 444 [2024-11-20 08:35:21,929 INFO L226 Difference]: Without dead ends: 233 [2024-11-20 08:35:21,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:21,930 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:21,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-20 08:35:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-20 08:35:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 209 states have internal predecessors, (268), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:35:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 310 transitions. [2024-11-20 08:35:21,948 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 310 transitions. Word has length 101 [2024-11-20 08:35:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 310 transitions. [2024-11-20 08:35:21,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2024-11-20 08:35:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 08:35:21,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:21,951 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:21,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-20 08:35:22,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:22,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:22,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2101466031, now seen corresponding path program 1 times [2024-11-20 08:35:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795122421] [2024-11-20 08:35:22,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:22,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:22,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:22,155 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:22,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 08:35:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:22,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:35:22,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:22,612 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-11-20 08:35:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-20 08:35:22,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:35:22,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:35:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795122421] [2024-11-20 08:35:22,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795122421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:22,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:22,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:35:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514355868] [2024-11-20 08:35:22,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:22,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:35:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:35:22,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:35:22,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:22,653 INFO L87 Difference]: Start difference. First operand 233 states and 310 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:22,704 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2024-11-20 08:35:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:35:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-20 08:35:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:22,706 INFO L225 Difference]: With dead ends: 444 [2024-11-20 08:35:22,706 INFO L226 Difference]: Without dead ends: 233 [2024-11-20 08:35:22,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:35:22,707 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:22,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-20 08:35:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-20 08:35:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 206 states have (on average 1.2864077669902914) internal successors, (265), 209 states have internal predecessors, (265), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:35:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 307 transitions. [2024-11-20 08:35:22,727 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 307 transitions. Word has length 101 [2024-11-20 08:35:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:22,728 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 307 transitions. [2024-11-20 08:35:22,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-20 08:35:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 307 transitions. [2024-11-20 08:35:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 08:35:22,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:22,730 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:35:22,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-20 08:35:22,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:22,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:22,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash 821602353, now seen corresponding path program 1 times [2024-11-20 08:35:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:35:22,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188384214] [2024-11-20 08:35:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:22,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:35:22,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:35:22,935 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:35:22,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 08:35:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:23,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-20 08:35:23,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:35:25,089 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 28 treesize of output 24 [2024-11-20 08:35:25,225 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 16 treesize of output 8 [2024-11-20 08:35:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-20 08:35:25,537 INFO L311 TraceCheckSpWp]: Computing backward predicates...