/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/float_req_bl_0220b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:02:03,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:02:03,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:02:03,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:02:03,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:02:03,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:02:03,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:02:03,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:02:03,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:02:03,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:02:03,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:02:03,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:02:03,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:02:03,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:02:03,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:02:03,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:02:03,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:02:03,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:02:03,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:02:03,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:02:03,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:02:03,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:02:03,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:02:03,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:02:03,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:02:03,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:02:03,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:02:03,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:02:03,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:02:03,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:02:03,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:02:03,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:02:03,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:02:03,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:02:03,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:02:03,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:02:03,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:02:03,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:02:03,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:02:03,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:02:03,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:02:03,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 12:02:03,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:02:03,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:02:03,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:02:03,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:02:03,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:02:03,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:02:03,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:02:03,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:02:03,300 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:02:03,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:02:03,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:02:03,300 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:02:03,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:02:03,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:02:03,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:02:03,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:02:03,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:02:03,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:02:03,302 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:02:03,302 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:02:03,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:02:03,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:02:03,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:02:03,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:02:03,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:02:03,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:02:03,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:02:03,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:02:03,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:02:03,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:02:03,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:02:03,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:02:03,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:02:03,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-16 12:02:03,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:02:03,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:02:03,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:02:03,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:02:03,809 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:02:03,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0220b.c [2022-10-16 12:02:03,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be41333d3/fa3360d6961b429f9a2a037f7c67aa19/FLAG4beedf647 [2022-10-16 12:02:04,636 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:02:04,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0220b.c [2022-10-16 12:02:04,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be41333d3/fa3360d6961b429f9a2a037f7c67aa19/FLAG4beedf647 [2022-10-16 12:02:04,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be41333d3/fa3360d6961b429f9a2a037f7c67aa19 [2022-10-16 12:02:04,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:02:04,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:02:04,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:02:04,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:02:04,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:02:04,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:04" (1/1) ... [2022-10-16 12:02:04,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2387eab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:04, skipping insertion in model container [2022-10-16 12:02:04,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:04" (1/1) ... [2022-10-16 12:02:04,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:02:04,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:02:05,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0220b.c[15845,15858] [2022-10-16 12:02:05,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:02:05,433 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:02:05,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0220b.c[15845,15858] [2022-10-16 12:02:05,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:02:05,686 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:02:05,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05 WrapperNode [2022-10-16 12:02:05,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:02:05,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:02:05,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:02:05,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:02:05,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:05,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:05,903 INFO L138 Inliner]: procedures = 25, calls = 495, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1335 [2022-10-16 12:02:05,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:02:05,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:02:05,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:02:05,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:02:05,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:05,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:05,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:05,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:05,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:06,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:06,035 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:06,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:06,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:02:06,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:02:06,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:02:06,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:02:06,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (1/1) ... [2022-10-16 12:02:06,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:02:06,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:02:06,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 12:02:06,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 12:02:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_cosf [2022-10-16 12:02:06,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_cosf [2022-10-16 12:02:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:02:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:02:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 12:02:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:02:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 12:02:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_sinf [2022-10-16 12:02:06,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_sinf [2022-10-16 12:02:06,211 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_float [2022-10-16 12:02:06,211 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_float [2022-10-16 12:02:06,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:02:06,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-16 12:02:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_float [2022-10-16 12:02:06,212 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_float [2022-10-16 12:02:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:02:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:02:06,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:02:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:02:06,509 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:02:06,511 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:02:08,164 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:02:08,178 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:02:08,178 INFO L300 CfgBuilder]: Removed 61 assume(true) statements. [2022-10-16 12:02:08,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:08 BoogieIcfgContainer [2022-10-16 12:02:08,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:02:08,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:02:08,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:02:08,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:02:08,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:02:04" (1/3) ... [2022-10-16 12:02:08,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5401208c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:08, skipping insertion in model container [2022-10-16 12:02:08,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:05" (2/3) ... [2022-10-16 12:02:08,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5401208c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:08, skipping insertion in model container [2022-10-16 12:02:08,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:08" (3/3) ... [2022-10-16 12:02:08,193 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0220b.c [2022-10-16 12:02:08,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:02:08,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 174 error locations. [2022-10-16 12:02:08,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:02:08,306 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@579cbbea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:02:08,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 174 error locations. [2022-10-16 12:02:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 596 states, 405 states have (on average 1.8271604938271604) internal successors, (740), 579 states have internal predecessors, (740), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-10-16 12:02:08,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 12:02:08,325 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:08,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:08,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2125049545, now seen corresponding path program 1 times [2022-10-16 12:02:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896799033] [2022-10-16 12:02:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:08,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896799033] [2022-10-16 12:02:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896799033] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:08,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:08,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596333879] [2022-10-16 12:02:08,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:08,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:02:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:02:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:02:08,963 INFO L87 Difference]: Start difference. First operand has 596 states, 405 states have (on average 1.8271604938271604) internal successors, (740), 579 states have internal predecessors, (740), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:09,069 INFO L93 Difference]: Finished difference Result 1190 states and 1538 transitions. [2022-10-16 12:02:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:02:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 12:02:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:09,101 INFO L225 Difference]: With dead ends: 1190 [2022-10-16 12:02:09,102 INFO L226 Difference]: Without dead ends: 563 [2022-10-16 12:02:09,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:02:09,120 INFO L413 NwaCegarLoop]: 698 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, 698 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 [2022-10-16 12:02:09,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-10-16 12:02:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-10-16 12:02:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 378 states have (on average 1.6772486772486772) internal successors, (634), 552 states have internal predecessors, (634), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 650 transitions. [2022-10-16 12:02:09,218 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 650 transitions. Word has length 13 [2022-10-16 12:02:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:09,218 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 650 transitions. [2022-10-16 12:02:09,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 650 transitions. [2022-10-16 12:02:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:02:09,220 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:09,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:09,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:02:09,221 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1748799618, now seen corresponding path program 1 times [2022-10-16 12:02:09,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:09,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590186668] [2022-10-16 12:02:09,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:09,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:09,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:09,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590186668] [2022-10-16 12:02:09,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590186668] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:09,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:09,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097324462] [2022-10-16 12:02:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:09,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:09,538 INFO L87 Difference]: Start difference. First operand 563 states and 650 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:09,633 INFO L93 Difference]: Finished difference Result 1120 states and 1293 transitions. [2022-10-16 12:02:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:09,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 12:02:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:09,639 INFO L225 Difference]: With dead ends: 1120 [2022-10-16 12:02:09,639 INFO L226 Difference]: Without dead ends: 571 [2022-10-16 12:02:09,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:09,643 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 7 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:09,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1273 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-10-16 12:02:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 564. [2022-10-16 12:02:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 379 states have (on average 1.675461741424802) internal successors, (635), 553 states have internal predecessors, (635), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 651 transitions. [2022-10-16 12:02:09,703 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 651 transitions. Word has length 15 [2022-10-16 12:02:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:09,703 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 651 transitions. [2022-10-16 12:02:09,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 651 transitions. [2022-10-16 12:02:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 12:02:09,706 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:09,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:09,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:02:09,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:09,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1897309095, now seen corresponding path program 1 times [2022-10-16 12:02:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:09,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692584096] [2022-10-16 12:02:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692584096] [2022-10-16 12:02:09,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692584096] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:09,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:09,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778106409] [2022-10-16 12:02:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:09,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:09,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:09,930 INFO L87 Difference]: Start difference. First operand 564 states and 651 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:10,006 INFO L93 Difference]: Finished difference Result 571 states and 659 transitions. [2022-10-16 12:02:10,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:10,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-16 12:02:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:10,011 INFO L225 Difference]: With dead ends: 571 [2022-10-16 12:02:10,011 INFO L226 Difference]: Without dead ends: 570 [2022-10-16 12:02:10,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:10,021 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 530 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:10,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 745 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-10-16 12:02:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2022-10-16 12:02:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 379 states have (on average 1.6728232189973615) internal successors, (634), 552 states have internal predecessors, (634), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 650 transitions. [2022-10-16 12:02:10,052 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 650 transitions. Word has length 18 [2022-10-16 12:02:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:10,053 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 650 transitions. [2022-10-16 12:02:10,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 650 transitions. [2022-10-16 12:02:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 12:02:10,055 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:10,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:10,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:02:10,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:10,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1312959858, now seen corresponding path program 1 times [2022-10-16 12:02:10,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:10,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668143905] [2022-10-16 12:02:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:10,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:10,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668143905] [2022-10-16 12:02:10,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668143905] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:10,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:10,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:10,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126705140] [2022-10-16 12:02:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:10,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:10,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:10,303 INFO L87 Difference]: Start difference. First operand 563 states and 650 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:10,380 INFO L93 Difference]: Finished difference Result 570 states and 658 transitions. [2022-10-16 12:02:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:10,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 12:02:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:10,384 INFO L225 Difference]: With dead ends: 570 [2022-10-16 12:02:10,385 INFO L226 Difference]: Without dead ends: 569 [2022-10-16 12:02:10,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:10,387 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 491 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:10,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 938 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-10-16 12:02:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 562. [2022-10-16 12:02:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 379 states have (on average 1.6701846965699207) internal successors, (633), 551 states have internal predecessors, (633), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 649 transitions. [2022-10-16 12:02:10,408 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 649 transitions. Word has length 19 [2022-10-16 12:02:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:10,409 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 649 transitions. [2022-10-16 12:02:10,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 649 transitions. [2022-10-16 12:02:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 12:02:10,410 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:10,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:10,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:02:10,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash 965972528, now seen corresponding path program 1 times [2022-10-16 12:02:10,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:10,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663529751] [2022-10-16 12:02:10,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:10,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:10,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663529751] [2022-10-16 12:02:10,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663529751] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:10,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:10,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655284190] [2022-10-16 12:02:10,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:10,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:10,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:10,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:10,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:10,648 INFO L87 Difference]: Start difference. First operand 562 states and 649 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:10,741 INFO L93 Difference]: Finished difference Result 576 states and 665 transitions. [2022-10-16 12:02:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:10,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-16 12:02:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:10,746 INFO L225 Difference]: With dead ends: 576 [2022-10-16 12:02:10,747 INFO L226 Difference]: Without dead ends: 575 [2022-10-16 12:02:10,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:02:10,748 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 1012 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:10,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 905 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:02:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-10-16 12:02:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 561. [2022-10-16 12:02:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 379 states have (on average 1.6675461741424802) internal successors, (632), 550 states have internal predecessors, (632), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 648 transitions. [2022-10-16 12:02:10,770 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 648 transitions. Word has length 21 [2022-10-16 12:02:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:10,771 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 648 transitions. [2022-10-16 12:02:10,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 648 transitions. [2022-10-16 12:02:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 12:02:10,773 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:10,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:10,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:02:10,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash -119622355, now seen corresponding path program 1 times [2022-10-16 12:02:10,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:10,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549136678] [2022-10-16 12:02:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:10,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549136678] [2022-10-16 12:02:10,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549136678] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:10,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:10,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:02:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86359443] [2022-10-16 12:02:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:10,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:02:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:10,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:02:10,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:02:10,940 INFO L87 Difference]: Start difference. First operand 561 states and 648 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:11,035 INFO L93 Difference]: Finished difference Result 575 states and 664 transitions. [2022-10-16 12:02:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:11,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-16 12:02:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:11,040 INFO L225 Difference]: With dead ends: 575 [2022-10-16 12:02:11,040 INFO L226 Difference]: Without dead ends: 574 [2022-10-16 12:02:11,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:02:11,042 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 972 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:11,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 1113 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:02:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-10-16 12:02:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 560. [2022-10-16 12:02:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 379 states have (on average 1.6649076517150396) internal successors, (631), 549 states have internal predecessors, (631), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 647 transitions. [2022-10-16 12:02:11,063 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 647 transitions. Word has length 22 [2022-10-16 12:02:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:11,063 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 647 transitions. [2022-10-16 12:02:11,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 647 transitions. [2022-10-16 12:02:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 12:02:11,065 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:11,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:11,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:02:11,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:11,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash 586674642, now seen corresponding path program 1 times [2022-10-16 12:02:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:11,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958350908] [2022-10-16 12:02:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:11,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:11,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958350908] [2022-10-16 12:02:11,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958350908] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:11,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:11,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114593925] [2022-10-16 12:02:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:11,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:11,233 INFO L87 Difference]: Start difference. First operand 560 states and 647 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:11,302 INFO L93 Difference]: Finished difference Result 567 states and 655 transitions. [2022-10-16 12:02:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:11,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 12:02:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:11,307 INFO L225 Difference]: With dead ends: 567 [2022-10-16 12:02:11,308 INFO L226 Difference]: Without dead ends: 566 [2022-10-16 12:02:11,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:11,310 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 481 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:11,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 792 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-10-16 12:02:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 559. [2022-10-16 12:02:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 379 states have (on average 1.6622691292875988) internal successors, (630), 548 states have internal predecessors, (630), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 646 transitions. [2022-10-16 12:02:11,338 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 646 transitions. Word has length 23 [2022-10-16 12:02:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:11,338 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 646 transitions. [2022-10-16 12:02:11,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 646 transitions. [2022-10-16 12:02:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 12:02:11,340 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:11,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:11,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:02:11,341 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 537011643, now seen corresponding path program 1 times [2022-10-16 12:02:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:11,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223681533] [2022-10-16 12:02:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223681533] [2022-10-16 12:02:11,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223681533] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:11,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:11,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:02:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218682394] [2022-10-16 12:02:11,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:11,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:11,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:11,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:11,613 INFO L87 Difference]: Start difference. First operand 559 states and 646 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:11,668 INFO L93 Difference]: Finished difference Result 580 states and 668 transitions. [2022-10-16 12:02:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:02:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 12:02:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:11,673 INFO L225 Difference]: With dead ends: 580 [2022-10-16 12:02:11,673 INFO L226 Difference]: Without dead ends: 558 [2022-10-16 12:02:11,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:02:11,675 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 2 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:11,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1915 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-10-16 12:02:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2022-10-16 12:02:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 378 states have (on average 1.656084656084656) internal successors, (626), 547 states have internal predecessors, (626), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 642 transitions. [2022-10-16 12:02:11,700 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 642 transitions. Word has length 25 [2022-10-16 12:02:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:11,701 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 642 transitions. [2022-10-16 12:02:11,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 642 transitions. [2022-10-16 12:02:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 12:02:11,702 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:11,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:11,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:02:11,702 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash 66429046, now seen corresponding path program 1 times [2022-10-16 12:02:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:11,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569374587] [2022-10-16 12:02:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:11,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:11,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569374587] [2022-10-16 12:02:11,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569374587] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:11,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:11,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580376134] [2022-10-16 12:02:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:11,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:11,888 INFO L87 Difference]: Start difference. First operand 558 states and 642 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:11,956 INFO L93 Difference]: Finished difference Result 579 states and 669 transitions. [2022-10-16 12:02:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:11,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 12:02:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:11,961 INFO L225 Difference]: With dead ends: 579 [2022-10-16 12:02:11,962 INFO L226 Difference]: Without dead ends: 577 [2022-10-16 12:02:11,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:11,963 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 28 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:11,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1896 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-10-16 12:02:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 570. [2022-10-16 12:02:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 391 states have (on average 1.6445012787723785) internal successors, (643), 559 states have internal predecessors, (643), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 659 transitions. [2022-10-16 12:02:12,014 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 659 transitions. Word has length 24 [2022-10-16 12:02:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:12,015 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 659 transitions. [2022-10-16 12:02:12,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 659 transitions. [2022-10-16 12:02:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 12:02:12,016 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:12,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:12,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:02:12,017 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1007045071, now seen corresponding path program 1 times [2022-10-16 12:02:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:12,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851392751] [2022-10-16 12:02:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:02:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:12,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851392751] [2022-10-16 12:02:12,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851392751] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:12,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:12,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110959255] [2022-10-16 12:02:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:12,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:12,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:12,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:12,183 INFO L87 Difference]: Start difference. First operand 570 states and 659 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:12,277 INFO L93 Difference]: Finished difference Result 577 states and 667 transitions. [2022-10-16 12:02:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 12:02:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:12,283 INFO L225 Difference]: With dead ends: 577 [2022-10-16 12:02:12,283 INFO L226 Difference]: Without dead ends: 576 [2022-10-16 12:02:12,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:02:12,285 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 962 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:12,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 928 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:02:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-10-16 12:02:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 569. [2022-10-16 12:02:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 391 states have (on average 1.6419437340153453) internal successors, (642), 558 states have internal predecessors, (642), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 658 transitions. [2022-10-16 12:02:12,313 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 658 transitions. Word has length 24 [2022-10-16 12:02:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:12,314 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 658 transitions. [2022-10-16 12:02:12,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:02:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 658 transitions. [2022-10-16 12:02:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 12:02:12,315 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:12,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 12:02:12,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2059300700, now seen corresponding path program 1 times [2022-10-16 12:02:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:12,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817633124] [2022-10-16 12:02:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:02:12,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:02:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:02:12,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:02:12,623 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:02:12,625 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 174 remaining) [2022-10-16 12:02:12,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 174 remaining) [2022-10-16 12:02:12,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 174 remaining) [2022-10-16 12:02:12,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 174 remaining) [2022-10-16 12:02:12,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 174 remaining) [2022-10-16 12:02:12,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 174 remaining) [2022-10-16 12:02:12,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 174 remaining) [2022-10-16 12:02:12,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 174 remaining) [2022-10-16 12:02:12,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 174 remaining) [2022-10-16 12:02:12,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 174 remaining) [2022-10-16 12:02:12,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 174 remaining) [2022-10-16 12:02:12,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 174 remaining) [2022-10-16 12:02:12,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 174 remaining) [2022-10-16 12:02:12,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 174 remaining) [2022-10-16 12:02:12,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 174 remaining) [2022-10-16 12:02:12,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 174 remaining) [2022-10-16 12:02:12,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 174 remaining) [2022-10-16 12:02:12,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 174 remaining) [2022-10-16 12:02:12,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 174 remaining) [2022-10-16 12:02:12,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 174 remaining) [2022-10-16 12:02:12,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 174 remaining) [2022-10-16 12:02:12,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 174 remaining) [2022-10-16 12:02:12,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 174 remaining) [2022-10-16 12:02:12,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 174 remaining) [2022-10-16 12:02:12,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 174 remaining) [2022-10-16 12:02:12,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 174 remaining) [2022-10-16 12:02:12,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 174 remaining) [2022-10-16 12:02:12,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 174 remaining) [2022-10-16 12:02:12,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 174 remaining) [2022-10-16 12:02:12,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 174 remaining) [2022-10-16 12:02:12,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 174 remaining) [2022-10-16 12:02:12,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 174 remaining) [2022-10-16 12:02:12,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 174 remaining) [2022-10-16 12:02:12,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 174 remaining) [2022-10-16 12:02:12,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 174 remaining) [2022-10-16 12:02:12,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 174 remaining) [2022-10-16 12:02:12,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 174 remaining) [2022-10-16 12:02:12,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 174 remaining) [2022-10-16 12:02:12,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 174 remaining) [2022-10-16 12:02:12,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 174 remaining) [2022-10-16 12:02:12,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 174 remaining) [2022-10-16 12:02:12,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 174 remaining) [2022-10-16 12:02:12,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 174 remaining) [2022-10-16 12:02:12,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 174 remaining) [2022-10-16 12:02:12,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 174 remaining) [2022-10-16 12:02:12,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 174 remaining) [2022-10-16 12:02:12,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 174 remaining) [2022-10-16 12:02:12,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 174 remaining) [2022-10-16 12:02:12,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 174 remaining) [2022-10-16 12:02:12,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 174 remaining) [2022-10-16 12:02:12,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 174 remaining) [2022-10-16 12:02:12,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 174 remaining) [2022-10-16 12:02:12,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 174 remaining) [2022-10-16 12:02:12,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 174 remaining) [2022-10-16 12:02:12,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 174 remaining) [2022-10-16 12:02:12,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 174 remaining) [2022-10-16 12:02:12,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 174 remaining) [2022-10-16 12:02:12,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 174 remaining) [2022-10-16 12:02:12,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 174 remaining) [2022-10-16 12:02:12,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 174 remaining) [2022-10-16 12:02:12,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 174 remaining) [2022-10-16 12:02:12,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 174 remaining) [2022-10-16 12:02:12,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 174 remaining) [2022-10-16 12:02:12,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 174 remaining) [2022-10-16 12:02:12,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 174 remaining) [2022-10-16 12:02:12,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 174 remaining) [2022-10-16 12:02:12,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 174 remaining) [2022-10-16 12:02:12,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 174 remaining) [2022-10-16 12:02:12,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 174 remaining) [2022-10-16 12:02:12,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 174 remaining) [2022-10-16 12:02:12,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 174 remaining) [2022-10-16 12:02:12,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 174 remaining) [2022-10-16 12:02:12,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 174 remaining) [2022-10-16 12:02:12,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 174 remaining) [2022-10-16 12:02:12,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 174 remaining) [2022-10-16 12:02:12,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 174 remaining) [2022-10-16 12:02:12,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 174 remaining) [2022-10-16 12:02:12,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 174 remaining) [2022-10-16 12:02:12,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 174 remaining) [2022-10-16 12:02:12,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 174 remaining) [2022-10-16 12:02:12,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 174 remaining) [2022-10-16 12:02:12,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 174 remaining) [2022-10-16 12:02:12,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 174 remaining) [2022-10-16 12:02:12,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 174 remaining) [2022-10-16 12:02:12,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 174 remaining) [2022-10-16 12:02:12,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 174 remaining) [2022-10-16 12:02:12,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 174 remaining) [2022-10-16 12:02:12,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 174 remaining) [2022-10-16 12:02:12,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 174 remaining) [2022-10-16 12:02:12,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 174 remaining) [2022-10-16 12:02:12,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 174 remaining) [2022-10-16 12:02:12,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 174 remaining) [2022-10-16 12:02:12,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 174 remaining) [2022-10-16 12:02:12,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 174 remaining) [2022-10-16 12:02:12,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 174 remaining) [2022-10-16 12:02:12,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 174 remaining) [2022-10-16 12:02:12,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 174 remaining) [2022-10-16 12:02:12,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 174 remaining) [2022-10-16 12:02:12,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 174 remaining) [2022-10-16 12:02:12,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 174 remaining) [2022-10-16 12:02:12,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 174 remaining) [2022-10-16 12:02:12,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 174 remaining) [2022-10-16 12:02:12,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 174 remaining) [2022-10-16 12:02:12,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 174 remaining) [2022-10-16 12:02:12,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 174 remaining) [2022-10-16 12:02:12,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 174 remaining) [2022-10-16 12:02:12,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 174 remaining) [2022-10-16 12:02:12,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 174 remaining) [2022-10-16 12:02:12,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 174 remaining) [2022-10-16 12:02:12,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 174 remaining) [2022-10-16 12:02:12,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 174 remaining) [2022-10-16 12:02:12,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 174 remaining) [2022-10-16 12:02:12,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 174 remaining) [2022-10-16 12:02:12,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 174 remaining) [2022-10-16 12:02:12,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 174 remaining) [2022-10-16 12:02:12,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 174 remaining) [2022-10-16 12:02:12,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 174 remaining) [2022-10-16 12:02:12,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 174 remaining) [2022-10-16 12:02:12,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 174 remaining) [2022-10-16 12:02:12,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 174 remaining) [2022-10-16 12:02:12,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 174 remaining) [2022-10-16 12:02:12,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 174 remaining) [2022-10-16 12:02:12,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 174 remaining) [2022-10-16 12:02:12,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 174 remaining) [2022-10-16 12:02:12,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 174 remaining) [2022-10-16 12:02:12,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 174 remaining) [2022-10-16 12:02:12,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 174 remaining) [2022-10-16 12:02:12,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 174 remaining) [2022-10-16 12:02:12,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 174 remaining) [2022-10-16 12:02:12,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 174 remaining) [2022-10-16 12:02:12,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 174 remaining) [2022-10-16 12:02:12,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 174 remaining) [2022-10-16 12:02:12,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 174 remaining) [2022-10-16 12:02:12,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 174 remaining) [2022-10-16 12:02:12,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 174 remaining) [2022-10-16 12:02:12,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 174 remaining) [2022-10-16 12:02:12,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 174 remaining) [2022-10-16 12:02:12,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 174 remaining) [2022-10-16 12:02:12,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 174 remaining) [2022-10-16 12:02:12,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 174 remaining) [2022-10-16 12:02:12,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 174 remaining) [2022-10-16 12:02:12,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 174 remaining) [2022-10-16 12:02:12,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 174 remaining) [2022-10-16 12:02:12,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 174 remaining) [2022-10-16 12:02:12,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 174 remaining) [2022-10-16 12:02:12,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 174 remaining) [2022-10-16 12:02:12,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 174 remaining) [2022-10-16 12:02:12,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 174 remaining) [2022-10-16 12:02:12,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 174 remaining) [2022-10-16 12:02:12,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 174 remaining) [2022-10-16 12:02:12,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 174 remaining) [2022-10-16 12:02:12,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 174 remaining) [2022-10-16 12:02:12,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 174 remaining) [2022-10-16 12:02:12,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 174 remaining) [2022-10-16 12:02:12,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 174 remaining) [2022-10-16 12:02:12,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 174 remaining) [2022-10-16 12:02:12,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 174 remaining) [2022-10-16 12:02:12,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 174 remaining) [2022-10-16 12:02:12,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 174 remaining) [2022-10-16 12:02:12,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 174 remaining) [2022-10-16 12:02:12,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 174 remaining) [2022-10-16 12:02:12,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 174 remaining) [2022-10-16 12:02:12,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 174 remaining) [2022-10-16 12:02:12,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 174 remaining) [2022-10-16 12:02:12,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 174 remaining) [2022-10-16 12:02:12,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 174 remaining) [2022-10-16 12:02:12,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 174 remaining) [2022-10-16 12:02:12,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 174 remaining) [2022-10-16 12:02:12,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 174 remaining) [2022-10-16 12:02:12,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 174 remaining) [2022-10-16 12:02:12,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 174 remaining) [2022-10-16 12:02:12,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 174 remaining) [2022-10-16 12:02:12,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 174 remaining) [2022-10-16 12:02:12,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 174 remaining) [2022-10-16 12:02:12,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 12:02:12,670 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:12,676 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:02:12,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:02:12 BoogieIcfgContainer [2022-10-16 12:02:12,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:02:12,775 INFO L158 Benchmark]: Toolchain (without parser) took 7887.49ms. Allocated memory was 151.0MB in the beginning and 266.3MB in the end (delta: 115.3MB). Free memory was 124.4MB in the beginning and 124.8MB in the end (delta: -403.9kB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. [2022-10-16 12:02:12,775 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory was 120.9MB in the beginning and 120.8MB in the end (delta: 88.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:02:12,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.51ms. Allocated memory is still 151.0MB. Free memory was 124.2MB in the beginning and 96.7MB in the end (delta: 27.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-10-16 12:02:12,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 215.00ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 125.5MB in the end (delta: -28.9MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2022-10-16 12:02:12,776 INFO L158 Benchmark]: Boogie Preprocessor took 166.37ms. Allocated memory is still 151.0MB. Free memory was 125.0MB in the beginning and 117.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-10-16 12:02:12,779 INFO L158 Benchmark]: RCFGBuilder took 2108.22ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 117.7MB in the beginning and 93.8MB in the end (delta: 23.8MB). Peak memory consumption was 78.4MB. Max. memory is 8.0GB. [2022-10-16 12:02:12,779 INFO L158 Benchmark]: TraceAbstraction took 4589.26ms. Allocated memory was 192.9MB in the beginning and 266.3MB in the end (delta: 73.4MB). Free memory was 93.3MB in the beginning and 124.8MB in the end (delta: -31.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2022-10-16 12:02:12,781 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory was 120.9MB in the beginning and 120.8MB in the end (delta: 88.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 794.51ms. Allocated memory is still 151.0MB. Free memory was 124.2MB in the beginning and 96.7MB in the end (delta: 27.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 215.00ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 125.5MB in the end (delta: -28.9MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 166.37ms. Allocated memory is still 151.0MB. Free memory was 125.0MB in the beginning and 117.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2108.22ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 117.7MB in the beginning and 93.8MB in the end (delta: 23.8MB). Peak memory consumption was 78.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4589.26ms. Allocated memory was 192.9MB in the beginning and 266.3MB in the end (delta: 73.4MB). Free memory was 93.3MB in the beginning and 124.8MB in the end (delta: -31.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * 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: 437]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of to_int at line 433, overapproximation of someUnaryDOUBLEoperation at line 507, overapproximation of bitwiseAnd at line 155, overapproximation of to_real at line 434, overapproximation of someUnaryFLOAToperation at line 624, overapproximation of someBinaryArithmeticFLOAToperation at line 435. Possible FailurePath: [L13] static const float huge_floor = 1.0e30; [L90-L92] static const float two25_scalbn = 3.355443200e+07, twom25_scalbn = 2.9802322388e-08, huge_scalbn = 1.0e+30, tiny_scalbn = 1.0e-30; [L165] static const int init_jk_krempio[] = {4, 7, 9}; [L167-L171] static const float PIo2_krempio[] = { 1.5703125000e+00, 4.5776367188e-04, 2.5987625122e-05, 7.5437128544e-08, 6.0026650317e-11, 7.3896444519e-13, 5.3845816694e-15, 5.6378512969e-18, 8.3009228831e-20, 3.2756352257e-22, 6.3331015649e-25, }; [L173-L175] static const float zero_krempio = 0.0, one_krempio = 1.0, two8_krempio = 2.5600000000e+02, twon8_krempio = 3.9062500000e-03; [L350-L368] static const __int32_t two_over_pi_rempio[] = { 0xA2, 0xF9, 0x83, 0x6E, 0x4E, 0x44, 0x15, 0x29, 0xFC, 0x27, 0x57, 0xD1, 0xF5, 0x34, 0xDD, 0xC0, 0xDB, 0x62, 0x95, 0x99, 0x3C, 0x43, 0x90, 0x41, 0xFE, 0x51, 0x63, 0xAB, 0xDE, 0xBB, 0xC5, 0x61, 0xB7, 0x24, 0x6E, 0x3A, 0x42, 0x4D, 0xD2, 0xE0, 0x06, 0x49, 0x2E, 0xEA, 0x09, 0xD1, 0x92, 0x1C, 0xFE, 0x1D, 0xEB, 0x1C, 0xB1, 0x29, 0xA7, 0x3E, 0xE8, 0x82, 0x35, 0xF5, 0x2E, 0xBB, 0x44, 0x84, 0xE9, 0x9C, 0x70, 0x26, 0xB4, 0x5F, 0x7E, 0x41, 0x39, 0x91, 0xD6, 0x39, 0x83, 0x53, 0x39, 0xF4, 0x9C, 0x84, 0x5F, 0x8B, 0xBD, 0xF9, 0x28, 0x3B, 0x1F, 0xF8, 0x97, 0xFF, 0xDE, 0x05, 0x98, 0x0F, 0xEF, 0x2F, 0x11, 0x8B, 0x5A, 0x0A, 0x6D, 0x1F, 0x6D, 0x36, 0x7E, 0xCF, 0x27, 0xCB, 0x09, 0xB7, 0x4F, 0x46, 0x3F, 0x66, 0x9E, 0x5F, 0xEA, 0x2D, 0x75, 0x27, 0xBA, 0xC7, 0xEB, 0xE5, 0xF1, 0x7B, 0x3D, 0x07, 0x39, 0xF7, 0x8A, 0x52, 0x92, 0xEA, 0x6B, 0xFB, 0x5F, 0xB1, 0x1F, 0x8D, 0x5D, 0x08, 0x56, 0x03, 0x30, 0x46, 0xFC, 0x7B, 0x6B, 0xAB, 0xF0, 0xCF, 0xBC, 0x20, 0x9A, 0xF4, 0x36, 0x1D, 0xA9, 0xE3, 0x91, 0x61, 0x5E, 0xE6, 0x1B, 0x08, 0x65, 0x99, 0x85, 0x5F, 0x14, 0xA0, 0x68, 0x40, 0x8D, 0xFF, 0xD8, 0x80, 0x4D, 0x73, 0x27, 0x31, 0x06, 0x06, 0x15, 0x56, 0xCA, 0x73, 0xA8, 0xC9, 0x60, 0xE2, 0x7B, 0xC0, 0x8C, 0x6B, }; [L370-L376] static const __int32_t npio2_hw_rempio[] = { 0x3fc90f00, 0x40490f00, 0x4096cb00, 0x40c90f00, 0x40fb5300, 0x4116cb00, 0x412fed00, 0x41490f00, 0x41623100, 0x417b5300, 0x418a3a00, 0x4196cb00, 0x41a35c00, 0x41afed00, 0x41bc7e00, 0x41c90f00, 0x41d5a000, 0x41e23100, 0x41eec200, 0x41fb5300, 0x4203f200, 0x420a3a00, 0x42108300, 0x4216cb00, 0x421d1400, 0x42235c00, 0x4229a500, 0x422fed00, 0x42363600, 0x423c7e00, 0x4242c700, 0x42490f00}; [L378-L387] static const float zero_rempio = 0.0000000000e+00, half_rempio = 5.0000000000e-01, two8_rempio = 2.5600000000e+02, invpio2_rempio = 6.3661980629e-01, pio2_1_rempio = 1.5707855225e+00, pio2_1t_rempio = 1.0804334124e-05, pio2_2_rempio = 1.0804273188e-05, pio2_2t_rempio = 6.0770999344e-11, pio2_3_rempio = 6.0770943833e-11, pio2_3t_rempio = 6.1232342629e-17; [L507-L510] static const float half_ksin = 5.0000000000e-01, S1_ksin = -1.6666667163e-01, S2_ksin = 8.3333337680e-03, S3_ksin = -1.9841270114e-04, S4_ksin = 2.7557314297e-06, S5_ksin = -2.5050759689e-08, S6_ksin = 1.5896910177e-10; [L534-L537] static const float one_kcos = 1.0000000000e+00, C1_kcos = 4.1666667908e-02, C2_kcos = -1.3888889225e-03, C3_kcos = 2.4801587642e-05, C4_kcos = -2.7557314297e-07, C5_kcos = 2.0875723372e-09, C6_kcos = -1.1359647598e-11; [L574-L582] static const float one_ktan = 1.0000000000e+00, pio4_ktan = 7.8539812565e-01, pio4lo_ktan = 3.7748947079e-08, T_ktan[] = { 3.3333334327e-01, 1.3333334029e-01, 5.3968254477e-02, 2.1869488060e-02, 8.8632395491e-03, 3.5920790397e-03, 1.4562094584e-03, 5.8804126456e-04, 2.4646313977e-04, 7.8179444245e-05, 7.1407252108e-05, -1.8558637748e-05, 2.5907305826e-05, }; VAL [C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, zero_krempio=0, zero_rempio=0] [L624] float x = -0.0f; [L625] CALL sin_float(x) [L585] float y[2], z = 0.0; [L586] __int32_t n, ix; VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000025, y={14:0}, z=0, zero_krempio=0, zero_rempio=0] [L589] ieee_float_shape_type gf_u; [L590] gf_u.value = (x) [L591] EXPR gf_u.word [L591] (ix) = gf_u.word [L594] ix &= 0x7fffffff VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1061752793, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000025, y={14:0}, z=0, zero_krempio=0, zero_rempio=0] [L595] COND FALSE !(ix <= 0x3f490fd8) VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1061752793, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000025, y={14:0}, z=0, zero_krempio=0, zero_rempio=0] [L598] COND FALSE !(!((ix) < 0x7f800000L)) [L602] CALL __ieee754_rem_pio2f(x, y) [L390] float z, w, t, r, fn; [L391] float tx[3]; [L392] __int32_t i, j, n, ix, hx; [L393] int e0, nx; VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={19:0}, x=1000000000000000000000000000025, y={14:0}, y={14:0}, zero_krempio=0, zero_rempio=0] [L396] ieee_float_shape_type gf_u; [L397] gf_u.value = (x) [L398] EXPR gf_u.word [L398] (hx) = gf_u.word [L400] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={19:0}, x=1000000000000000000000000000025, y={14:0}, y={14:0}, zero_krempio=0, zero_rempio=0] [L401] COND FALSE !(ix <= 0x3f490fd8) VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={19:0}, x=1000000000000000000000000000025, y={14:0}, y={14:0}, zero_krempio=0, zero_rempio=0] [L406] COND FALSE !(ix < 0x4016cbe4) VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={19:0}, x=1000000000000000000000000000025, y={14:0}, y={14:0}, zero_krempio=0, zero_rempio=0] [L431] COND TRUE ix <= 0x43490f80 [L432] CALL, EXPR fabs_float(x) [L147] __uint32_t ix; VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000025, zero_krempio=0, zero_rempio=0] [L149] ieee_float_shape_type gf_u; [L150] gf_u.value = (x) [L151] EXPR gf_u.word [L151] (ix) = gf_u.word [L154] ieee_float_shape_type sf_u; [L155] sf_u.word = (ix & 0x7fffffff) [L156] EXPR sf_u.value [L156] (x) = sf_u.value [L158] return x; VAL [\old(x)=1000000000000000000000000000025, \result=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1073741825, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000023, zero_krempio=0, zero_rempio=0] [L432] RET, EXPR fabs_float(x) [L432] t = fabs_float(x) [L433] n = (__int32_t)(t * invpio2_rempio + half_rempio) [L434] fn = (float)n [L435] r = t - fn * pio2_1_rempio [L436] w = fn * pio2_1t_rempio [L437] n < 32 && (ix & 0xffffff00) != npio2_hw_rempio[n - 1] VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, n=-2147483648, n < 32 && (ix & 0xffffff00) != npio2_hw_rempio[n - 1]=1, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, t=1000000000000000000000000000023, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={19:0}, x=1000000000000000000000000000025, y={14:0}, y={14:0}, zero_krempio=0, zero_rempio=0] [L437] n - 1 VAL [\old(x)=1000000000000000000000000000025, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, n=-2147483648, n < 32 && (ix & 0xffffff00) != npio2_hw_rempio[n - 1]=1, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, one_ktan=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=15707962513/20000000000, pio4lo_ktan=37748947079/1000000000000000000, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, t=1000000000000000000000000000023, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={19:0}, x=1000000000000000000000000000025, y={14:0}, y={14:0}, zero_krempio=0, zero_rempio=0] - UnprovableResult [Line: 564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 437]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 474]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 474]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 484]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 484]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 487]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 487]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 487]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 487]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 490]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 490]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 496]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 496]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 185]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 185]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 189]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 189]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 189]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 189]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 189]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 189]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 191]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 191]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 192]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 192]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 193]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 193]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 193]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 193]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 197]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 197]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 196]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 196]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 208]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 208]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 205]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 205]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 205]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 205]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 217]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 217]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 217]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 217]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 218]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 218]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 220]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 220]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 220]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 220]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 222]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 222]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 227]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 227]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 234]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 234]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 237]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 237]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 229]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 229]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 258]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 258]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 258]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 258]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 261]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 261]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 261]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 261]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 264]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 264]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 264]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 264]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 265]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 265]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 265]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 265]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 267]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 267]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 267]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 267]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 266]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 266]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 264]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 264]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 270]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 270]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 276]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 276]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 277]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 277]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 279]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 279]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 280]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 280]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 283]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 283]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 287]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 287]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 288]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 288]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 301]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 301]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 302]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 302]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 301]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 301]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 303]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 303]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 300]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 300]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 316]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 316]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 326]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 326]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 327]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 327]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 328]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 328]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 331]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 331]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 332]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 332]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 333]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 333]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 330]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 330]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 335]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 335]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 502]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 502]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 140]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 140]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 596 locations, 174 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4497 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4485 mSDsluCounter, 11203 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4704 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 6499 mSDtfsCounter, 275 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=596occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 70 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 [2022-10-16 12:02:12,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...