./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 02:15:18,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:15:18,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:15:18,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:15:18,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:15:18,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:15:18,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:15:18,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:15:18,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:15:18,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:15:18,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:15:18,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:15:18,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:15:18,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:15:18,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:15:18,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:15:18,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:15:18,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:15:18,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:15:18,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:15:18,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:15:18,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:15:18,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:15:18,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:15:18,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:15:18,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:15:18,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:15:18,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:15:18,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:15:18,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:15:18,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:15:18,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:15:18,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:15:18,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:15:18,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:15:18,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:15:18,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:15:18,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:15:18,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:15:18,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:15:18,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:15:18,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:15:18,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-13 02:15:18,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:15:18,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:15:18,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:15:18,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:15:18,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:15:18,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:15:18,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:15:18,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:15:18,225 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:15:18,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:15:18,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:15:18,226 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:15:18,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:15:18,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:15:18,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:15:18,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:15:18,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:15:18,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:15:18,227 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:15:18,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:15:18,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:15:18,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:15:18,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:15:18,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:15:18,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:15:18,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:15:18,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:18,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:15:18,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:15:18,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:15:18,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:15:18,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:15:18,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:15:18,229 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2022-07-13 02:15:18,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:15:18,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:15:18,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:15:18,458 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:15:18,459 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:15:18,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2022-07-13 02:15:18,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0bf32c7/72d637c5c02340b6917e4f9916b1a851/FLAG85dfc9854 [2022-07-13 02:15:18,896 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:15:18,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2022-07-13 02:15:18,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0bf32c7/72d637c5c02340b6917e4f9916b1a851/FLAG85dfc9854 [2022-07-13 02:15:19,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0bf32c7/72d637c5c02340b6917e4f9916b1a851 [2022-07-13 02:15:19,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:15:19,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:15:19,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:19,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:15:19,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:15:19,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4a3a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19, skipping insertion in model container [2022-07-13 02:15:19,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:15:19,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:15:19,532 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/bitvector/soft_float_2.c.cil.c[727,740] [2022-07-13 02:15:19,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:19,620 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:15:19,639 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/bitvector/soft_float_2.c.cil.c[727,740] [2022-07-13 02:15:19,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:19,698 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:15:19,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19 WrapperNode [2022-07-13 02:15:19,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:19,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:19,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:15:19,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:15:19,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,751 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2022-07-13 02:15:19,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:19,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:15:19,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:15:19,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:15:19,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:15:19,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:15:19,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:15:19,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:15:19,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:19,824 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-07-13 02:15:19,836 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-07-13 02:15:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:15:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 02:15:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 02:15:19,863 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 02:15:19,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:15:19,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:15:19,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 02:15:19,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 02:15:19,924 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:15:19,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:15:20,298 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:15:20,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:15:20,305 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 02:15:20,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:20 BoogieIcfgContainer [2022-07-13 02:15:20,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:15:20,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:15:20,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:15:20,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:15:20,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:15:19" (1/3) ... [2022-07-13 02:15:20,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2794cd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:20, skipping insertion in model container [2022-07-13 02:15:20,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (2/3) ... [2022-07-13 02:15:20,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2794cd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:20, skipping insertion in model container [2022-07-13 02:15:20,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:20" (3/3) ... [2022-07-13 02:15:20,319 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2022-07-13 02:15:20,330 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:15:20,331 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-13 02:15:20,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:15:20,401 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1dece451, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b92855e [2022-07-13 02:15:20,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-13 02:15:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 106 states have (on average 1.8018867924528301) internal successors, (191), 137 states have internal predecessors, (191), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:20,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:20,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash 147391961, now seen corresponding path program 1 times [2022-07-13 02:15:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:20,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841528426] [2022-07-13 02:15:20,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:20,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:20,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841528426] [2022-07-13 02:15:20,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841528426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:20,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:20,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:15:20,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139674329] [2022-07-13 02:15:20,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 02:15:20,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 02:15:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:20,572 INFO L87 Difference]: Start difference. First operand has 144 states, 106 states have (on average 1.8018867924528301) internal successors, (191), 137 states have internal predecessors, (191), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-07-13 02:15:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:20,631 INFO L93 Difference]: Finished difference Result 283 states and 403 transitions. [2022-07-13 02:15:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 02:15:20,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-07-13 02:15:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:20,642 INFO L225 Difference]: With dead ends: 283 [2022-07-13 02:15:20,643 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 02:15:20,652 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-07-13 02:15:20,661 INFO L413 NwaCegarLoop]: 184 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, 184 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-07-13 02:15:20,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 02:15:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-13 02:15:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2022-07-13 02:15:20,725 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 9 [2022-07-13 02:15:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:20,726 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2022-07-13 02:15:20,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-07-13 02:15:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-07-13 02:15:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:20,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:15:20,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash 146450613, now seen corresponding path program 1 times [2022-07-13 02:15:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:20,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961172870] [2022-07-13 02:15:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:20,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:20,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961172870] [2022-07-13 02:15:20,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961172870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:20,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:20,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:20,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979905970] [2022-07-13 02:15:20,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:20,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:20,851 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-07-13 02:15:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:20,966 INFO L93 Difference]: Finished difference Result 304 states and 392 transitions. [2022-07-13 02:15:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:20,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2022-07-13 02:15:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:20,970 INFO L225 Difference]: With dead ends: 304 [2022-07-13 02:15:20,970 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 02:15:20,971 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-07-13 02:15:20,972 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 100 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:20,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 395 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 02:15:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2022-07-13 02:15:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2022-07-13 02:15:20,987 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 9 [2022-07-13 02:15:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:20,987 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2022-07-13 02:15:20,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-07-13 02:15:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2022-07-13 02:15:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 02:15:20,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:15:20,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 966754998, now seen corresponding path program 1 times [2022-07-13 02:15:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:20,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144016719] [2022-07-13 02:15:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:21,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144016719] [2022-07-13 02:15:21,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144016719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:21,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:21,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749179] [2022-07-13 02:15:21,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:21,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:21,048 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-07-13 02:15:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,132 INFO L93 Difference]: Finished difference Result 385 states and 525 transitions. [2022-07-13 02:15:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:15:21,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-07-13 02:15:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,136 INFO L225 Difference]: With dead ends: 385 [2022-07-13 02:15:21,136 INFO L226 Difference]: Without dead ends: 218 [2022-07-13 02:15:21,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07-13 02:15:21,143 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 33 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 413 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-13 02:15:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 193. [2022-07-13 02:15:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 268 transitions. [2022-07-13 02:15:21,176 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 268 transitions. Word has length 12 [2022-07-13 02:15:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,176 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 268 transitions. [2022-07-13 02:15:21,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-07-13 02:15:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 268 transitions. [2022-07-13 02:15:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:15:21,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,184 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 02:15:21,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1503455626, now seen corresponding path program 1 times [2022-07-13 02:15:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945923368] [2022-07-13 02:15:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945923368] [2022-07-13 02:15:21,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945923368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:21,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622339813] [2022-07-13 02:15:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:21,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:21,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 02:15:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 02:15:21,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:21,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:21,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622339813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:21,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:21,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121525187] [2022-07-13 02:15:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:21,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:21,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:21,386 INFO L87 Difference]: Start difference. First operand 193 states and 268 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,446 INFO L93 Difference]: Finished difference Result 365 states and 491 transitions. [2022-07-13 02:15:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:15:21,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-13 02:15:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,448 INFO L225 Difference]: With dead ends: 365 [2022-07-13 02:15:21,448 INFO L226 Difference]: Without dead ends: 194 [2022-07-13 02:15:21,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:21,451 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 60 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 431 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-13 02:15:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2022-07-13 02:15:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 240 transitions. [2022-07-13 02:15:21,462 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 240 transitions. Word has length 19 [2022-07-13 02:15:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,462 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 240 transitions. [2022-07-13 02:15:21,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 240 transitions. [2022-07-13 02:15:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:15:21,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,463 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:21,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:21,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1863907122, now seen corresponding path program 1 times [2022-07-13 02:15:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119773591] [2022-07-13 02:15:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119773591] [2022-07-13 02:15:21,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119773591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:21,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065747853] [2022-07-13 02:15:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:21,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:21,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 02:15:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:21,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:21,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:21,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065747853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:21,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:21,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-13 02:15:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830455272] [2022-07-13 02:15:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:15:21,853 INFO L87 Difference]: Start difference. First operand 176 states and 240 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,942 INFO L93 Difference]: Finished difference Result 187 states and 244 transitions. [2022-07-13 02:15:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:21,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-13 02:15:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,944 INFO L225 Difference]: With dead ends: 187 [2022-07-13 02:15:21,944 INFO L226 Difference]: Without dead ends: 182 [2022-07-13 02:15:21,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:15:21,945 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 152 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 375 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-13 02:15:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2022-07-13 02:15:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2022-07-13 02:15:21,953 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 20 [2022-07-13 02:15:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,954 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2022-07-13 02:15:21,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2022-07-13 02:15:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:15:21,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,955 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:22,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1946545813, now seen corresponding path program 1 times [2022-07-13 02:15:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796056521] [2022-07-13 02:15:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796056521] [2022-07-13 02:15:22,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796056521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112119803] [2022-07-13 02:15:22,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:22,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 02:15:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:15:22,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 02:15:22,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:22,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112119803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:22,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:22,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-13 02:15:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55427124] [2022-07-13 02:15:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:22,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:15:22,323 INFO L87 Difference]: Start difference. First operand 174 states and 227 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,402 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2022-07-13 02:15:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:22,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-13 02:15:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,403 INFO L225 Difference]: With dead ends: 212 [2022-07-13 02:15:22,403 INFO L226 Difference]: Without dead ends: 207 [2022-07-13 02:15:22,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:15:22,404 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 33 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:22,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 263 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-13 02:15:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2022-07-13 02:15:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2022-07-13 02:15:22,413 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 21 [2022-07-13 02:15:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,413 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2022-07-13 02:15:22,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2022-07-13 02:15:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 02:15:22,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:22,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:22,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1511766147, now seen corresponding path program 1 times [2022-07-13 02:15:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502025581] [2022-07-13 02:15:22,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:22,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502025581] [2022-07-13 02:15:22,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502025581] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547937881] [2022-07-13 02:15:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,693 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:22,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 02:15:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:22,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:22,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:22,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547937881] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:22,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:22,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-07-13 02:15:22,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553518289] [2022-07-13 02:15:22,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 02:15:22,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 02:15:22,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:15:22,879 INFO L87 Difference]: Start difference. First operand 191 states and 243 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:23,495 INFO L93 Difference]: Finished difference Result 829 states and 1079 transitions. [2022-07-13 02:15:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 02:15:23,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-07-13 02:15:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:23,502 INFO L225 Difference]: With dead ends: 829 [2022-07-13 02:15:23,502 INFO L226 Difference]: Without dead ends: 671 [2022-07-13 02:15:23,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=714, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 02:15:23,503 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 621 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:23,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 848 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 02:15:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-07-13 02:15:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 221. [2022-07-13 02:15:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 280 transitions. [2022-07-13 02:15:23,536 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 280 transitions. Word has length 31 [2022-07-13 02:15:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:23,537 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 280 transitions. [2022-07-13 02:15:23,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 280 transitions. [2022-07-13 02:15:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 02:15:23,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:23,544 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:23,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:23,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:23,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash 24022301, now seen corresponding path program 1 times [2022-07-13 02:15:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:23,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955075488] [2022-07-13 02:15:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955075488] [2022-07-13 02:15:23,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955075488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:23,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781508575] [2022-07-13 02:15:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:23,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:23,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 02:15:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:23,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:23,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:23,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781508575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:23,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:23,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790369948] [2022-07-13 02:15:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:23,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:23,937 INFO L87 Difference]: Start difference. First operand 221 states and 280 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 02:15:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:24,037 INFO L93 Difference]: Finished difference Result 312 states and 409 transitions. [2022-07-13 02:15:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-13 02:15:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:24,039 INFO L225 Difference]: With dead ends: 312 [2022-07-13 02:15:24,039 INFO L226 Difference]: Without dead ends: 309 [2022-07-13 02:15:24,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:24,040 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 218 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:24,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 376 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-13 02:15:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 290. [2022-07-13 02:15:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 386 transitions. [2022-07-13 02:15:24,049 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 386 transitions. Word has length 43 [2022-07-13 02:15:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:24,050 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 386 transitions. [2022-07-13 02:15:24,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 02:15:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 386 transitions. [2022-07-13 02:15:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 02:15:24,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:24,051 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:24,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:24,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:24,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1796922619, now seen corresponding path program 1 times [2022-07-13 02:15:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:24,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162181441] [2022-07-13 02:15:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:24,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:24,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162181441] [2022-07-13 02:15:24,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162181441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:24,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148767676] [2022-07-13 02:15:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:24,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:24,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 02:15:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:24,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:24,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:24,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148767676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:24,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:24,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585149261] [2022-07-13 02:15:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:24,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:24,406 INFO L87 Difference]: Start difference. First operand 290 states and 386 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 02:15:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:24,506 INFO L93 Difference]: Finished difference Result 316 states and 410 transitions. [2022-07-13 02:15:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-13 02:15:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:24,509 INFO L225 Difference]: With dead ends: 316 [2022-07-13 02:15:24,509 INFO L226 Difference]: Without dead ends: 311 [2022-07-13 02:15:24,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:24,512 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 171 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:24,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 447 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-13 02:15:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 270. [2022-07-13 02:15:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 351 transitions. [2022-07-13 02:15:24,528 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 351 transitions. Word has length 45 [2022-07-13 02:15:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:24,529 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 351 transitions. [2022-07-13 02:15:24,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 02:15:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 351 transitions. [2022-07-13 02:15:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 02:15:24,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:24,531 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:24,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:24,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash 132146510, now seen corresponding path program 1 times [2022-07-13 02:15:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:24,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593052602] [2022-07-13 02:15:24,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:24,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:24,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593052602] [2022-07-13 02:15:24,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593052602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:24,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:24,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:15:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836941341] [2022-07-13 02:15:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:24,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:15:24,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:15:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:24,850 INFO L87 Difference]: Start difference. First operand 270 states and 351 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 02:15:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,038 INFO L93 Difference]: Finished difference Result 875 states and 1119 transitions. [2022-07-13 02:15:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:15:25,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-07-13 02:15:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,043 INFO L225 Difference]: With dead ends: 875 [2022-07-13 02:15:25,043 INFO L226 Difference]: Without dead ends: 648 [2022-07-13 02:15:25,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:25,044 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 288 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:25,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 621 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-07-13 02:15:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 270. [2022-07-13 02:15:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 350 transitions. [2022-07-13 02:15:25,059 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 350 transitions. Word has length 46 [2022-07-13 02:15:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,059 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 350 transitions. [2022-07-13 02:15:25,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 02:15:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 350 transitions. [2022-07-13 02:15:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 02:15:25,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,060 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:25,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 02:15:25,061 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 594216172, now seen corresponding path program 1 times [2022-07-13 02:15:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885954554] [2022-07-13 02:15:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:25,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885954554] [2022-07-13 02:15:25,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885954554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:25,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36933503] [2022-07-13 02:15:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:25,172 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:25,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 02:15:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 02:15:25,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:25,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:25,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36933503] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:25,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:25,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-07-13 02:15:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67356689] [2022-07-13 02:15:25,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 02:15:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 02:15:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-13 02:15:25,540 INFO L87 Difference]: Start difference. First operand 270 states and 350 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:26,747 INFO L93 Difference]: Finished difference Result 2122 states and 2748 transitions. [2022-07-13 02:15:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-13 02:15:26,747 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-07-13 02:15:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:26,755 INFO L225 Difference]: With dead ends: 2122 [2022-07-13 02:15:26,755 INFO L226 Difference]: Without dead ends: 1915 [2022-07-13 02:15:26,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1137, Invalid=2403, Unknown=0, NotChecked=0, Total=3540 [2022-07-13 02:15:26,758 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 2219 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:26,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 877 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 02:15:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-07-13 02:15:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 300. [2022-07-13 02:15:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 386 transitions. [2022-07-13 02:15:26,790 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 386 transitions. Word has length 49 [2022-07-13 02:15:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:26,791 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 386 transitions. [2022-07-13 02:15:26,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 386 transitions. [2022-07-13 02:15:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 02:15:26,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:26,792 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:26,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:27,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:27,016 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash 567559826, now seen corresponding path program 1 times [2022-07-13 02:15:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:27,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302184444] [2022-07-13 02:15:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:27,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302184444] [2022-07-13 02:15:27,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302184444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:27,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204556491] [2022-07-13 02:15:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:27,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:27,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:27,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:27,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 02:15:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:27,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:27,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:27,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204556491] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:27,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:27,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-13 02:15:27,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6438115] [2022-07-13 02:15:27,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:27,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 02:15:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 02:15:27,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:27,389 INFO L87 Difference]: Start difference. First operand 300 states and 386 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:28,239 INFO L93 Difference]: Finished difference Result 1225 states and 1545 transitions. [2022-07-13 02:15:28,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 02:15:28,240 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-07-13 02:15:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:28,244 INFO L225 Difference]: With dead ends: 1225 [2022-07-13 02:15:28,244 INFO L226 Difference]: Without dead ends: 942 [2022-07-13 02:15:28,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 02:15:28,245 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 647 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:28,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1528 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:15:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-07-13 02:15:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 364. [2022-07-13 02:15:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2022-07-13 02:15:28,273 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 51 [2022-07-13 02:15:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:28,274 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2022-07-13 02:15:28,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2022-07-13 02:15:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 02:15:28,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:28,275 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:28,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:28,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 02:15:28,495 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1383845486, now seen corresponding path program 2 times [2022-07-13 02:15:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:28,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248427669] [2022-07-13 02:15:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:28,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:28,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248427669] [2022-07-13 02:15:28,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248427669] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:28,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930536736] [2022-07-13 02:15:28,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:28,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:28,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:28,676 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:28,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 02:15:28,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:15:28,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:28,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 02:15:28,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:28,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:29,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930536736] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:29,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:29,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-07-13 02:15:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575604817] [2022-07-13 02:15:29,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:29,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 02:15:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 02:15:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 02:15:29,283 INFO L87 Difference]: Start difference. First operand 364 states and 473 transitions. Second operand has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:38,500 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 42 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 02:15:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:54,871 INFO L93 Difference]: Finished difference Result 1644 states and 2085 transitions. [2022-07-13 02:15:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-13 02:15:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2022-07-13 02:15:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:54,877 INFO L225 Difference]: With dead ends: 1644 [2022-07-13 02:15:54,877 INFO L226 Difference]: Without dead ends: 1254 [2022-07-13 02:15:54,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=992, Invalid=2909, Unknown=5, NotChecked=0, Total=3906 [2022-07-13 02:15:54,879 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 1510 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:54,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 2724 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 02:15:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-07-13 02:15:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 407. [2022-07-13 02:15:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 375 states have (on average 1.3946666666666667) internal successors, (523), 398 states have internal predecessors, (523), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 531 transitions. [2022-07-13 02:15:54,924 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 531 transitions. Word has length 71 [2022-07-13 02:15:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:54,924 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 531 transitions. [2022-07-13 02:15:54,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 531 transitions. [2022-07-13 02:15:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 02:15:54,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:54,925 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:54,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 02:15:55,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 02:15:55,128 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:55,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2075937428, now seen corresponding path program 2 times [2022-07-13 02:15:55,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:55,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011155087] [2022-07-13 02:15:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:55,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:55,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011155087] [2022-07-13 02:15:55,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011155087] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:55,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141776453] [2022-07-13 02:15:55,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:55,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:55,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:55,322 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:55,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 02:15:55,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:15:55,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:55,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 02:15:55,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:55,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:56,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141776453] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:56,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:56,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-07-13 02:15:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977163427] [2022-07-13 02:15:56,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:56,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 02:15:56,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 02:15:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=990, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 02:15:56,031 INFO L87 Difference]: Start difference. First operand 407 states and 531 transitions. Second operand has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:58,758 INFO L93 Difference]: Finished difference Result 3609 states and 4686 transitions. [2022-07-13 02:15:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-07-13 02:15:58,759 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 79 [2022-07-13 02:15:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:58,769 INFO L225 Difference]: With dead ends: 3609 [2022-07-13 02:15:58,769 INFO L226 Difference]: Without dead ends: 3303 [2022-07-13 02:15:58,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3860 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3962, Invalid=8470, Unknown=0, NotChecked=0, Total=12432 [2022-07-13 02:15:58,773 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 3687 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 925 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3687 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 925 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:58,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3687 Valid, 1280 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [925 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 02:15:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2022-07-13 02:15:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 464. [2022-07-13 02:15:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 455 states have internal predecessors, (589), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:15:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 597 transitions. [2022-07-13 02:15:58,846 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 597 transitions. Word has length 79 [2022-07-13 02:15:58,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:58,846 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 597 transitions. [2022-07-13 02:15:58,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.846153846153846) internal successors, (189), 38 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 597 transitions. [2022-07-13 02:15:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 02:15:58,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:58,851 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:58,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:59,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 02:15:59,075 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:15:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash -314996846, now seen corresponding path program 3 times [2022-07-13 02:15:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:59,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219206527] [2022-07-13 02:15:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:59,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:59,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:59,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:59,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219206527] [2022-07-13 02:15:59,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219206527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:59,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323612180] [2022-07-13 02:15:59,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:15:59,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:59,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:59,430 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:59,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 02:16:00,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-13 02:16:00,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:16:00,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 02:16:00,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:16:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:16:01,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:16:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 13 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:16:02,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323612180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:16:02,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:16:02,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2022-07-13 02:16:02,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852704910] [2022-07-13 02:16:02,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:16:02,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 02:16:02,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:02,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 02:16:02,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1831, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 02:16:02,174 INFO L87 Difference]: Start difference. First operand 464 states and 597 transitions. Second operand has 50 states, 50 states have (on average 5.38) internal successors, (269), 49 states have internal predecessors, (269), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:20,110 WARN L233 SmtUtils]: Spent 8.57s on a formula simplification. DAG size of input: 52 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 02:16:32,894 WARN L233 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 47 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 02:17:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:03,213 INFO L93 Difference]: Finished difference Result 2234 states and 2849 transitions. [2022-07-13 02:17:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-13 02:17:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.38) internal successors, (269), 49 states have internal predecessors, (269), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 111 [2022-07-13 02:17:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:03,220 INFO L225 Difference]: With dead ends: 2234 [2022-07-13 02:17:03,220 INFO L226 Difference]: Without dead ends: 1804 [2022-07-13 02:17:03,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3180 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=2907, Invalid=9965, Unknown=10, NotChecked=0, Total=12882 [2022-07-13 02:17:03,224 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 3014 mSDsluCounter, 7078 mSDsCounter, 0 mSdLazyCounter, 4592 mSolverCounterSat, 942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3014 SdHoareTripleChecker+Valid, 7323 SdHoareTripleChecker+Invalid, 5534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 942 IncrementalHoareTripleChecker+Valid, 4592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:03,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3014 Valid, 7323 Invalid, 5534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [942 Valid, 4592 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 02:17:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-07-13 02:17:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 537. [2022-07-13 02:17:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 505 states have (on average 1.3683168316831684) internal successors, (691), 528 states have internal predecessors, (691), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:17:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 699 transitions. [2022-07-13 02:17:03,288 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 699 transitions. Word has length 111 [2022-07-13 02:17:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:03,288 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 699 transitions. [2022-07-13 02:17:03,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.38) internal successors, (269), 49 states have internal predecessors, (269), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:17:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 699 transitions. [2022-07-13 02:17:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 02:17:03,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:03,290 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:03,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 02:17:03,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 02:17:03,495 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:17:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1059944044, now seen corresponding path program 3 times [2022-07-13 02:17:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:03,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10390485] [2022-07-13 02:17:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:03,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:03,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 9 proven. 1199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:17:03,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:03,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10390485] [2022-07-13 02:17:03,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10390485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:17:03,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756527121] [2022-07-13 02:17:03,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:17:03,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:03,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:17:03,960 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:17:03,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 02:17:04,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2022-07-13 02:17:04,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:17:04,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:17:04,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:17:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 9 proven. 1199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:17:05,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:17:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 9 proven. 1199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:17:06,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756527121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:17:06,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:17:06,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 75 [2022-07-13 02:17:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433432995] [2022-07-13 02:17:06,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:17:06,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-13 02:17:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-13 02:17:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=3702, Unknown=0, NotChecked=0, Total=5550 [2022-07-13 02:17:06,555 INFO L87 Difference]: Start difference. First operand 537 states and 699 transitions. Second operand has 75 states, 75 states have (on average 4.92) internal successors, (369), 74 states have internal predecessors, (369), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:15,715 INFO L93 Difference]: Finished difference Result 7083 states and 9208 transitions. [2022-07-13 02:17:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-07-13 02:17:15,716 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.92) internal successors, (369), 74 states have internal predecessors, (369), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 139 [2022-07-13 02:17:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:15,736 INFO L225 Difference]: With dead ends: 7083 [2022-07-13 02:17:15,736 INFO L226 Difference]: Without dead ends: 6697 [2022-07-13 02:17:15,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15157 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=15016, Invalid=32726, Unknown=0, NotChecked=0, Total=47742 [2022-07-13 02:17:15,745 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 8568 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 1591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8568 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1591 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:15,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8568 Valid, 2078 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1591 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 02:17:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2022-07-13 02:17:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 664. [2022-07-13 02:17:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 632 states have (on average 1.3338607594936709) internal successors, (843), 655 states have internal predecessors, (843), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 02:17:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 851 transitions. [2022-07-13 02:17:15,875 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 851 transitions. Word has length 139 [2022-07-13 02:17:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:15,875 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 851 transitions. [2022-07-13 02:17:15,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.92) internal successors, (369), 74 states have internal predecessors, (369), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 851 transitions. [2022-07-13 02:17:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 02:17:15,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:15,877 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:15,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 02:17:16,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 02:17:16,082 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-07-13 02:17:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1455914222, now seen corresponding path program 4 times [2022-07-13 02:17:16,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:16,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455570222] [2022-07-13 02:17:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:17:16,113 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 02:17:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:17:16,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 02:17:16,186 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 02:17:16,187 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2022-07-13 02:17:16,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2022-07-13 02:17:16,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2022-07-13 02:17:16,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2022-07-13 02:17:16,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2022-07-13 02:17:16,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2022-07-13 02:17:16,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2022-07-13 02:17:16,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2022-07-13 02:17:16,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2022-07-13 02:17:16,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2022-07-13 02:17:16,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2022-07-13 02:17:16,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2022-07-13 02:17:16,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2022-07-13 02:17:16,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2022-07-13 02:17:16,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2022-07-13 02:17:16,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2022-07-13 02:17:16,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2022-07-13 02:17:16,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2022-07-13 02:17:16,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2022-07-13 02:17:16,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2022-07-13 02:17:16,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2022-07-13 02:17:16,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2022-07-13 02:17:16,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2022-07-13 02:17:16,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2022-07-13 02:17:16,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2022-07-13 02:17:16,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2022-07-13 02:17:16,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2022-07-13 02:17:16,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2022-07-13 02:17:16,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2022-07-13 02:17:16,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2022-07-13 02:17:16,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 02:17:16,200 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:16,205 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 02:17:16,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:17:16 BoogieIcfgContainer [2022-07-13 02:17:16,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 02:17:16,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 02:17:16,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 02:17:16,305 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 02:17:16,306 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:20" (3/4) ... [2022-07-13 02:17:16,308 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 02:17:16,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 02:17:16,309 INFO L158 Benchmark]: Toolchain (without parser) took 117004.49ms. Allocated memory was 86.0MB in the beginning and 402.7MB in the end (delta: 316.7MB). Free memory was 53.0MB in the beginning and 162.9MB in the end (delta: -109.9MB). Peak memory consumption was 207.0MB. Max. memory is 16.1GB. [2022-07-13 02:17:16,309 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:17:16,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.23ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 52.8MB in the beginning and 85.5MB in the end (delta: -32.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 02:17:16,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.71ms. Allocated memory is still 113.2MB. Free memory was 85.5MB in the beginning and 82.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:17:16,310 INFO L158 Benchmark]: Boogie Preprocessor took 37.00ms. Allocated memory is still 113.2MB. Free memory was 82.8MB in the beginning and 81.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:17:16,310 INFO L158 Benchmark]: RCFGBuilder took 517.30ms. Allocated memory is still 113.2MB. Free memory was 81.3MB in the beginning and 59.7MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 02:17:16,310 INFO L158 Benchmark]: TraceAbstraction took 115995.73ms. Allocated memory was 113.2MB in the beginning and 402.7MB in the end (delta: 289.4MB). Free memory was 59.4MB in the beginning and 163.9MB in the end (delta: -104.6MB). Peak memory consumption was 186.9MB. Max. memory is 16.1GB. [2022-07-13 02:17:16,311 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 402.7MB. Free memory was 163.9MB in the beginning and 162.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:17:16,312 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.13ms. Allocated memory is still 86.0MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.23ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 52.8MB in the beginning and 85.5MB in the end (delta: -32.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.71ms. Allocated memory is still 113.2MB. Free memory was 85.5MB in the beginning and 82.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.00ms. Allocated memory is still 113.2MB. Free memory was 82.8MB in the beginning and 81.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.30ms. Allocated memory is still 113.2MB. Free memory was 81.3MB in the beginning and 59.7MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 115995.73ms. Allocated memory was 113.2MB in the beginning and 402.7MB in the end (delta: 289.4MB). Free memory was 59.4MB in the beginning and 163.9MB in the end (delta: -104.6MB). Peak memory consumption was 186.9MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 402.7MB. Free memory was 163.9MB in the beginning and 162.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sa ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=0, m=1, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-1, m=2, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-1, m=2, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-1, m=2, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-1, m=2, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-2, m=4, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-2, m=4, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-2, m=4, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-2, m=4, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-3, m=8, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-3, m=8, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-3, m=8, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-3, m=8, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-4, m=16, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-4, m=16, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-4, m=16, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-4, m=16, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-5, m=32, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-5, m=32, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-5, m=32, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-5, m=32, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-6, m=64, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-6, m=64, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-6, m=64, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-6, m=64, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-7, m=128, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-7, m=128, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-7, m=128, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-7, m=128, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-8, m=256, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-8, m=256, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-8, m=256, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-8, m=256, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-9, m=512, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-9, m=512, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-9, m=512, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-9, m=512, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-10, m=1024, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-10, m=1024, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-10, m=1024, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-10, m=1024, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-11, m=2048, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-11, m=2048, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-11, m=2048, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-11, m=2048, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-12, m=4096, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-12, m=4096, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-12, m=4096, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-12, m=4096, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-13, m=8192, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-13, m=8192, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-13, m=8192, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-13, m=8192, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-14, m=16384, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-14, m=16384, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-14, m=16384, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-14, m=16384, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-15, m=32768, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-15, m=32768, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-15, m=32768, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-15, m=32768, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-16, m=65536, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-16, m=65536, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-16, m=65536, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-16, m=65536, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-17, m=131072, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-17, m=131072, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-17, m=131072, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-17, m=131072, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-18, m=262144, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-18, m=262144, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-18, m=262144, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-18, m=262144, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-19, m=524288, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-19, m=524288, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-19, m=524288, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-19, m=524288, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-20, m=1048576, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-20, m=1048576, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-20, m=1048576, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-20, m=1048576, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-21, m=2097152, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-21, m=2097152, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-21, m=2097152, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-21, m=2097152, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-22, m=4194304, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-22, m=4194304, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-22, m=4194304, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-22, m=4194304, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-23, m=8388608, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-23, m=8388608, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-23, m=8388608, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-23, m=8388608, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] EXPR (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] EXPR (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830466] [L77] res = m | (unsigned int )((e + 128) << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res=1744830464, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L78] __retres4 = res VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res=1744830464, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=1, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830466, \result=1744830464, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=1744830465, res=1744830464, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=0, eb=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=16777216, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=1744830465, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=1744830464, e=0, m=0, m = m & ~ (1U << 24U)=1744830465, res = m | (unsigned int )((e + 128) << 24U)=1744830464] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: 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 3 procedures, 144 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 115.8s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 102.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21327 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21321 mSDsluCounter, 20163 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17735 mSDsCounter, 4377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10504 IncrementalHoareTripleChecker+Invalid, 14881 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4377 mSolverCounterUnsat, 2428 mSDtfsCounter, 10504 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2074 GetRequests, 1408 SyntacticMatches, 1 SemanticMatches, 665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24798 ImplicationChecksByTransitivity, 92.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=16, InterpolantAutomatonStates: 566, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 14150 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1595 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1930 ConstructedInterpolants, 0 QuantifiedInterpolants, 10509 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1882 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 35 InterpolantComputations, 9 PerfectInterpolantSequences, 326/6390 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-07-13 02:17:16,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample