/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_0550b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:02:28,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:02:28,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:02:28,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:02:28,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:02:28,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:02:28,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:02:28,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:02:28,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:02:28,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:02:28,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:02:28,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:02:28,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:02:28,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:02:28,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:02:28,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:02:28,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:02:28,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:02:28,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:02:28,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:02:28,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:02:28,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:02:28,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:02:28,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:02:28,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:02:28,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:02:28,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:02:28,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:02:28,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:02:28,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:02:28,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:02:28,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:02:28,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:02:28,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:02:28,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:02:28,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:02:28,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:02:28,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:02:28,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:02:28,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:02:28,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:02:28,594 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:28,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:02:28,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:02:28,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:02:28,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:02:28,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:02:28,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:02:28,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:02:28,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:02:28,638 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:02:28,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:02:28,638 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:02:28,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:02:28,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:02:28,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:02:28,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:02:28,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:02:28,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:02:28,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:02:28,641 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:02:28,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:02:28,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:02:28,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:02:28,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:02:28,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:02:28,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:02:28,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:02:28,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:02:28,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:02:28,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:02:28,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:02:28,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:02:28,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:02:28,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:02:28,645 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:29,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:02:29,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:02:29,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:02:29,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:02:29,074 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:02:29,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0550b.c [2022-10-16 12:02:29,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c749e35d1/1639ee71500f4b27be5ba430521e5800/FLAG366d1c383 [2022-10-16 12:02:29,974 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:02:29,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0550b.c [2022-10-16 12:02:29,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c749e35d1/1639ee71500f4b27be5ba430521e5800/FLAG366d1c383 [2022-10-16 12:02:30,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c749e35d1/1639ee71500f4b27be5ba430521e5800 [2022-10-16 12:02:30,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:02:30,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:02:30,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:02:30,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:02:30,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:02:30,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:30" (1/1) ... [2022-10-16 12:02:30,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456b17aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:30, skipping insertion in model container [2022-10-16 12:02:30,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:30" (1/1) ... [2022-10-16 12:02:30,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:02:30,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:02:30,703 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_0550b.c[15673,15686] [2022-10-16 12:02:30,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:02:30,765 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:02:30,918 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_0550b.c[15673,15686] [2022-10-16 12:02:30,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:02:30,961 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:02:30,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:30 WrapperNode [2022-10-16 12:02:30,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:02:30,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:02:30,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:02:30,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:02:30,972 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:30" (1/1) ... [2022-10-16 12:02:31,023 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:30" (1/1) ... [2022-10-16 12:02:31,112 INFO L138 Inliner]: procedures = 26, calls = 519, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 1232 [2022-10-16 12:02:31,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:02:31,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:02:31,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:02:31,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:02:31,135 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:30" (1/1) ... [2022-10-16 12:02:31,136 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:30" (1/1) ... [2022-10-16 12:02:31,147 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:30" (1/1) ... [2022-10-16 12:02:31,148 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:30" (1/1) ... [2022-10-16 12:02:31,221 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:30" (1/1) ... [2022-10-16 12:02:31,237 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:30" (1/1) ... [2022-10-16 12:02:31,245 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:30" (1/1) ... [2022-10-16 12:02:31,253 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:30" (1/1) ... [2022-10-16 12:02:31,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:02:31,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:02:31,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:02:31,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:02:31,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:30" (1/1) ... [2022-10-16 12:02:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:02:31,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:02:31,305 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:31,310 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:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:02:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:02:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 12:02:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:02:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-10-16 12:02:31,388 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-10-16 12:02:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 12:02:31,390 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_float [2022-10-16 12:02:31,391 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_float [2022-10-16 12:02:31,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:02:31,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-16 12:02:31,391 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_float [2022-10-16 12:02:31,392 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_float [2022-10-16 12:02:31,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:02:31,392 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_tanf [2022-10-16 12:02:31,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_tanf [2022-10-16 12:02:31,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:02:31,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:02:31,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:02:31,610 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:02:31,613 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:02:33,363 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:02:33,385 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:02:33,385 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-10-16 12:02:33,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:33 BoogieIcfgContainer [2022-10-16 12:02:33,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:02:33,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:02:33,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:02:33,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:02:33,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:02:30" (1/3) ... [2022-10-16 12:02:33,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ab331a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:33, skipping insertion in model container [2022-10-16 12:02:33,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:30" (2/3) ... [2022-10-16 12:02:33,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ab331a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:33, skipping insertion in model container [2022-10-16 12:02:33,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:33" (3/3) ... [2022-10-16 12:02:33,403 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0550b.c [2022-10-16 12:02:33,462 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:02:33,463 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 180 error locations. [2022-10-16 12:02:33,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:02:33,557 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;@6d8adb28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:02:33,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 180 error locations. [2022-10-16 12:02:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 605 states, 409 states have (on average 1.8386308068459658) internal successors, (752), 589 states have internal predecessors, (752), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-16 12:02:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:02:33,575 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:33,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:33,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash -982666665, now seen corresponding path program 1 times [2022-10-16 12:02:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:33,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676890995] [2022-10-16 12:02:33,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:33,976 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:33,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:33,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676890995] [2022-10-16 12:02:33,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676890995] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:33,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:33,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564673123] [2022-10-16 12:02:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:33,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:02:33,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:02:34,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:02:34,052 INFO L87 Difference]: Start difference. First operand has 605 states, 409 states have (on average 1.8386308068459658) internal successors, (752), 589 states have internal predecessors, (752), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:34,183 INFO L93 Difference]: Finished difference Result 1208 states and 1557 transitions. [2022-10-16 12:02:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:02:34,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 12 [2022-10-16 12:02:34,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:34,222 INFO L225 Difference]: With dead ends: 1208 [2022-10-16 12:02:34,222 INFO L226 Difference]: Without dead ends: 579 [2022-10-16 12:02:34,232 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:34,236 INFO L413 NwaCegarLoop]: 704 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, 704 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:34,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 704 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:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-10-16 12:02:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2022-10-16 12:02:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 386 states have (on average 1.689119170984456) internal successors, (652), 566 states have internal predecessors, (652), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 670 transitions. [2022-10-16 12:02:34,325 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 670 transitions. Word has length 12 [2022-10-16 12:02:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:34,325 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 670 transitions. [2022-10-16 12:02:34,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 670 transitions. [2022-10-16 12:02:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 12:02:34,327 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:34,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:34,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:02:34,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash 611210815, now seen corresponding path program 1 times [2022-10-16 12:02:34,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:34,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117067110] [2022-10-16 12:02:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:34,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:34,685 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:34,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:34,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117067110] [2022-10-16 12:02:34,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117067110] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:34,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:34,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:34,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342979945] [2022-10-16 12:02:34,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:34,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:34,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:34,691 INFO L87 Difference]: Start difference. First operand 579 states and 670 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:34,762 INFO L93 Difference]: Finished difference Result 601 states and 696 transitions. [2022-10-16 12:02:34,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2022-10-16 12:02:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:34,767 INFO L225 Difference]: With dead ends: 601 [2022-10-16 12:02:34,768 INFO L226 Difference]: Without dead ends: 597 [2022-10-16 12:02:34,768 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:34,770 INFO L413 NwaCegarLoop]: 668 mSDtfsCounter, 42 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:34,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2001 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-10-16 12:02:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 588. [2022-10-16 12:02:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 395 states have (on average 1.6810126582278482) internal successors, (664), 574 states have internal predecessors, (664), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 682 transitions. [2022-10-16 12:02:34,806 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 682 transitions. Word has length 14 [2022-10-16 12:02:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:34,806 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 682 transitions. [2022-10-16 12:02:34,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 682 transitions. [2022-10-16 12:02:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 12:02:34,808 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:34,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:34,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:02:34,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash -420340178, now seen corresponding path program 1 times [2022-10-16 12:02:34,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:34,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259997114] [2022-10-16 12:02:34,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:34,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:35,071 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:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:35,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259997114] [2022-10-16 12:02:35,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259997114] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:35,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:35,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691817999] [2022-10-16 12:02:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:35,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:35,075 INFO L87 Difference]: Start difference. First operand 588 states and 682 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:35,139 INFO L93 Difference]: Finished difference Result 598 states and 692 transitions. [2022-10-16 12:02:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:35,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:35,151 INFO L225 Difference]: With dead ends: 598 [2022-10-16 12:02:35,151 INFO L226 Difference]: Without dead ends: 594 [2022-10-16 12:02:35,152 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:35,154 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 9 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:35,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1983 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-10-16 12:02:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 593. [2022-10-16 12:02:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 400 states have (on average 1.6725) internal successors, (669), 579 states have internal predecessors, (669), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 687 transitions. [2022-10-16 12:02:35,183 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 687 transitions. Word has length 13 [2022-10-16 12:02:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:35,184 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 687 transitions. [2022-10-16 12:02:35,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 687 transitions. [2022-10-16 12:02:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:02:35,185 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:35,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:35,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:02:35,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:35,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1014665928, now seen corresponding path program 1 times [2022-10-16 12:02:35,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:35,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589522484] [2022-10-16 12:02:35,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:35,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:35,331 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:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:35,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589522484] [2022-10-16 12:02:35,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589522484] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:35,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:35,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:35,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176178754] [2022-10-16 12:02:35,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:35,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:35,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:35,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:35,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:35,334 INFO L87 Difference]: Start difference. First operand 593 states and 687 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:35,366 INFO L93 Difference]: Finished difference Result 613 states and 711 transitions. [2022-10-16 12:02:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:35,367 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), 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 16 [2022-10-16 12:02:35,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:35,371 INFO L225 Difference]: With dead ends: 613 [2022-10-16 12:02:35,371 INFO L226 Difference]: Without dead ends: 599 [2022-10-16 12:02:35,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:35,384 INFO L413 NwaCegarLoop]: 668 mSDtfsCounter, 8 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:35,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1329 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-10-16 12:02:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 595. [2022-10-16 12:02:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 402 states have (on average 1.6666666666666667) internal successors, (670), 581 states have internal predecessors, (670), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 688 transitions. [2022-10-16 12:02:35,411 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 688 transitions. Word has length 16 [2022-10-16 12:02:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:35,412 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 688 transitions. [2022-10-16 12:02:35,412 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), 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:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 688 transitions. [2022-10-16 12:02:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:02:35,414 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:35,414 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:35,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:02:35,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash -246936394, now seen corresponding path program 1 times [2022-10-16 12:02:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:35,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785115013] [2022-10-16 12:02:35,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:35,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:35,602 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:35,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:35,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785115013] [2022-10-16 12:02:35,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785115013] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:35,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:35,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:35,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745088562] [2022-10-16 12:02:35,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:35,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:35,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:35,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:35,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:35,605 INFO L87 Difference]: Start difference. First operand 595 states and 688 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:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:35,668 INFO L93 Difference]: Finished difference Result 1173 states and 1354 transitions. [2022-10-16 12:02:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:35,669 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:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:35,673 INFO L225 Difference]: With dead ends: 1173 [2022-10-16 12:02:35,674 INFO L226 Difference]: Without dead ends: 602 [2022-10-16 12:02:35,692 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:35,694 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 6 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1313 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:35,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1313 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:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-10-16 12:02:35,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2022-10-16 12:02:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 403 states have (on average 1.6650124069478909) internal successors, (671), 582 states have internal predecessors, (671), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 689 transitions. [2022-10-16 12:02:35,715 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 689 transitions. Word has length 15 [2022-10-16 12:02:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:35,715 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 689 transitions. [2022-10-16 12:02:35,715 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:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 689 transitions. [2022-10-16 12:02:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 12:02:35,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:35,717 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:35,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:02:35,717 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:35,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1871580814, now seen corresponding path program 1 times [2022-10-16 12:02:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:35,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9825111] [2022-10-16 12:02:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:35,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:35,822 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:35,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:35,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9825111] [2022-10-16 12:02:35,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9825111] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:35,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:35,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493666644] [2022-10-16 12:02:35,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:35,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:35,826 INFO L87 Difference]: Start difference. First operand 596 states and 689 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:35,852 INFO L93 Difference]: Finished difference Result 607 states and 701 transitions. [2022-10-16 12:02:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:35,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2022-10-16 12:02:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:35,857 INFO L225 Difference]: With dead ends: 607 [2022-10-16 12:02:35,857 INFO L226 Difference]: Without dead ends: 595 [2022-10-16 12:02:35,858 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:35,859 INFO L413 NwaCegarLoop]: 670 mSDtfsCounter, 5 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:35,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1326 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-10-16 12:02:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 594. [2022-10-16 12:02:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 401 states have (on average 1.660847880299252) internal successors, (666), 580 states have internal predecessors, (666), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 684 transitions. [2022-10-16 12:02:35,880 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 684 transitions. Word has length 19 [2022-10-16 12:02:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:35,880 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 684 transitions. [2022-10-16 12:02:35,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 684 transitions. [2022-10-16 12:02:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 12:02:35,881 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:35,882 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:35,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:02:35,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:35,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash -354639729, now seen corresponding path program 1 times [2022-10-16 12:02:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:35,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384566920] [2022-10-16 12:02:35,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:36,000 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:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:36,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384566920] [2022-10-16 12:02:36,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384566920] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:36,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:36,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230570080] [2022-10-16 12:02:36,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:36,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:36,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:36,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:36,003 INFO L87 Difference]: Start difference. First operand 594 states and 684 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:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:36,062 INFO L93 Difference]: Finished difference Result 600 states and 690 transitions. [2022-10-16 12:02:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:36,062 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:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:36,067 INFO L225 Difference]: With dead ends: 600 [2022-10-16 12:02:36,067 INFO L226 Difference]: Without dead ends: 599 [2022-10-16 12:02:36,068 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:36,069 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 528 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 781 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:36,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 781 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:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-10-16 12:02:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 593. [2022-10-16 12:02:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 401 states have (on average 1.658354114713217) internal successors, (665), 579 states have internal predecessors, (665), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 683 transitions. [2022-10-16 12:02:36,089 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 683 transitions. Word has length 18 [2022-10-16 12:02:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:36,090 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 683 transitions. [2022-10-16 12:02:36,090 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:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 683 transitions. [2022-10-16 12:02:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 12:02:36,091 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:36,091 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:36,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:02:36,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1891070686, now seen corresponding path program 1 times [2022-10-16 12:02:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:36,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130769905] [2022-10-16 12:02:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:36,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:36,212 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:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:36,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130769905] [2022-10-16 12:02:36,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130769905] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:36,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:36,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:36,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622062875] [2022-10-16 12:02:36,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:36,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:36,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:36,215 INFO L87 Difference]: Start difference. First operand 593 states and 683 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:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:36,300 INFO L93 Difference]: Finished difference Result 608 states and 698 transitions. [2022-10-16 12:02:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:36,301 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:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:36,306 INFO L225 Difference]: With dead ends: 608 [2022-10-16 12:02:36,307 INFO L226 Difference]: Without dead ends: 607 [2022-10-16 12:02:36,309 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:36,312 INFO L413 NwaCegarLoop]: 668 mSDtfsCounter, 986 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:36,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 830 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:02:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-10-16 12:02:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 592. [2022-10-16 12:02:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 401 states have (on average 1.655860349127182) internal successors, (664), 578 states have internal predecessors, (664), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 682 transitions. [2022-10-16 12:02:36,339 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 682 transitions. Word has length 19 [2022-10-16 12:02:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:36,339 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 682 transitions. [2022-10-16 12:02:36,339 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:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 682 transitions. [2022-10-16 12:02:36,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 12:02:36,343 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:36,344 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:36,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:02:36,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash 736875511, now seen corresponding path program 1 times [2022-10-16 12:02:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:36,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234042133] [2022-10-16 12:02:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:36,511 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:36,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:36,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234042133] [2022-10-16 12:02:36,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234042133] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:36,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:36,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212168113] [2022-10-16 12:02:36,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:36,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:36,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:36,516 INFO L87 Difference]: Start difference. First operand 592 states and 682 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:36,553 INFO L93 Difference]: Finished difference Result 615 states and 704 transitions. [2022-10-16 12:02:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2022-10-16 12:02:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:36,560 INFO L225 Difference]: With dead ends: 615 [2022-10-16 12:02:36,561 INFO L226 Difference]: Without dead ends: 608 [2022-10-16 12:02:36,561 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:36,564 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 12 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:36,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1317 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-10-16 12:02:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2022-10-16 12:02:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 405 states have (on average 1.651851851851852) internal successors, (669), 582 states have internal predecessors, (669), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 687 transitions. [2022-10-16 12:02:36,586 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 687 transitions. Word has length 21 [2022-10-16 12:02:36,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:36,588 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 687 transitions. [2022-10-16 12:02:36,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 687 transitions. [2022-10-16 12:02:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 12:02:36,590 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:36,590 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:36,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:02:36,590 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 738722553, now seen corresponding path program 1 times [2022-10-16 12:02:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:36,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657911593] [2022-10-16 12:02:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:37,196 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:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:37,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657911593] [2022-10-16 12:02:37,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657911593] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:37,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:37,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:37,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207337752] [2022-10-16 12:02:37,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:37,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:37,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:37,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:37,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:37,199 INFO L87 Difference]: Start difference. First operand 596 states and 687 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:37,239 INFO L93 Difference]: Finished difference Result 608 states and 697 transitions. [2022-10-16 12:02:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:37,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 21 [2022-10-16 12:02:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:37,244 INFO L225 Difference]: With dead ends: 608 [2022-10-16 12:02:37,244 INFO L226 Difference]: Without dead ends: 598 [2022-10-16 12:02:37,245 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:37,246 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 36 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:37,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1312 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-10-16 12:02:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 592. [2022-10-16 12:02:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 401 states have (on average 1.6508728179551122) internal successors, (662), 578 states have internal predecessors, (662), 10 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-16 12:02:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 680 transitions. [2022-10-16 12:02:37,271 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 680 transitions. Word has length 21 [2022-10-16 12:02:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:37,272 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 680 transitions. [2022-10-16 12:02:37,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 680 transitions. [2022-10-16 12:02:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 12:02:37,274 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:37,274 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:37,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 12:02:37,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 177 more)] === [2022-10-16 12:02:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash -72471115, now seen corresponding path program 1 times [2022-10-16 12:02:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:37,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980012778] [2022-10-16 12:02:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:02:37,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:02:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:02:37,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:02:37,523 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:02:37,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __kernel_tanfErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (179 of 180 remaining) [2022-10-16 12:02:37,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (178 of 180 remaining) [2022-10-16 12:02:37,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (177 of 180 remaining) [2022-10-16 12:02:37,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanfErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (176 of 180 remaining) [2022-10-16 12:02:37,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (175 of 180 remaining) [2022-10-16 12:02:37,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (174 of 180 remaining) [2022-10-16 12:02:37,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 180 remaining) [2022-10-16 12:02:37,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 180 remaining) [2022-10-16 12:02:37,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 180 remaining) [2022-10-16 12:02:37,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 180 remaining) [2022-10-16 12:02:37,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 180 remaining) [2022-10-16 12:02:37,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 180 remaining) [2022-10-16 12:02:37,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 180 remaining) [2022-10-16 12:02:37,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 180 remaining) [2022-10-16 12:02:37,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 180 remaining) [2022-10-16 12:02:37,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 180 remaining) [2022-10-16 12:02:37,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 180 remaining) [2022-10-16 12:02:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 180 remaining) [2022-10-16 12:02:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 180 remaining) [2022-10-16 12:02:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 180 remaining) [2022-10-16 12:02:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 180 remaining) [2022-10-16 12:02:37,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 180 remaining) [2022-10-16 12:02:37,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 180 remaining) [2022-10-16 12:02:37,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 180 remaining) [2022-10-16 12:02:37,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 180 remaining) [2022-10-16 12:02:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 180 remaining) [2022-10-16 12:02:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 180 remaining) [2022-10-16 12:02:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 180 remaining) [2022-10-16 12:02:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 180 remaining) [2022-10-16 12:02:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 180 remaining) [2022-10-16 12:02:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 180 remaining) [2022-10-16 12:02:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 180 remaining) [2022-10-16 12:02:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 180 remaining) [2022-10-16 12:02:37,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 180 remaining) [2022-10-16 12:02:37,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 180 remaining) [2022-10-16 12:02:37,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 180 remaining) [2022-10-16 12:02:37,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 180 remaining) [2022-10-16 12:02:37,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 180 remaining) [2022-10-16 12:02:37,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 180 remaining) [2022-10-16 12:02:37,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 180 remaining) [2022-10-16 12:02:37,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 180 remaining) [2022-10-16 12:02:37,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 180 remaining) [2022-10-16 12:02:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 180 remaining) [2022-10-16 12:02:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 180 remaining) [2022-10-16 12:02:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 180 remaining) [2022-10-16 12:02:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 180 remaining) [2022-10-16 12:02:37,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 180 remaining) [2022-10-16 12:02:37,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 180 remaining) [2022-10-16 12:02:37,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 180 remaining) [2022-10-16 12:02:37,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 180 remaining) [2022-10-16 12:02:37,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 180 remaining) [2022-10-16 12:02:37,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 180 remaining) [2022-10-16 12:02:37,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 180 remaining) [2022-10-16 12:02:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 180 remaining) [2022-10-16 12:02:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 180 remaining) [2022-10-16 12:02:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 180 remaining) [2022-10-16 12:02:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 180 remaining) [2022-10-16 12:02:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 180 remaining) [2022-10-16 12:02:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 180 remaining) [2022-10-16 12:02:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 180 remaining) [2022-10-16 12:02:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 180 remaining) [2022-10-16 12:02:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 180 remaining) [2022-10-16 12:02:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 180 remaining) [2022-10-16 12:02:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 180 remaining) [2022-10-16 12:02:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 180 remaining) [2022-10-16 12:02:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 180 remaining) [2022-10-16 12:02:37,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 180 remaining) [2022-10-16 12:02:37,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 180 remaining) [2022-10-16 12:02:37,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 180 remaining) [2022-10-16 12:02:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 180 remaining) [2022-10-16 12:02:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 180 remaining) [2022-10-16 12:02:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 180 remaining) [2022-10-16 12:02:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 180 remaining) [2022-10-16 12:02:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 180 remaining) [2022-10-16 12:02:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 180 remaining) [2022-10-16 12:02:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 180 remaining) [2022-10-16 12:02:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 180 remaining) [2022-10-16 12:02:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 180 remaining) [2022-10-16 12:02:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 180 remaining) [2022-10-16 12:02:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 180 remaining) [2022-10-16 12:02:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 180 remaining) [2022-10-16 12:02:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 180 remaining) [2022-10-16 12:02:37,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 180 remaining) [2022-10-16 12:02:37,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 180 remaining) [2022-10-16 12:02:37,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 180 remaining) [2022-10-16 12:02:37,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 180 remaining) [2022-10-16 12:02:37,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 180 remaining) [2022-10-16 12:02:37,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 180 remaining) [2022-10-16 12:02:37,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 180 remaining) [2022-10-16 12:02:37,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 180 remaining) [2022-10-16 12:02:37,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 180 remaining) [2022-10-16 12:02:37,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 180 remaining) [2022-10-16 12:02:37,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 180 remaining) [2022-10-16 12:02:37,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 180 remaining) [2022-10-16 12:02:37,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 180 remaining) [2022-10-16 12:02:37,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 180 remaining) [2022-10-16 12:02:37,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 180 remaining) [2022-10-16 12:02:37,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 180 remaining) [2022-10-16 12:02:37,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 180 remaining) [2022-10-16 12:02:37,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 180 remaining) [2022-10-16 12:02:37,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 180 remaining) [2022-10-16 12:02:37,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 180 remaining) [2022-10-16 12:02:37,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 180 remaining) [2022-10-16 12:02:37,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 180 remaining) [2022-10-16 12:02:37,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 180 remaining) [2022-10-16 12:02:37,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 180 remaining) [2022-10-16 12:02:37,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 180 remaining) [2022-10-16 12:02:37,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 180 remaining) [2022-10-16 12:02:37,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 180 remaining) [2022-10-16 12:02:37,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 180 remaining) [2022-10-16 12:02:37,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 180 remaining) [2022-10-16 12:02:37,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 180 remaining) [2022-10-16 12:02:37,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 180 remaining) [2022-10-16 12:02:37,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 180 remaining) [2022-10-16 12:02:37,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 180 remaining) [2022-10-16 12:02:37,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 180 remaining) [2022-10-16 12:02:37,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 180 remaining) [2022-10-16 12:02:37,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 180 remaining) [2022-10-16 12:02:37,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 180 remaining) [2022-10-16 12:02:37,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 180 remaining) [2022-10-16 12:02:37,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 180 remaining) [2022-10-16 12:02:37,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 180 remaining) [2022-10-16 12:02:37,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 180 remaining) [2022-10-16 12:02:37,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 180 remaining) [2022-10-16 12:02:37,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 180 remaining) [2022-10-16 12:02:37,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 180 remaining) [2022-10-16 12:02:37,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 180 remaining) [2022-10-16 12:02:37,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 180 remaining) [2022-10-16 12:02:37,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 180 remaining) [2022-10-16 12:02:37,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 180 remaining) [2022-10-16 12:02:37,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 180 remaining) [2022-10-16 12:02:37,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 180 remaining) [2022-10-16 12:02:37,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 180 remaining) [2022-10-16 12:02:37,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 180 remaining) [2022-10-16 12:02:37,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 180 remaining) [2022-10-16 12:02:37,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 180 remaining) [2022-10-16 12:02:37,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 180 remaining) [2022-10-16 12:02:37,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 180 remaining) [2022-10-16 12:02:37,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 180 remaining) [2022-10-16 12:02:37,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 180 remaining) [2022-10-16 12:02:37,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 180 remaining) [2022-10-16 12:02:37,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 180 remaining) [2022-10-16 12:02:37,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 180 remaining) [2022-10-16 12:02:37,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 180 remaining) [2022-10-16 12:02:37,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 180 remaining) [2022-10-16 12:02:37,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 180 remaining) [2022-10-16 12:02:37,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 180 remaining) [2022-10-16 12:02:37,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 180 remaining) [2022-10-16 12:02:37,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 180 remaining) [2022-10-16 12:02:37,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 180 remaining) [2022-10-16 12:02:37,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 180 remaining) [2022-10-16 12:02:37,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 180 remaining) [2022-10-16 12:02:37,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 180 remaining) [2022-10-16 12:02:37,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 180 remaining) [2022-10-16 12:02:37,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 180 remaining) [2022-10-16 12:02:37,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 180 remaining) [2022-10-16 12:02:37,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 180 remaining) [2022-10-16 12:02:37,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 180 remaining) [2022-10-16 12:02:37,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 180 remaining) [2022-10-16 12:02:37,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 180 remaining) [2022-10-16 12:02:37,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 180 remaining) [2022-10-16 12:02:37,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 180 remaining) [2022-10-16 12:02:37,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 180 remaining) [2022-10-16 12:02:37,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 180 remaining) [2022-10-16 12:02:37,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 180 remaining) [2022-10-16 12:02:37,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 180 remaining) [2022-10-16 12:02:37,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 180 remaining) [2022-10-16 12:02:37,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 180 remaining) [2022-10-16 12:02:37,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 180 remaining) [2022-10-16 12:02:37,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 180 remaining) [2022-10-16 12:02:37,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 180 remaining) [2022-10-16 12:02:37,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 180 remaining) [2022-10-16 12:02:37,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 180 remaining) [2022-10-16 12:02:37,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 180 remaining) [2022-10-16 12:02:37,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 180 remaining) [2022-10-16 12:02:37,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 180 remaining) [2022-10-16 12:02:37,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 180 remaining) [2022-10-16 12:02:37,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 180 remaining) [2022-10-16 12:02:37,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 180 remaining) [2022-10-16 12:02:37,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 180 remaining) [2022-10-16 12:02:37,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 12:02:37,582 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:37,588 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:02:37,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:02:37 BoogieIcfgContainer [2022-10-16 12:02:37,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:02:37,677 INFO L158 Benchmark]: Toolchain (without parser) took 7494.88ms. Allocated memory was 166.7MB in the beginning and 277.9MB in the end (delta: 111.1MB). Free memory was 140.1MB in the beginning and 207.3MB in the end (delta: -67.2MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. [2022-10-16 12:02:37,678 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 166.7MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:02:37,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 773.00ms. Allocated memory is still 166.7MB. Free memory was 139.9MB in the beginning and 112.2MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-10-16 12:02:37,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.55ms. Allocated memory is still 166.7MB. Free memory was 112.2MB in the beginning and 104.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-16 12:02:37,679 INFO L158 Benchmark]: Boogie Preprocessor took 152.64ms. Allocated memory is still 166.7MB. Free memory was 104.0MB in the beginning and 96.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-16 12:02:37,679 INFO L158 Benchmark]: RCFGBuilder took 2122.40ms. Allocated memory is still 166.7MB. Free memory was 96.3MB in the beginning and 69.2MB in the end (delta: 27.0MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-10-16 12:02:37,680 INFO L158 Benchmark]: TraceAbstraction took 4281.97ms. Allocated memory was 166.7MB in the beginning and 277.9MB in the end (delta: 111.1MB). Free memory was 68.7MB in the beginning and 207.3MB in the end (delta: -138.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:02:37,684 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.23ms. Allocated memory is still 166.7MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 773.00ms. Allocated memory is still 166.7MB. Free memory was 139.9MB in the beginning and 112.2MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 149.55ms. Allocated memory is still 166.7MB. Free memory was 112.2MB in the beginning and 104.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 152.64ms. Allocated memory is still 166.7MB. Free memory was 104.0MB in the beginning and 96.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2122.40ms. Allocated memory is still 166.7MB. Free memory was 96.3MB in the beginning and 69.2MB in the end (delta: 27.0MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4281.97ms. Allocated memory was 166.7MB in the beginning and 277.9MB in the end (delta: 111.1MB). Free memory was 68.7MB in the beginning and 207.3MB in the end (delta: -138.6MB). There was no memory consumed. 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: 559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of someUnaryDOUBLEoperation at line 512, overapproximation of bitwiseAnd at line 559, overapproximation of to_real at line 558, overapproximation of someBinaryArithmeticFLOAToperation at line 543, overapproximation of someUnaryFLOAToperation at line 535. Possible FailurePath: [L14] static const float huge_floor = 1.0e30; [L94-L96] static const float two25_scalbn = 3.355443200e+07, twom25_scalbn = 2.9802322388e-08, huge_scalbn = 1.0e+30, tiny_scalbn = 1.0e-30; [L164] static const int init_jk_krempio[] = {4, 7, 9}; [L166-L170] 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, }; [L172-L174] static const float zero_krempio = 0.0, one_krempio = 1.0, two8_krempio = 2.5600000000e+02, twon8_krempio = 3.9062500000e-03; [L349-L367] 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, }; [L369-L375] 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}; [L377-L386] 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; [L506-L514] 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 [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_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, T_ktan={8:0}, 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] [L626] float x = -1.0f / 0.0f; [L627] CALL tan_float(x) [L597] float y[2], z = 0.0; [L598] __int32_t n, ix; VAL [\old(x)=1000000000000000000000000000016, 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_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, T_ktan={8:0}, 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=1000000000000000000000000000016, y={13:0}, z=0, zero_krempio=0, zero_rempio=0] [L601] ieee_float_shape_type gf_u; [L602] gf_u.value = (x) [L603] EXPR gf_u.word [L603] (ix) = gf_u.word [L606] ix &= 0x7fffffff VAL [\old(x)=1000000000000000000000000000016, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=0, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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=1000000000000000000000000000016, y={13:0}, z=0, zero_krempio=0, zero_rempio=0] [L607] COND TRUE ix <= 0x3f490fda VAL [\old(x)=1000000000000000000000000000016, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=0, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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=1000000000000000000000000000016, y={13:0}, z=0, zero_krempio=0, zero_rempio=0] [L608] CALL __kernel_tanf(x, z, 1) VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=1000000000000000000000000000001, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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] [L517] float z, r, v, w, s; [L518] __int32_t ix, hx; VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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=1000000000000000000000000000016, y=0, zero_krempio=0, zero_rempio=0] [L520] ieee_float_shape_type gf_u; [L521] gf_u.value = (x) [L522] EXPR gf_u.word [L522] (hx) = gf_u.word [L524] ix = hx & 0x7fffffff VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=-1073741824, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1059889472, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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=1000000000000000000000000000016, y=0, zero_krempio=0, zero_rempio=0] [L525] COND FALSE !(ix < 0x31800000) VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=-1073741824, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1059889472, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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=1000000000000000000000000000016, y=0, zero_krempio=0, zero_rempio=0] [L533] COND TRUE ix >= 0x3f2ca140 VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=-1073741824, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1059889472, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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=1000000000000000000000000000016, y=0, zero_krempio=0, zero_rempio=0] [L534] COND TRUE hx < 0 [L535] x = -x [L536] y = -y VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=-1073741824, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1059889472, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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] [L538] z = pio4_ktan - x [L539] w = pio4lo_ktan - y [L540] x = z + w [L541] y = 0.0 VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=-1073741824, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1059889472, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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, y=0, zero_krempio=0, zero_rempio=0] [L543] z = x * x [L544] w = z * z [L545] EXPR T_ktan[1] [L546] EXPR T_ktan[3] [L547] EXPR T_ktan[5] [L548] EXPR T_ktan[7] [L548] EXPR T_ktan[9] [L548] EXPR T_ktan[11] [L545-L548] r = T_ktan[1] + w * (T_ktan[3] + w * (T_ktan[5] + w * (T_ktan[7] + w * (T_ktan[9] + w * T_ktan[11])))) [L549] EXPR T_ktan[2] [L550] EXPR T_ktan[4] [L551] EXPR T_ktan[6] [L552] EXPR T_ktan[8] [L552] EXPR T_ktan[10] [L552] EXPR T_ktan[12] [L549-L552] v = z * (T_ktan[2] + w * (T_ktan[4] + w * (T_ktan[6] + w * (T_ktan[8] + w * (T_ktan[10] + w * T_ktan[12]))))) [L553] s = z * x [L554] r = y + z * (s * (r + v) + y) [L555] EXPR T_ktan[0] [L555] r += T_ktan[0] * s [L556] w = x + r VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=-1073741824, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1059889472, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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, y=0, zero_krempio=0, zero_rempio=0] [L557] COND TRUE ix >= 0x3f2ca140 [L558] v = (float)iy VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=-1073741824, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1059889472, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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, y=0, zero_krempio=0, zero_rempio=0] [L559] 1 - ((hx >> 30) & 2) VAL [\old(ix = hx & 0x7fffffff)=1000000000000000000000000000001, \old(iy)=1, \old(x)=1000000000000000000000000000016, \old(y)=0, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=-1073741824, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1059889472, ix = hx & 0x7fffffff=1000000000000000000000000000001, iy=1, npio2_hw_rempio={7:0}, 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, T_ktan={8:0}, 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, y=0, zero_krempio=0, zero_rempio=0] - UnprovableResult [Line: 527]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 527]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 436]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 436]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 473]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 473]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 483]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 483]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 486]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 486]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 486]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 486]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 489]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 489]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 495]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 495]: 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: 184]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 184]: 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: 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: 188]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 188]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 188]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 188]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 188]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 188]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 190]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 190]: 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: 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: 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: 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: 195]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 195]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 207]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 207]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 204]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 204]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 204]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 204]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 216]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 216]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 216]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 216]: 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: 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: 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: 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: 221]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 221]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 226]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 226]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 233]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 233]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 236]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 236]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 228]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 228]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 244]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 244]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 260]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 260]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 260]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 260]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 263]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 263]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 263]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 263]: 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: 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: 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: 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: 263]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 263]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 269]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 269]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 275]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 275]: 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: 278]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 278]: 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: 282]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 282]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 286]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 286]: 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: 294]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 294]: 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: 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: 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: 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: 299]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 299]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 315]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 315]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 319]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 319]: 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: 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: 324]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 324]: 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: 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: 329]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 329]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 334]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 334]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 501]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 501]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 615]: 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: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 130]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 130]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 144]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 144]: 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, 605 locations, 180 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1641 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1632 mSDsluCounter, 12896 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6212 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 6684 mSDtfsCounter, 150 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=605occurred in iteration=0, InterpolantAutomatonStates: 32, 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, 60 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 261 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:37,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...