./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3.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_3.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 aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 02:15:19,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:15:19,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:15:19,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:15:19,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:15:19,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:15:19,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:15:19,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:15:19,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:15:19,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:15:19,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:15:19,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:15:19,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:15:19,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:15:19,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:15:19,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:15:19,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:15:19,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:15:19,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:15:19,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:15:19,797 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:15:19,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:15:19,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:15:19,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:15:19,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:15:19,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:15:19,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:15:19,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:15:19,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:15:19,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:15:19,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:15:19,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:15:19,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:15:19,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:15:19,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:15:19,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:15:19,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:15:19,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:15:19,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:15:19,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:15:19,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:15:19,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:15:19,816 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:19,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:15:19,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:15:19,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:15:19,839 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:15:19,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:15:19,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:15:19,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:15:19,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:15:19,840 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:15:19,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:15:19,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:15:19,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:15:19,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:15:19,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:15:19,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:15:19,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:15:19,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:15:19,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:15:19,842 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:15:19,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:15:19,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:15:19,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:15:19,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:15:19,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:15:19,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:15:19,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:15:19,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:19,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:15:19,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:15:19,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:15:19,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:15:19,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:15:19,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:15:19,844 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 -> aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 [2022-07-13 02:15:20,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:15:20,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:15:20,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:15:20,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:15:20,060 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:15:20,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2022-07-13 02:15:20,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbaf36bf2/0bfa8c80ae5d4c9bab924e1d964a21f5/FLAG328431a04 [2022-07-13 02:15:20,500 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:15:20,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2022-07-13 02:15:20,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbaf36bf2/0bfa8c80ae5d4c9bab924e1d964a21f5/FLAG328431a04 [2022-07-13 02:15:20,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbaf36bf2/0bfa8c80ae5d4c9bab924e1d964a21f5 [2022-07-13 02:15:20,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:15:20,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:15:20,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:20,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:15:20,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:15:20,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:20" (1/1) ... [2022-07-13 02:15:20,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71966232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:20, skipping insertion in model container [2022-07-13 02:15:20,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:20" (1/1) ... [2022-07-13 02:15:20,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:15:20,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:15:21,064 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_3.c.cil.c[727,740] [2022-07-13 02:15:21,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:21,109 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:15:21,131 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_3.c.cil.c[727,740] [2022-07-13 02:15:21,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:21,161 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:15:21,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:21 WrapperNode [2022-07-13 02:15:21,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:21,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:21,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:15:21,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:15:21,175 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:21" (1/1) ... [2022-07-13 02:15:21,182 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:21" (1/1) ... [2022-07-13 02:15:21,200 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2022-07-13 02:15:21,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:21,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:15:21,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:15:21,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:15:21,209 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:21" (1/1) ... [2022-07-13 02:15:21,210 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:21" (1/1) ... [2022-07-13 02:15:21,215 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:21" (1/1) ... [2022-07-13 02:15:21,222 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:21" (1/1) ... [2022-07-13 02:15:21,228 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:21" (1/1) ... [2022-07-13 02:15:21,254 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:21" (1/1) ... [2022-07-13 02:15:21,257 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:21" (1/1) ... [2022-07-13 02:15:21,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:15:21,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:15:21,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:15:21,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:15:21,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:21" (1/1) ... [2022-07-13 02:15:21,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:21,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:21,296 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:21,298 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:21,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:15:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 02:15:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 02:15:21,321 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 02:15:21,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:15:21,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:15:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 02:15:21,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 02:15:21,392 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:15:21,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:15:21,726 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:15:21,731 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:15:21,732 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 02:15:21,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:21 BoogieIcfgContainer [2022-07-13 02:15:21,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:15:21,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:15:21,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:15:21,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:15:21,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:15:20" (1/3) ... [2022-07-13 02:15:21,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f5d5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:21, skipping insertion in model container [2022-07-13 02:15:21,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:21" (2/3) ... [2022-07-13 02:15:21,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f5d5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:21, skipping insertion in model container [2022-07-13 02:15:21,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:21" (3/3) ... [2022-07-13 02:15:21,742 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_3.c.cil.c [2022-07-13 02:15:21,751 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:15:21,751 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-13 02:15:21,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:15:21,799 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@3a7a4c15, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b331889 [2022-07-13 02:15:21,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-13 02:15:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 105 states have (on average 1.8095238095238095) internal successors, (190), 136 states have internal predecessors, (190), 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:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:21,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,810 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:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash -740111720, now seen corresponding path program 1 times [2022-07-13 02:15:21,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761280383] [2022-07-13 02:15:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,918 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,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761280383] [2022-07-13 02:15:21,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761280383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:21,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:21,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:15:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695708500] [2022-07-13 02:15:21,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 02:15:21,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 02:15:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:21,949 INFO L87 Difference]: Start difference. First operand has 143 states, 105 states have (on average 1.8095238095238095) internal successors, (190), 136 states have internal predecessors, (190), 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:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,986 INFO L93 Difference]: Finished difference Result 281 states and 401 transitions. [2022-07-13 02:15:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 02:15:21,987 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:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,993 INFO L225 Difference]: With dead ends: 281 [2022-07-13 02:15:21,993 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 02:15:21,996 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:21,998 INFO L413 NwaCegarLoop]: 183 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, 183 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:21,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 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:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 02:15:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-13 02:15:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.630952380952381) internal successors, (137), 111 states have internal predecessors, (137), 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:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2022-07-13 02:15:22,030 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 9 [2022-07-13 02:15:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,030 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2022-07-13 02:15:22,031 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:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2022-07-13 02:15:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:22,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:22,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:15:22,032 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:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash -741053068, now seen corresponding path program 1 times [2022-07-13 02:15:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432202709] [2022-07-13 02:15:22,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,085 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:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432202709] [2022-07-13 02:15:22,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432202709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:22,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:22,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226063497] [2022-07-13 02:15:22,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:22,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:22,088 INFO L87 Difference]: Start difference. First operand 117 states and 145 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:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,187 INFO L93 Difference]: Finished difference Result 296 states and 380 transitions. [2022-07-13 02:15:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:22,191 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:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,193 INFO L225 Difference]: With dead ends: 296 [2022-07-13 02:15:22,193 INFO L226 Difference]: Without dead ends: 182 [2022-07-13 02:15:22,194 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:22,195 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 100 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 377 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:22,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 377 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:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-13 02:15:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 166. [2022-07-13 02:15:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 132 states have (on average 1.6363636363636365) internal successors, (216), 159 states have internal predecessors, (216), 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:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2022-07-13 02:15:22,207 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 224 transitions. Word has length 9 [2022-07-13 02:15:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,208 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 224 transitions. [2022-07-13 02:15:22,208 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:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 224 transitions. [2022-07-13 02:15:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 02:15:22,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:22,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:15:22,209 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:22,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1163268503, now seen corresponding path program 1 times [2022-07-13 02:15:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780213404] [2022-07-13 02:15:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,268 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:22,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780213404] [2022-07-13 02:15:22,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780213404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:22,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:22,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:22,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253977842] [2022-07-13 02:15:22,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:22,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:22,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:22,272 INFO L87 Difference]: Start difference. First operand 166 states and 224 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:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,339 INFO L93 Difference]: Finished difference Result 377 states and 513 transitions. [2022-07-13 02:15:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:15:22,339 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:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,341 INFO L225 Difference]: With dead ends: 377 [2022-07-13 02:15:22,341 INFO L226 Difference]: Without dead ends: 214 [2022-07-13 02:15:22,343 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:22,344 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 33 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 395 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:22,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 395 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:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-13 02:15:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 189. [2022-07-13 02:15:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 154 states have (on average 1.6493506493506493) internal successors, (254), 181 states have internal predecessors, (254), 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,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 262 transitions. [2022-07-13 02:15:22,360 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 262 transitions. Word has length 12 [2022-07-13 02:15:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,360 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 262 transitions. [2022-07-13 02:15:22,361 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:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 262 transitions. [2022-07-13 02:15:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:15:22,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,362 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:22,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 02:15:22,362 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:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1505632759, now seen corresponding path program 1 times [2022-07-13 02:15:22,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011016210] [2022-07-13 02:15:22,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,450 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,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011016210] [2022-07-13 02:15:22,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011016210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412212500] [2022-07-13 02:15:22,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,453 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:22,464 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:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 02:15:22,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:22,545 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:22,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:22,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412212500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:22,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:22,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:22,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102997104] [2022-07-13 02:15:22,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:22,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:22,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:22,551 INFO L87 Difference]: Start difference. First operand 189 states and 262 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:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,635 INFO L93 Difference]: Finished difference Result 357 states and 479 transitions. [2022-07-13 02:15:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:15:22,636 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:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,637 INFO L225 Difference]: With dead ends: 357 [2022-07-13 02:15:22,637 INFO L226 Difference]: Without dead ends: 190 [2022-07-13 02:15:22,638 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:22,644 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 60 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 413 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:22,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 413 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-13 02:15:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2022-07-13 02:15:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.6496350364963503) internal successors, (226), 164 states have internal predecessors, (226), 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,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 234 transitions. [2022-07-13 02:15:22,672 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 234 transitions. Word has length 19 [2022-07-13 02:15:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,673 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 234 transitions. [2022-07-13 02:15:22,673 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:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2022-07-13 02:15:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:15:22,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,674 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:22,693 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:22,874 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:22,875 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:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1223519597, now seen corresponding path program 1 times [2022-07-13 02:15:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714301764] [2022-07-13 02:15:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,928 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,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714301764] [2022-07-13 02:15:22,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714301764] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37198921] [2022-07-13 02:15:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,931 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:22,963 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:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:22,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:23,021 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:23,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:23,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37198921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:23,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:23,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-13 02:15:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388687131] [2022-07-13 02:15:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:15:23,030 INFO L87 Difference]: Start difference. First operand 172 states and 234 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:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:23,122 INFO L93 Difference]: Finished difference Result 183 states and 238 transitions. [2022-07-13 02:15:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:23,123 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:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:23,124 INFO L225 Difference]: With dead ends: 183 [2022-07-13 02:15:23,124 INFO L226 Difference]: Without dead ends: 178 [2022-07-13 02:15:23,125 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:23,125 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 102 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:23,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 458 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-13 02:15:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2022-07-13 02:15:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 162 states have internal predecessors, (213), 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,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2022-07-13 02:15:23,151 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 20 [2022-07-13 02:15:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:23,151 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2022-07-13 02:15:23,151 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:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2022-07-13 02:15:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:15:23,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:23,152 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:23,171 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:23,369 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:23,369 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:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash -725598036, now seen corresponding path program 1 times [2022-07-13 02:15:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:23,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013480409] [2022-07-13 02:15:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,424 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:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013480409] [2022-07-13 02:15:23,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013480409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281721991] [2022-07-13 02:15:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:23,426 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:23,427 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:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:15:23,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:23,509 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:23,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:23,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281721991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:23,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:23,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-13 02:15:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139838708] [2022-07-13 02:15:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:23,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:15:23,512 INFO L87 Difference]: Start difference. First operand 170 states and 221 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:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:23,567 INFO L93 Difference]: Finished difference Result 208 states and 278 transitions. [2022-07-13 02:15:23,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:23,568 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:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:23,570 INFO L225 Difference]: With dead ends: 208 [2022-07-13 02:15:23,570 INFO L226 Difference]: Without dead ends: 203 [2022-07-13 02:15:23,570 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:23,571 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 32 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:23,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 350 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-13 02:15:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 187. [2022-07-13 02:15:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.4774193548387098) internal successors, (229), 179 states have internal predecessors, (229), 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,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2022-07-13 02:15:23,580 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 21 [2022-07-13 02:15:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:23,580 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2022-07-13 02:15:23,580 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:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2022-07-13 02:15:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 02:15:23,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:23,584 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:23,607 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:23,799 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:23,800 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:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash -451289022, now seen corresponding path program 1 times [2022-07-13 02:15:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:23,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464342110] [2022-07-13 02:15:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:23,823 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 9 [2022-07-13 02:15:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,865 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:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:23,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464342110] [2022-07-13 02:15:23,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464342110] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:23,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554758295] [2022-07-13 02:15:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:23,867 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:23,895 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:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:23,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:23,970 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:23,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:24,067 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:24,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554758295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:24,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:24,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-07-13 02:15:24,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526431025] [2022-07-13 02:15:24,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:24,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 02:15:24,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:24,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 02:15:24,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:15:24,069 INFO L87 Difference]: Start difference. First operand 187 states and 237 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:24,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:24,608 INFO L93 Difference]: Finished difference Result 821 states and 1067 transitions. [2022-07-13 02:15:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 02:15:24,615 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:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:24,618 INFO L225 Difference]: With dead ends: 821 [2022-07-13 02:15:24,618 INFO L226 Difference]: Without dead ends: 667 [2022-07-13 02:15:24,618 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:24,619 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 692 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:24,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 815 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 02:15:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-07-13 02:15:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 217. [2022-07-13 02:15:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 185 states have (on average 1.4378378378378378) internal successors, (266), 209 states have internal predecessors, (266), 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:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 274 transitions. [2022-07-13 02:15:24,634 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 274 transitions. Word has length 31 [2022-07-13 02:15:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:24,634 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 274 transitions. [2022-07-13 02:15:24,634 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:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 274 transitions. [2022-07-13 02:15:24,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 02:15:24,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:24,636 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:24,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 02:15:24,852 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:24,852 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:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -96158884, now seen corresponding path program 1 times [2022-07-13 02:15:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:24,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667016087] [2022-07-13 02:15:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,916 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:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:24,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667016087] [2022-07-13 02:15:24,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667016087] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:24,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110666379] [2022-07-13 02:15:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:24,932 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:24,933 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:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:24,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:25,006 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:25,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:25,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110666379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:25,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:25,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:25,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111343442] [2022-07-13 02:15:25,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:25,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:25,009 INFO L87 Difference]: Start difference. First operand 217 states and 274 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:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,079 INFO L93 Difference]: Finished difference Result 308 states and 403 transitions. [2022-07-13 02:15:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:25,079 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:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,082 INFO L225 Difference]: With dead ends: 308 [2022-07-13 02:15:25,082 INFO L226 Difference]: Without dead ends: 305 [2022-07-13 02:15:25,082 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:25,083 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 212 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 358 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:25,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 358 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:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-13 02:15:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 286. [2022-07-13 02:15:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 254 states have (on average 1.4645669291338583) internal successors, (372), 277 states have internal predecessors, (372), 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,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 380 transitions. [2022-07-13 02:15:25,094 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 380 transitions. Word has length 43 [2022-07-13 02:15:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,095 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 380 transitions. [2022-07-13 02:15:25,095 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:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 380 transitions. [2022-07-13 02:15:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 02:15:25,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,098 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:25,125 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:25,315 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:25,316 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:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1326924412, now seen corresponding path program 1 times [2022-07-13 02:15:25,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641185689] [2022-07-13 02:15:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,387 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:25,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641185689] [2022-07-13 02:15:25,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641185689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:25,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168388321] [2022-07-13 02:15:25,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:25,389 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:25,391 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:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:25,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:25,457 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:25,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:25,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168388321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:25,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:25,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:25,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062929114] [2022-07-13 02:15:25,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:25,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:25,459 INFO L87 Difference]: Start difference. First operand 286 states and 380 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:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,531 INFO L93 Difference]: Finished difference Result 312 states and 404 transitions. [2022-07-13 02:15:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:25,531 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:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,532 INFO L225 Difference]: With dead ends: 312 [2022-07-13 02:15:25,532 INFO L226 Difference]: Without dead ends: 307 [2022-07-13 02:15:25,533 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:25,533 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 165 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 429 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:25,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 429 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:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-13 02:15:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 266. [2022-07-13 02:15:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 234 states have (on average 1.4401709401709402) internal successors, (337), 257 states have internal predecessors, (337), 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,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 345 transitions. [2022-07-13 02:15:25,543 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 345 transitions. Word has length 45 [2022-07-13 02:15:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,543 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 345 transitions. [2022-07-13 02:15:25,543 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:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 345 transitions. [2022-07-13 02:15:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 02:15:25,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,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, 1, 1, 1] [2022-07-13 02:15:25,569 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:25,753 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:25,754 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:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1817189039, now seen corresponding path program 1 times [2022-07-13 02:15:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529225034] [2022-07-13 02:15:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,819 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:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529225034] [2022-07-13 02:15:25,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529225034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:25,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:25,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:15:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084562138] [2022-07-13 02:15:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:15:25,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:15:25,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:25,821 INFO L87 Difference]: Start difference. First operand 266 states and 345 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,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,986 INFO L93 Difference]: Finished difference Result 867 states and 1107 transitions. [2022-07-13 02:15:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:15:25,987 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,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,995 INFO L225 Difference]: With dead ends: 867 [2022-07-13 02:15:25,996 INFO L226 Difference]: Without dead ends: 644 [2022-07-13 02:15:25,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:25,997 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 336 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:25,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 420 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-07-13 02:15:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 266. [2022-07-13 02:15:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 234 states have (on average 1.435897435897436) internal successors, (336), 257 states have internal predecessors, (336), 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,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 344 transitions. [2022-07-13 02:15:26,013 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 344 transitions. Word has length 46 [2022-07-13 02:15:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:26,013 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 344 transitions. [2022-07-13 02:15:26,014 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:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 344 transitions. [2022-07-13 02:15:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 02:15:26,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:26,015 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:26,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 02:15:26,016 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:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1400021551, now seen corresponding path program 1 times [2022-07-13 02:15:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40739700] [2022-07-13 02:15:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,104 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:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:26,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40739700] [2022-07-13 02:15:26,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40739700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:26,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664268357] [2022-07-13 02:15:26,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:26,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:26,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:26,106 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:26,107 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:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 02:15:26,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:26,213 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:26,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:26,359 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:26,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664268357] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:26,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:26,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-07-13 02:15:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76661052] [2022-07-13 02:15:26,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:26,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 02:15:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:26,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 02:15:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-13 02:15:26,361 INFO L87 Difference]: Start difference. First operand 266 states and 344 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:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:27,340 INFO L93 Difference]: Finished difference Result 2114 states and 2736 transitions. [2022-07-13 02:15:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-13 02:15:27,340 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:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:27,345 INFO L225 Difference]: With dead ends: 2114 [2022-07-13 02:15:27,346 INFO L226 Difference]: Without dead ends: 1911 [2022-07-13 02:15:27,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1137, Invalid=2403, Unknown=0, NotChecked=0, Total=3540 [2022-07-13 02:15:27,347 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1534 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:27,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1145 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:15:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-07-13 02:15:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 296. [2022-07-13 02:15:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 264 states have (on average 1.4090909090909092) internal successors, (372), 287 states have internal predecessors, (372), 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:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 380 transitions. [2022-07-13 02:15:27,371 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 380 transitions. Word has length 49 [2022-07-13 02:15:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:27,371 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 380 transitions. [2022-07-13 02:15:27,371 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:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 380 transitions. [2022-07-13 02:15:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 02:15:27,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:27,371 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:27,393 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,588 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,588 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,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1543370645, now seen corresponding path program 1 times [2022-07-13 02:15:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:27,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536654575] [2022-07-13 02:15:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,654 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,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:27,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536654575] [2022-07-13 02:15:27,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536654575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:27,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005246636] [2022-07-13 02:15:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:27,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:27,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:27,664 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,665 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,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:27,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:27,769 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,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:27,860 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,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005246636] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:27,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:27,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-13 02:15:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898312355] [2022-07-13 02:15:27,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 02:15:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 02:15:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:27,862 INFO L87 Difference]: Start difference. First operand 296 states and 380 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,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:28,900 INFO L93 Difference]: Finished difference Result 1217 states and 1533 transitions. [2022-07-13 02:15:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 02:15:28,901 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,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:28,905 INFO L225 Difference]: With dead ends: 1217 [2022-07-13 02:15:28,905 INFO L226 Difference]: Without dead ends: 938 [2022-07-13 02:15:28,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 02:15:28,906 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 730 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:28,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1111 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 02:15:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-13 02:15:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 360. [2022-07-13 02:15:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 328 states have (on average 1.399390243902439) internal successors, (459), 351 states have internal predecessors, (459), 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,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 467 transitions. [2022-07-13 02:15:28,930 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 467 transitions. Word has length 51 [2022-07-13 02:15:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:28,930 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 467 transitions. [2022-07-13 02:15:28,930 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,930 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 467 transitions. [2022-07-13 02:15:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 02:15:28,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:28,931 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,950 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:29,147 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:29,147 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:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1382541291, now seen corresponding path program 2 times [2022-07-13 02:15:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:29,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887506555] [2022-07-13 02:15:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,291 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,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:29,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887506555] [2022-07-13 02:15:29,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887506555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:29,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807579134] [2022-07-13 02:15:29,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:29,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:29,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:29,293 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:29,294 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:29,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:15:29,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:29,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 02:15:29,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:29,489 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,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:29,784 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,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807579134] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:29,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:29,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-07-13 02:15:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916057359] [2022-07-13 02:15:29,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:29,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 02:15:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 02:15:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 02:15:29,787 INFO L87 Difference]: Start difference. First operand 360 states and 467 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:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:47,577 INFO L93 Difference]: Finished difference Result 1636 states and 2073 transitions. [2022-07-13 02:15:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-13 02:15:47,578 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:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:47,582 INFO L225 Difference]: With dead ends: 1636 [2022-07-13 02:15:47,582 INFO L226 Difference]: Without dead ends: 1250 [2022-07-13 02:15:47,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=994, Invalid=2909, Unknown=3, NotChecked=0, Total=3906 [2022-07-13 02:15:47,584 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 1464 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:47,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 2515 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 02:15:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-07-13 02:15:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 403. [2022-07-13 02:15:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 371 states have (on average 1.3935309973045822) internal successors, (517), 394 states have internal predecessors, (517), 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:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 525 transitions. [2022-07-13 02:15:47,609 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 525 transitions. Word has length 71 [2022-07-13 02:15:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:47,610 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 525 transitions. [2022-07-13 02:15:47,610 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:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 525 transitions. [2022-07-13 02:15:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 02:15:47,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:47,611 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:47,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:47,823 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:47,823 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:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash -867235089, now seen corresponding path program 2 times [2022-07-13 02:15:47,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:47,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156062292] [2022-07-13 02:15:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:47,998 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:47,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:47,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156062292] [2022-07-13 02:15:47,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156062292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:47,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145783106] [2022-07-13 02:15:47,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:48,008 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:48,009 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:48,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:15:48,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:48,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 02:15:48,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:48,241 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:48,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:48,603 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:48,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145783106] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:48,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:48,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-07-13 02:15:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078878254] [2022-07-13 02:15:48,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:48,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 02:15:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:48,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 02:15:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=990, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 02:15:48,605 INFO L87 Difference]: Start difference. First operand 403 states and 525 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:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:51,121 INFO L93 Difference]: Finished difference Result 3601 states and 4674 transitions. [2022-07-13 02:15:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-07-13 02:15:51,121 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:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:51,129 INFO L225 Difference]: With dead ends: 3601 [2022-07-13 02:15:51,130 INFO L226 Difference]: Without dead ends: 3299 [2022-07-13 02:15:51,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3860 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3962, Invalid=8470, Unknown=0, NotChecked=0, Total=12432 [2022-07-13 02:15:51,133 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4243 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 1083 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4243 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1083 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:51,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4243 Valid, 1295 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1083 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 02:15:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2022-07-13 02:15:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 460. [2022-07-13 02:15:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 428 states have (on average 1.3621495327102804) internal successors, (583), 451 states have internal predecessors, (583), 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:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 591 transitions. [2022-07-13 02:15:51,175 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 591 transitions. Word has length 79 [2022-07-13 02:15:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:51,175 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 591 transitions. [2022-07-13 02:15:51,175 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:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 591 transitions. [2022-07-13 02:15:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 02:15:51,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:51,176 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:51,195 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:51,379 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:51,379 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:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:51,380 INFO L85 PathProgramCache]: Analyzing trace with hash 510433557, now seen corresponding path program 3 times [2022-07-13 02:15:51,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:51,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87764934] [2022-07-13 02:15:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:51,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:51,683 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:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:51,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87764934] [2022-07-13 02:15:51,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87764934] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:51,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609399365] [2022-07-13 02:15:51,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:15:51,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:51,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:51,685 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:51,687 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:15:53,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-13 02:15:53,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:53,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 02:15:53,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:53,487 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:53,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:54,395 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:54,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609399365] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:54,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:54,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2022-07-13 02:15:54,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160128380] [2022-07-13 02:15:54,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:54,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 02:15:54,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:54,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 02:15:54,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1831, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 02:15:54,398 INFO L87 Difference]: Start difference. First operand 460 states and 591 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:10,013 WARN L233 SmtUtils]: Spent 14.43s on a formula simplification. DAG size of input: 57 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:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:06,269 INFO L93 Difference]: Finished difference Result 2226 states and 2837 transitions. [2022-07-13 02:17:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-13 02:17:06,270 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:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:06,274 INFO L225 Difference]: With dead ends: 2226 [2022-07-13 02:17:06,274 INFO L226 Difference]: Without dead ends: 1800 [2022-07-13 02:17:06,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3181 ImplicationChecksByTransitivity, 69.0s TimeCoverageRelationStatistics Valid=2906, Invalid=9965, Unknown=11, NotChecked=0, Total=12882 [2022-07-13 02:17:06,278 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 3126 mSDsluCounter, 7323 mSDsCounter, 0 mSdLazyCounter, 4571 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 7562 SdHoareTripleChecker+Invalid, 5583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 4571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:06,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3126 Valid, 7562 Invalid, 5583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 4571 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-13 02:17:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2022-07-13 02:17:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 533. [2022-07-13 02:17:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 501 states have (on average 1.3672654690618762) internal successors, (685), 524 states have internal predecessors, (685), 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:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 693 transitions. [2022-07-13 02:17:06,334 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 693 transitions. Word has length 111 [2022-07-13 02:17:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:06,334 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 693 transitions. [2022-07-13 02:17:06,335 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:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 693 transitions. [2022-07-13 02:17:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 02:17:06,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:06,336 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:06,343 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:06,540 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:06,540 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:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:06,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1536922513, now seen corresponding path program 3 times [2022-07-13 02:17:06,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:06,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556911906] [2022-07-13 02:17:06,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:06,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:06,928 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,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:06,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556911906] [2022-07-13 02:17:06,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556911906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:17:06,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37095442] [2022-07-13 02:17:06,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:17:06,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:17:06,930 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:06,931 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:07,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2022-07-13 02:17:07,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:17:07,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:17:07,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:17:08,190 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:08,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:17:09,344 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:09,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37095442] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:17:09,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:17:09,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 75 [2022-07-13 02:17:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208081981] [2022-07-13 02:17:09,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:17:09,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-13 02:17:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:09,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-13 02:17:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=3702, Unknown=0, NotChecked=0, Total=5550 [2022-07-13 02:17:09,349 INFO L87 Difference]: Start difference. First operand 533 states and 693 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:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:18,523 INFO L93 Difference]: Finished difference Result 7075 states and 9196 transitions. [2022-07-13 02:17:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-07-13 02:17:18,524 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:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:18,538 INFO L225 Difference]: With dead ends: 7075 [2022-07-13 02:17:18,539 INFO L226 Difference]: Without dead ends: 6693 [2022-07-13 02:17:18,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15157 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=15016, Invalid=32726, Unknown=0, NotChecked=0, Total=47742 [2022-07-13 02:17:18,546 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 10206 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 3212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10206 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 4572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3212 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:18,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10206 Valid, 1651 Invalid, 4572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3212 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 02:17:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2022-07-13 02:17:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 660. [2022-07-13 02:17:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 628 states have (on average 1.3328025477707006) internal successors, (837), 651 states have internal predecessors, (837), 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:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 845 transitions. [2022-07-13 02:17:18,648 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 845 transitions. Word has length 139 [2022-07-13 02:17:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:18,649 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 845 transitions. [2022-07-13 02:17:18,649 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:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 845 transitions. [2022-07-13 02:17:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 02:17:18,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:18,652 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:18,663 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:18,857 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:18,857 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:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:18,858 INFO L85 PathProgramCache]: Analyzing trace with hash -216223147, now seen corresponding path program 4 times [2022-07-13 02:17:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:18,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445039207] [2022-07-13 02:17:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:17:18,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 02:17:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:17:18,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 02:17:18,929 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 02:17:18,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2022-07-13 02:17:18,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2022-07-13 02:17:18,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2022-07-13 02:17:18,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2022-07-13 02:17:18,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2022-07-13 02:17:18,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2022-07-13 02:17:18,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2022-07-13 02:17:18,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2022-07-13 02:17:18,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2022-07-13 02:17:18,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2022-07-13 02:17:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2022-07-13 02:17:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2022-07-13 02:17:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2022-07-13 02:17:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2022-07-13 02:17:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2022-07-13 02:17:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2022-07-13 02:17:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2022-07-13 02:17:18,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2022-07-13 02:17:18,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2022-07-13 02:17:18,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2022-07-13 02:17:18,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2022-07-13 02:17:18,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2022-07-13 02:17:18,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 02:17:18,938 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:18,942 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 02:17:19,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:17:19 BoogieIcfgContainer [2022-07-13 02:17:19,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 02:17:19,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 02:17:19,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 02:17:19,005 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 02:17:19,005 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:21" (3/4) ... [2022-07-13 02:17:19,007 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 02:17:19,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 02:17:19,007 INFO L158 Benchmark]: Toolchain (without parser) took 118074.95ms. Allocated memory was 86.0MB in the beginning and 343.9MB in the end (delta: 257.9MB). Free memory was 54.2MB in the beginning and 158.0MB in the end (delta: -103.9MB). Peak memory consumption was 156.2MB. Max. memory is 16.1GB. [2022-07-13 02:17:19,008 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 61.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:17:19,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.87ms. Allocated memory is still 86.0MB. Free memory was 54.0MB in the beginning and 61.1MB in the end (delta: -7.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 02:17:19,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.11ms. Allocated memory is still 86.0MB. Free memory was 61.1MB in the beginning and 58.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:17:19,008 INFO L158 Benchmark]: Boogie Preprocessor took 60.26ms. Allocated memory is still 86.0MB. Free memory was 58.6MB in the beginning and 57.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:17:19,008 INFO L158 Benchmark]: RCFGBuilder took 469.81ms. Allocated memory is still 86.0MB. Free memory was 57.1MB in the beginning and 56.3MB in the end (delta: 791.2kB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-07-13 02:17:19,009 INFO L158 Benchmark]: TraceAbstraction took 117269.58ms. Allocated memory was 86.0MB in the beginning and 343.9MB in the end (delta: 257.9MB). Free memory was 55.9MB in the beginning and 158.0MB in the end (delta: -102.1MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. [2022-07-13 02:17:19,009 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 343.9MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:17:19,010 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.16ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 61.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.87ms. Allocated memory is still 86.0MB. Free memory was 54.0MB in the beginning and 61.1MB in the end (delta: -7.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.11ms. Allocated memory is still 86.0MB. Free memory was 61.1MB in the beginning and 58.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.26ms. Allocated memory is still 86.0MB. Free memory was 58.6MB in the beginning and 57.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.81ms. Allocated memory is still 86.0MB. Free memory was 57.1MB in the beginning and 56.3MB in the end (delta: 791.2kB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 117269.58ms. Allocated memory was 86.0MB in the beginning and 343.9MB in the end (delta: 257.9MB). Free memory was 55.9MB in the beginning and 158.0MB in the end (delta: -102.1MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 343.9MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 sb ; [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, 143 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 117.2s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 104.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23041 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23035 mSDsluCounter, 19477 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17140 mSDsCounter, 6261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10228 IncrementalHoareTripleChecker+Invalid, 16489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6261 mSolverCounterUnsat, 2337 mSDtfsCounter, 10228 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2074 GetRequests, 1408 SyntacticMatches, 1 SemanticMatches, 665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24800 ImplicationChecksByTransitivity, 94.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred 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.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 14150 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 6.1s 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:19,122 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