./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c3fed411 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_2a.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 f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:05:15,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:05:15,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:05:15,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:05:15,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:05:15,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:05:15,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:05:15,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:05:15,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:05:15,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:05:15,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:05:15,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:05:15,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:05:15,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:05:15,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:05:15,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:05:15,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:05:15,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:05:15,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:05:15,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:05:15,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:05:15,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:05:15,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:05:15,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:05:15,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:05:15,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:05:15,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:05:15,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:05:15,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:05:15,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:05:15,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:05:15,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:05:15,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:05:15,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:05:15,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:05:15,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:05:15,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:05:15,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:05:15,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:05:15,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:05:15,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:05:15,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-16 09:05:15,262 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:05:15,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:05:15,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:05:15,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:05:15,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 09:05:15,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 09:05:15,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:05:15,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:05:15,264 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:05:15,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:05:15,265 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 09:05:15,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:05:15,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:05:15,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 09:05:15,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:05:15,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 09:05:15,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 09:05:15,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 09:05:15,266 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-16 09:05:15,266 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 09:05:15,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:05:15,267 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:05:15,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 09:05:15,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:05:15,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:05:15,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 09:05:15,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 09:05:15,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:05:15,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 09:05:15,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 09:05:15,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:05:15,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 09:05:15,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 09:05:15,270 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:05:15,270 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2021-12-16 09:05:15,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:05:15,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:05:15,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:05:15,509 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:05:15,510 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:05:15,511 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2021-12-16 09:05:15,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f2d3f4c/f76af363218342eb934c9c3deb49226c/FLAGcde5b09a8 [2021-12-16 09:05:15,929 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:05:15,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2021-12-16 09:05:15,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f2d3f4c/f76af363218342eb934c9c3deb49226c/FLAGcde5b09a8 [2021-12-16 09:05:15,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f2d3f4c/f76af363218342eb934c9c3deb49226c [2021-12-16 09:05:15,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:05:15,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:05:15,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:05:15,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:05:15,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:05:15,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:05:15" (1/1) ... [2021-12-16 09:05:15,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1408c14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:15, skipping insertion in model container [2021-12-16 09:05:15,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:05:15" (1/1) ... [2021-12-16 09:05:15,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:05:16,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:05:16,135 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_2a.c.cil.c[728,741] [2021-12-16 09:05:16,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:05:16,168 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:05:16,178 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_2a.c.cil.c[728,741] [2021-12-16 09:05:16,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:05:16,204 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:05:16,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16 WrapperNode [2021-12-16 09:05:16,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:05:16,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:05:16,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:05:16,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:05:16,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,249 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2021-12-16 09:05:16,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:05:16,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:05:16,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:05:16,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:05:16,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:05:16,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:05:16,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:05:16,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:05:16,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (1/1) ... [2021-12-16 09:05:16,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 09:05:16,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:16,312 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) [2021-12-16 09:05:16,322 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 [2021-12-16 09:05:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 09:05:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 09:05:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2021-12-16 09:05:16,339 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2021-12-16 09:05:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:05:16,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:05:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 09:05:16,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 09:05:16,385 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:05:16,386 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:05:16,644 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:05:16,651 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:05:16,652 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 09:05:16,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:05:16 BoogieIcfgContainer [2021-12-16 09:05:16,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:05:16,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 09:05:16,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 09:05:16,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 09:05:16,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:05:15" (1/3) ... [2021-12-16 09:05:16,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45376cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:05:16, skipping insertion in model container [2021-12-16 09:05:16,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:05:16" (2/3) ... [2021-12-16 09:05:16,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45376cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:05:16, skipping insertion in model container [2021-12-16 09:05:16,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:05:16" (3/3) ... [2021-12-16 09:05:16,659 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2021-12-16 09:05:16,662 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 09:05:16,662 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2021-12-16 09:05:16,691 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 09:05:16,695 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 09:05:16,696 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-12-16 09:05:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 80 states have internal predecessors, (102), 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) [2021-12-16 09:05:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-16 09:05:16,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:16,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:16,712 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash -146311098, now seen corresponding path program 1 times [2021-12-16 09:05:16,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:16,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852134235] [2021-12-16 09:05:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:16,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:05:16,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:16,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852134235] [2021-12-16 09:05:16,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852134235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:16,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:16,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 09:05:16,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470678301] [2021-12-16 09:05:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:16,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 09:05:16,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:16,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 09:05:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 09:05:16,859 INFO L87 Difference]: Start difference. First operand has 87 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 80 states have internal predecessors, (102), 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) [2021-12-16 09:05:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:16,900 INFO L93 Difference]: Finished difference Result 169 states and 225 transitions. [2021-12-16 09:05:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 09:05:16,903 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 [2021-12-16 09:05:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:16,910 INFO L225 Difference]: With dead ends: 169 [2021-12-16 09:05:16,910 INFO L226 Difference]: Without dead ends: 69 [2021-12-16 09:05:16,913 INFO L932 BasicCegarLoop]: 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 [2021-12-16 09:05:16,917 INFO L933 BasicCegarLoop]: 105 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, 105 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 [2021-12-16 09:05:16,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-16 09:05:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-16 09:05:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 63 states have internal predecessors, (73), 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) [2021-12-16 09:05:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2021-12-16 09:05:16,955 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 9 [2021-12-16 09:05:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:16,955 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2021-12-16 09:05:16,955 INFO L471 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) [2021-12-16 09:05:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2021-12-16 09:05:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-16 09:05:16,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:16,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:16,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 09:05:16,958 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -147252364, now seen corresponding path program 1 times [2021-12-16 09:05:16,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:16,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189469636] [2021-12-16 09:05:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:16,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:05:17,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:17,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189469636] [2021-12-16 09:05:17,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189469636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:17,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:17,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:05:17,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361146849] [2021-12-16 09:05:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:17,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 09:05:17,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:17,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:05:17,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:05:17,045 INFO L87 Difference]: Start difference. First operand 69 states and 81 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) [2021-12-16 09:05:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:17,134 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2021-12-16 09:05:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:05:17,135 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 [2021-12-16 09:05:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:17,137 INFO L225 Difference]: With dead ends: 175 [2021-12-16 09:05:17,138 INFO L226 Difference]: Without dead ends: 109 [2021-12-16 09:05:17,139 INFO L932 BasicCegarLoop]: 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 [2021-12-16 09:05:17,140 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 56 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:17,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 206 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 09:05:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-16 09:05:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2021-12-16 09:05:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 93 states have internal predecessors, (116), 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) [2021-12-16 09:05:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2021-12-16 09:05:17,156 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 9 [2021-12-16 09:05:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:17,158 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2021-12-16 09:05:17,158 INFO L471 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) [2021-12-16 09:05:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2021-12-16 09:05:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 09:05:17,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:17,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:17,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 09:05:17,162 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash 900800379, now seen corresponding path program 1 times [2021-12-16 09:05:17,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:17,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839461649] [2021-12-16 09:05:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:17,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:05:17,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:17,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839461649] [2021-12-16 09:05:17,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839461649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:17,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:17,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:05:17,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735018446] [2021-12-16 09:05:17,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:17,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 09:05:17,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:17,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:05:17,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:05:17,202 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-16 09:05:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:17,261 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2021-12-16 09:05:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:05:17,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2021-12-16 09:05:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:17,263 INFO L225 Difference]: With dead ends: 119 [2021-12-16 09:05:17,263 INFO L226 Difference]: Without dead ends: 117 [2021-12-16 09:05:17,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:05:17,265 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 72 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:17,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 279 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-16 09:05:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2021-12-16 09:05:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.4625) internal successors, (117), 95 states have internal predecessors, (117), 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) [2021-12-16 09:05:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2021-12-16 09:05:17,273 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 13 [2021-12-16 09:05:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:17,273 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2021-12-16 09:05:17,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-16 09:05:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2021-12-16 09:05:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-16 09:05:17,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:17,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:17,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 09:05:17,274 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2139959222, now seen corresponding path program 1 times [2021-12-16 09:05:17,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:17,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150236106] [2021-12-16 09:05:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:17,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:05:17,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:17,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150236106] [2021-12-16 09:05:17,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150236106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:17,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:17,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:05:17,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666280902] [2021-12-16 09:05:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:17,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 09:05:17,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:05:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:05:17,306 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:05:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:17,358 INFO L93 Difference]: Finished difference Result 222 states and 272 transitions. [2021-12-16 09:05:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:05:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-16 09:05:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:17,359 INFO L225 Difference]: With dead ends: 222 [2021-12-16 09:05:17,359 INFO L226 Difference]: Without dead ends: 123 [2021-12-16 09:05:17,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:05:17,361 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 94 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:17,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 220 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-16 09:05:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2021-12-16 09:05:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 99 states have internal predecessors, (121), 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) [2021-12-16 09:05:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2021-12-16 09:05:17,368 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 14 [2021-12-16 09:05:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:17,369 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2021-12-16 09:05:17,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:05:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2021-12-16 09:05:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 09:05:17,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:17,370 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:17,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 09:05:17,370 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash 762086754, now seen corresponding path program 1 times [2021-12-16 09:05:17,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:17,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529332133] [2021-12-16 09:05:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:17,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 09:05:17,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:17,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529332133] [2021-12-16 09:05:17,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529332133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:17,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:17,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 09:05:17,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241603261] [2021-12-16 09:05:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:17,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 09:05:17,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:17,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:05:17,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:05:17,390 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-12-16 09:05:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:17,409 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2021-12-16 09:05:17,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:05:17,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2021-12-16 09:05:17,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:17,410 INFO L225 Difference]: With dead ends: 112 [2021-12-16 09:05:17,411 INFO L226 Difference]: Without dead ends: 111 [2021-12-16 09:05:17,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:05:17,416 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:17,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 151 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-16 09:05:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2021-12-16 09:05:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 97 states have internal predecessors, (118), 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) [2021-12-16 09:05:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2021-12-16 09:05:17,438 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 15 [2021-12-16 09:05:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:17,439 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2021-12-16 09:05:17,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-12-16 09:05:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2021-12-16 09:05:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 09:05:17,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:17,440 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:17,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 09:05:17,440 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash 762088932, now seen corresponding path program 1 times [2021-12-16 09:05:17,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:17,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442178969] [2021-12-16 09:05:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:17,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:05:17,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:17,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442178969] [2021-12-16 09:05:17,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442178969] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:17,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441829105] [2021-12-16 09:05:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:17,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:17,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:17,512 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) [2021-12-16 09:05:17,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 09:05:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:17,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 09:05:17,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:05:17,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:05:17,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441829105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:17,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:05:17,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-16 09:05:17,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616960699] [2021-12-16 09:05:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:17,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 09:05:17,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:17,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:05:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:05:17,639 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-12-16 09:05:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:17,663 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2021-12-16 09:05:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:05:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2021-12-16 09:05:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:17,664 INFO L225 Difference]: With dead ends: 124 [2021-12-16 09:05:17,664 INFO L226 Difference]: Without dead ends: 123 [2021-12-16 09:05:17,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:05:17,665 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:17,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 236 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-16 09:05:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2021-12-16 09:05:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.411764705882353) internal successors, (120), 99 states have internal predecessors, (120), 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) [2021-12-16 09:05:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2021-12-16 09:05:17,670 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 15 [2021-12-16 09:05:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:17,670 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2021-12-16 09:05:17,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-12-16 09:05:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2021-12-16 09:05:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 09:05:17,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:17,672 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:17,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 09:05:17,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-16 09:05:17,890 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash 636845412, now seen corresponding path program 1 times [2021-12-16 09:05:17,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:17,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342638479] [2021-12-16 09:05:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:17,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 09:05:17,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:17,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342638479] [2021-12-16 09:05:17,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342638479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:17,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:17,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:05:17,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419215664] [2021-12-16 09:05:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:17,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 09:05:17,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:05:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:05:17,934 INFO L87 Difference]: Start difference. First operand 106 states and 128 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, (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) [2021-12-16 09:05:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:17,968 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2021-12-16 09:05:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:05:17,969 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-16 09:05:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:17,970 INFO L225 Difference]: With dead ends: 127 [2021-12-16 09:05:17,970 INFO L226 Difference]: Without dead ends: 125 [2021-12-16 09:05:17,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:05:17,971 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:17,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 221 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-16 09:05:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2021-12-16 09:05:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 96 states have internal predecessors, (116), 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) [2021-12-16 09:05:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2021-12-16 09:05:17,985 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 19 [2021-12-16 09:05:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:17,986 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2021-12-16 09:05:17,986 INFO L471 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, (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) [2021-12-16 09:05:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2021-12-16 09:05:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 09:05:17,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:17,991 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:17,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 09:05:17,992 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1627476746, now seen corresponding path program 1 times [2021-12-16 09:05:17,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:17,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768578974] [2021-12-16 09:05:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:17,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 09:05:18,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:18,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768578974] [2021-12-16 09:05:18,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768578974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:18,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:18,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:05:18,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443984361] [2021-12-16 09:05:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:18,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 09:05:18,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:18,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:05:18,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:05:18,069 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-12-16 09:05:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:18,120 INFO L93 Difference]: Finished difference Result 147 states and 178 transitions. [2021-12-16 09:05:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:05:18,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 23 [2021-12-16 09:05:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:18,124 INFO L225 Difference]: With dead ends: 147 [2021-12-16 09:05:18,124 INFO L226 Difference]: Without dead ends: 145 [2021-12-16 09:05:18,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:05:18,125 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:18,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 219 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-16 09:05:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2021-12-16 09:05:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 117 states have internal predecessors, (145), 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) [2021-12-16 09:05:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2021-12-16 09:05:18,134 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 23 [2021-12-16 09:05:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:18,134 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2021-12-16 09:05:18,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-12-16 09:05:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2021-12-16 09:05:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 09:05:18,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:18,137 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:18,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 09:05:18,137 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:18,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:18,138 INFO L85 PathProgramCache]: Analyzing trace with hash 250392734, now seen corresponding path program 1 times [2021-12-16 09:05:18,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:18,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812582383] [2021-12-16 09:05:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:18,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 09:05:18,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:18,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812582383] [2021-12-16 09:05:18,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812582383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:18,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:18,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:05:18,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387886548] [2021-12-16 09:05:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:18,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 09:05:18,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:18,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:05:18,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:05:18,210 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-16 09:05:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:18,260 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2021-12-16 09:05:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:05:18,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2021-12-16 09:05:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:18,264 INFO L225 Difference]: With dead ends: 141 [2021-12-16 09:05:18,264 INFO L226 Difference]: Without dead ends: 139 [2021-12-16 09:05:18,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:05:18,265 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 85 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:18,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 221 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-16 09:05:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 122. [2021-12-16 09:05:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.386138613861386) internal successors, (140), 114 states have internal predecessors, (140), 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) [2021-12-16 09:05:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2021-12-16 09:05:18,271 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 25 [2021-12-16 09:05:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:18,271 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2021-12-16 09:05:18,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-16 09:05:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2021-12-16 09:05:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 09:05:18,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:18,272 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:18,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 09:05:18,273 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:18,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1374389772, now seen corresponding path program 1 times [2021-12-16 09:05:18,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:18,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404795919] [2021-12-16 09:05:18,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:18,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 09:05:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 09:05:18,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:18,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404795919] [2021-12-16 09:05:18,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404795919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:18,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:18,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:05:18,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899828456] [2021-12-16 09:05:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:18,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 09:05:18,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:05:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:05:18,311 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 09:05:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:18,356 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2021-12-16 09:05:18,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:05:18,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2021-12-16 09:05:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:18,357 INFO L225 Difference]: With dead ends: 136 [2021-12-16 09:05:18,357 INFO L226 Difference]: Without dead ends: 134 [2021-12-16 09:05:18,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:05:18,358 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 94 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:18,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 212 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-16 09:05:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2021-12-16 09:05:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 108 states have internal predecessors, (132), 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) [2021-12-16 09:05:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2021-12-16 09:05:18,363 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 30 [2021-12-16 09:05:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:18,363 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2021-12-16 09:05:18,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 09:05:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2021-12-16 09:05:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 09:05:18,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:18,364 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:18,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 09:05:18,365 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1173906380, now seen corresponding path program 1 times [2021-12-16 09:05:18,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:18,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084154603] [2021-12-16 09:05:18,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:18,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 09:05:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 09:05:18,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:18,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084154603] [2021-12-16 09:05:18,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084154603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:18,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:05:18,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:05:18,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866942059] [2021-12-16 09:05:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:18,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 09:05:18,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:05:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:05:18,405 INFO L87 Difference]: Start difference. First operand 116 states and 140 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 09:05:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:18,442 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2021-12-16 09:05:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:05:18,442 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2021-12-16 09:05:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:18,443 INFO L225 Difference]: With dead ends: 130 [2021-12-16 09:05:18,443 INFO L226 Difference]: Without dead ends: 128 [2021-12-16 09:05:18,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:05:18,444 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 83 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:18,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 212 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-16 09:05:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 111. [2021-12-16 09:05:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.351063829787234) internal successors, (127), 103 states have internal predecessors, (127), 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) [2021-12-16 09:05:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2021-12-16 09:05:18,448 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 32 [2021-12-16 09:05:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:18,449 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2021-12-16 09:05:18,449 INFO L471 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 09:05:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2021-12-16 09:05:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 09:05:18,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:18,450 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:05:18,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 09:05:18,450 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1273705285, now seen corresponding path program 1 times [2021-12-16 09:05:18,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:18,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164487638] [2021-12-16 09:05:18,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:18,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 09:05:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 09:05:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 09:05:18,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:18,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164487638] [2021-12-16 09:05:18,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164487638] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:18,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132765469] [2021-12-16 09:05:18,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:18,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:18,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:18,493 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) [2021-12-16 09:05:18,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 09:05:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:18,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-16 09:05:18,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 09:05:18,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-16 09:05:18,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132765469] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:18,790 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:18,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 8] total 18 [2021-12-16 09:05:18,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986571025] [2021-12-16 09:05:18,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:18,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-16 09:05:18,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-16 09:05:18,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-12-16 09:05:18,791 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-16 09:05:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:19,030 INFO L93 Difference]: Finished difference Result 302 states and 366 transitions. [2021-12-16 09:05:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 09:05:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 36 [2021-12-16 09:05:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:19,031 INFO L225 Difference]: With dead ends: 302 [2021-12-16 09:05:19,031 INFO L226 Difference]: Without dead ends: 158 [2021-12-16 09:05:19,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2021-12-16 09:05:19,032 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 70 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:19,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 785 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 09:05:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-16 09:05:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2021-12-16 09:05:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3) internal successors, (117), 99 states have internal predecessors, (117), 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) [2021-12-16 09:05:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2021-12-16 09:05:19,037 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 36 [2021-12-16 09:05:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:19,038 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2021-12-16 09:05:19,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-16 09:05:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2021-12-16 09:05:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-16 09:05:19,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:19,038 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-12-16 09:05:19,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:19,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-16 09:05:19,256 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1255657985, now seen corresponding path program 1 times [2021-12-16 09:05:19,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:19,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884031962] [2021-12-16 09:05:19,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:19,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:19,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:19,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:19,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-16 09:05:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 09:05:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 09:05:19,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:19,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884031962] [2021-12-16 09:05:19,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884031962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:19,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630992660] [2021-12-16 09:05:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:19,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:19,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:19,372 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) [2021-12-16 09:05:19,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 09:05:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:19,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 09:05:19,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 09:05:19,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:19,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630992660] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:19,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:19,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2021-12-16 09:05:19,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175585731] [2021-12-16 09:05:19,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:19,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 09:05:19,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:19,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 09:05:19,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-16 09:05:19,674 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-16 09:05:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:20,026 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2021-12-16 09:05:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 09:05:20,027 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 49 [2021-12-16 09:05:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:20,027 INFO L225 Difference]: With dead ends: 257 [2021-12-16 09:05:20,027 INFO L226 Difference]: Without dead ends: 173 [2021-12-16 09:05:20,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2021-12-16 09:05:20,028 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 181 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:20,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 447 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 09:05:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-16 09:05:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 108. [2021-12-16 09:05:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 99 states have internal predecessors, (114), 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) [2021-12-16 09:05:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2021-12-16 09:05:20,033 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 49 [2021-12-16 09:05:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:20,033 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2021-12-16 09:05:20,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-16 09:05:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2021-12-16 09:05:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-16 09:05:20,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:20,034 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-12-16 09:05:20,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-16 09:05:20,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:20,235 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:20,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash -373684430, now seen corresponding path program 1 times [2021-12-16 09:05:20,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:20,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666821179] [2021-12-16 09:05:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:20,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:20,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:20,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 09:05:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 09:05:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 09:05:20,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:20,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666821179] [2021-12-16 09:05:20,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666821179] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:20,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160168420] [2021-12-16 09:05:20,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:20,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:20,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:20,308 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) [2021-12-16 09:05:20,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 09:05:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:20,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:05:20,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 09:05:20,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 09:05:20,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160168420] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:20,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:20,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-16 09:05:20,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541807562] [2021-12-16 09:05:20,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:20,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 09:05:20,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 09:05:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-12-16 09:05:20,625 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 09:05:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:20,773 INFO L93 Difference]: Finished difference Result 401 states and 455 transitions. [2021-12-16 09:05:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 09:05:20,774 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2021-12-16 09:05:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:20,777 INFO L225 Difference]: With dead ends: 401 [2021-12-16 09:05:20,777 INFO L226 Difference]: Without dead ends: 318 [2021-12-16 09:05:20,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2021-12-16 09:05:20,778 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:20,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 383 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 09:05:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-12-16 09:05:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 128. [2021-12-16 09:05:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.2545454545454546) internal successors, (138), 119 states have internal predecessors, (138), 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) [2021-12-16 09:05:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2021-12-16 09:05:20,792 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 55 [2021-12-16 09:05:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:20,793 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2021-12-16 09:05:20,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 09:05:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2021-12-16 09:05:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-16 09:05:20,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:20,794 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2021-12-16 09:05:20,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:21,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:21,015 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1080206945, now seen corresponding path program 1 times [2021-12-16 09:05:21,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:21,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452758385] [2021-12-16 09:05:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:21,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 09:05:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 09:05:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 09:05:21,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:21,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452758385] [2021-12-16 09:05:21,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452758385] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:21,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886531984] [2021-12-16 09:05:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:21,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:21,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:21,132 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) [2021-12-16 09:05:21,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 09:05:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 09:05:21,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 09:05:21,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 09:05:21,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886531984] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:21,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:05:21,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 9] total 18 [2021-12-16 09:05:21,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264146188] [2021-12-16 09:05:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:21,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 09:05:21,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 09:05:21,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-16 09:05:21,505 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 09:05:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:21,569 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2021-12-16 09:05:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 09:05:21,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2021-12-16 09:05:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:21,570 INFO L225 Difference]: With dead ends: 170 [2021-12-16 09:05:21,570 INFO L226 Difference]: Without dead ends: 131 [2021-12-16 09:05:21,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-12-16 09:05:21,571 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 6 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:21,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 415 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-16 09:05:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2021-12-16 09:05:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 119 states have internal predecessors, (136), 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) [2021-12-16 09:05:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2021-12-16 09:05:21,576 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 56 [2021-12-16 09:05:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:21,576 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2021-12-16 09:05:21,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 09:05:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2021-12-16 09:05:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 09:05:21,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:21,577 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1] [2021-12-16 09:05:21,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-16 09:05:21,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-16 09:05:21,787 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash -826377518, now seen corresponding path program 2 times [2021-12-16 09:05:21,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:21,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772405870] [2021-12-16 09:05:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:21,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 09:05:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 09:05:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:21,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:21,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772405870] [2021-12-16 09:05:21,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772405870] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:21,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342483106] [2021-12-16 09:05:21,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:05:21,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:21,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:21,849 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) [2021-12-16 09:05:21,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 09:05:21,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-16 09:05:21,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:05:21,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 09:05:21,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-16 09:05:21,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:05:21,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342483106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:21,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:05:21,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2021-12-16 09:05:21,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945023640] [2021-12-16 09:05:21,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:21,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 09:05:21,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:21,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:05:21,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-16 09:05:21,994 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 09:05:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:22,059 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2021-12-16 09:05:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 09:05:22,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2021-12-16 09:05:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:22,061 INFO L225 Difference]: With dead ends: 198 [2021-12-16 09:05:22,061 INFO L226 Difference]: Without dead ends: 196 [2021-12-16 09:05:22,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-12-16 09:05:22,062 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 116 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:22,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 564 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-16 09:05:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 145. [2021-12-16 09:05:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 135 states have internal predecessors, (155), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-16 09:05:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2021-12-16 09:05:22,071 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 60 [2021-12-16 09:05:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:22,071 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2021-12-16 09:05:22,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 09:05:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2021-12-16 09:05:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 09:05:22,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:22,072 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1] [2021-12-16 09:05:22,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:22,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-16 09:05:22,296 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash -826317936, now seen corresponding path program 1 times [2021-12-16 09:05:22,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:22,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591947787] [2021-12-16 09:05:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:22,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:22,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 09:05:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:22,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 09:05:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:22,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:22,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591947787] [2021-12-16 09:05:22,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591947787] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:22,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401619283] [2021-12-16 09:05:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:22,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:22,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:22,424 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) [2021-12-16 09:05:22,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 09:05:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:22,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 09:05:22,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 09:05:22,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:22,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401619283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:22,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:22,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-12-16 09:05:22,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260056625] [2021-12-16 09:05:22,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:22,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 09:05:22,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:22,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 09:05:22,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2021-12-16 09:05:22,701 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 09:05:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:22,928 INFO L93 Difference]: Finished difference Result 348 states and 394 transitions. [2021-12-16 09:05:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:05:22,929 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2021-12-16 09:05:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:22,930 INFO L225 Difference]: With dead ends: 348 [2021-12-16 09:05:22,930 INFO L226 Difference]: Without dead ends: 242 [2021-12-16 09:05:22,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2021-12-16 09:05:22,931 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 117 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:22,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 353 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 09:05:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-16 09:05:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 145. [2021-12-16 09:05:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 135 states have internal predecessors, (151), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-16 09:05:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2021-12-16 09:05:22,938 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 60 [2021-12-16 09:05:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:22,939 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2021-12-16 09:05:22,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 09:05:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2021-12-16 09:05:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-16 09:05:22,940 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:22,940 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 3, 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] [2021-12-16 09:05:22,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:23,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:23,152 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1838033761, now seen corresponding path program 1 times [2021-12-16 09:05:23,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:23,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389486220] [2021-12-16 09:05:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:23,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:23,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:23,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 09:05:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 09:05:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:23,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:23,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389486220] [2021-12-16 09:05:23,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389486220] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:23,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523421902] [2021-12-16 09:05:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:23,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:23,270 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) [2021-12-16 09:05:23,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 09:05:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:23,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 09:05:23,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 09:05:23,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:23,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523421902] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:23,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:23,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2021-12-16 09:05:23,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227317777] [2021-12-16 09:05:23,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:23,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-16 09:05:23,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:23,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-16 09:05:23,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2021-12-16 09:05:23,997 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 09:05:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:24,259 INFO L93 Difference]: Finished difference Result 663 states and 737 transitions. [2021-12-16 09:05:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 09:05:24,260 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2021-12-16 09:05:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:24,261 INFO L225 Difference]: With dead ends: 663 [2021-12-16 09:05:24,261 INFO L226 Difference]: Without dead ends: 563 [2021-12-16 09:05:24,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=297, Invalid=515, Unknown=0, NotChecked=0, Total=812 [2021-12-16 09:05:24,262 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 313 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:24,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 665 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 09:05:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-12-16 09:05:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 185. [2021-12-16 09:05:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 175 states have internal predecessors, (199), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-16 09:05:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2021-12-16 09:05:24,271 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 79 [2021-12-16 09:05:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:24,271 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2021-12-16 09:05:24,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 09:05:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2021-12-16 09:05:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-16 09:05:24,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:24,272 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 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] [2021-12-16 09:05:24,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:24,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-16 09:05:24,488 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1054874640, now seen corresponding path program 2 times [2021-12-16 09:05:24,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:24,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354830800] [2021-12-16 09:05:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:24,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:24,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 09:05:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:24,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 09:05:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:24,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:24,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354830800] [2021-12-16 09:05:24,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354830800] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:24,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973249052] [2021-12-16 09:05:24,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:05:24,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:24,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:24,604 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) [2021-12-16 09:05:24,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 09:05:24,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-16 09:05:24,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:05:24,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 09:05:24,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-16 09:05:24,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:05:24,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973249052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:05:24,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:05:24,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2021-12-16 09:05:24,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668556906] [2021-12-16 09:05:24,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:05:24,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 09:05:24,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:24,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 09:05:24,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-16 09:05:24,833 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 09:05:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:24,913 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2021-12-16 09:05:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:05:24,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 80 [2021-12-16 09:05:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:24,914 INFO L225 Difference]: With dead ends: 236 [2021-12-16 09:05:24,914 INFO L226 Difference]: Without dead ends: 235 [2021-12-16 09:05:24,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-12-16 09:05:24,915 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 115 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:24,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 559 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 09:05:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-12-16 09:05:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 185. [2021-12-16 09:05:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 166 states have (on average 1.1927710843373494) internal successors, (198), 175 states have internal predecessors, (198), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-16 09:05:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2021-12-16 09:05:24,922 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 80 [2021-12-16 09:05:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:24,922 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2021-12-16 09:05:24,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 09:05:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2021-12-16 09:05:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-16 09:05:24,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:24,923 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 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] [2021-12-16 09:05:24,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:25,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:25,127 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:25,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:25,128 INFO L85 PathProgramCache]: Analyzing trace with hash 64993556, now seen corresponding path program 1 times [2021-12-16 09:05:25,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:25,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946806666] [2021-12-16 09:05:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:25,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:25,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 09:05:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 09:05:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:25,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:25,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946806666] [2021-12-16 09:05:25,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946806666] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:25,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274863268] [2021-12-16 09:05:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:25,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:25,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:25,316 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) [2021-12-16 09:05:25,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-16 09:05:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:25,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 09:05:25,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 09:05:25,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:25,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274863268] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:25,948 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:25,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-16 09:05:25,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698233332] [2021-12-16 09:05:25,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:25,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-16 09:05:25,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:25,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-16 09:05:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2021-12-16 09:05:25,950 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 09:05:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:41,600 INFO L93 Difference]: Finished difference Result 476 states and 540 transitions. [2021-12-16 09:05:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-16 09:05:41,601 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2021-12-16 09:05:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:41,602 INFO L225 Difference]: With dead ends: 476 [2021-12-16 09:05:41,602 INFO L226 Difference]: Without dead ends: 370 [2021-12-16 09:05:41,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=501, Invalid=902, Unknown=3, NotChecked=0, Total=1406 [2021-12-16 09:05:41,603 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 218 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:41,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 790 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 09:05:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-16 09:05:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 185. [2021-12-16 09:05:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 166 states have (on average 1.144578313253012) internal successors, (190), 175 states have internal predecessors, (190), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-16 09:05:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 199 transitions. [2021-12-16 09:05:41,610 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 199 transitions. Word has length 82 [2021-12-16 09:05:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:41,611 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 199 transitions. [2021-12-16 09:05:41,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 09:05:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 199 transitions. [2021-12-16 09:05:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-16 09:05:41,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:41,612 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 4, 4, 3, 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] [2021-12-16 09:05:41,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:41,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:41,828 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash 684697381, now seen corresponding path program 1 times [2021-12-16 09:05:41,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:41,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918076572] [2021-12-16 09:05:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:41,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:42,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-16 09:05:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:42,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-16 09:05:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:42,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:42,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918076572] [2021-12-16 09:05:42,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918076572] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:42,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540703575] [2021-12-16 09:05:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:42,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:42,037 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) [2021-12-16 09:05:42,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-16 09:05:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:42,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 09:05:42,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 26 proven. 483 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 09:05:42,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:43,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540703575] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:43,137 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:43,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2021-12-16 09:05:43,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761984690] [2021-12-16 09:05:43,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:43,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-16 09:05:43,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-16 09:05:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2021-12-16 09:05:43,139 INFO L87 Difference]: Start difference. First operand 185 states and 199 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 09:05:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:43,518 INFO L93 Difference]: Finished difference Result 1143 states and 1263 transitions. [2021-12-16 09:05:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-16 09:05:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 121 [2021-12-16 09:05:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:43,522 INFO L225 Difference]: With dead ends: 1143 [2021-12-16 09:05:43,522 INFO L226 Difference]: Without dead ends: 1043 [2021-12-16 09:05:43,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=977, Invalid=1779, Unknown=0, NotChecked=0, Total=2756 [2021-12-16 09:05:43,524 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 1096 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:43,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1096 Valid, 622 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 09:05:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2021-12-16 09:05:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 265. [2021-12-16 09:05:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 246 states have (on average 1.1626016260162602) internal successors, (286), 255 states have internal predecessors, (286), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-16 09:05:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 295 transitions. [2021-12-16 09:05:43,539 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 295 transitions. Word has length 121 [2021-12-16 09:05:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:43,539 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 295 transitions. [2021-12-16 09:05:43,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 09:05:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 295 transitions. [2021-12-16 09:05:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-16 09:05:43,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:43,541 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 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] [2021-12-16 09:05:43,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:43,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-16 09:05:43,755 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1264921108, now seen corresponding path program 2 times [2021-12-16 09:05:43,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:43,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487459029] [2021-12-16 09:05:43,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:43,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:43,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:44,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 09:05:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-16 09:05:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 4 proven. 465 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:44,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487459029] [2021-12-16 09:05:44,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487459029] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835732142] [2021-12-16 09:05:44,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:05:44,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:44,092 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) [2021-12-16 09:05:44,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-16 09:05:44,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:05:44,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:05:44,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 09:05:44,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-12-16 09:05:44,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-12-16 09:05:44,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835732142] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:44,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:44,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 30 [2021-12-16 09:05:44,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595658257] [2021-12-16 09:05:44,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:44,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-16 09:05:44,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-16 09:05:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2021-12-16 09:05:44,741 INFO L87 Difference]: Start difference. First operand 265 states and 295 transitions. Second operand has 30 states, 30 states have (on average 4.8) internal successors, (144), 28 states have internal predecessors, (144), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 09:05:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:05:45,564 INFO L93 Difference]: Finished difference Result 596 states and 679 transitions. [2021-12-16 09:05:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-16 09:05:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.8) internal successors, (144), 28 states have internal predecessors, (144), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 122 [2021-12-16 09:05:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:05:45,568 INFO L225 Difference]: With dead ends: 596 [2021-12-16 09:05:45,568 INFO L226 Difference]: Without dead ends: 496 [2021-12-16 09:05:45,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2021-12-16 09:05:45,569 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 511 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 09:05:45,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 1620 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 09:05:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-12-16 09:05:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 282. [2021-12-16 09:05:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 261 states have (on average 1.157088122605364) internal successors, (302), 269 states have internal predecessors, (302), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 09:05:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 315 transitions. [2021-12-16 09:05:45,581 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 315 transitions. Word has length 122 [2021-12-16 09:05:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:05:45,581 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 315 transitions. [2021-12-16 09:05:45,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.8) internal successors, (144), 28 states have internal predecessors, (144), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 09:05:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 315 transitions. [2021-12-16 09:05:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-16 09:05:45,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:05:45,586 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 3, 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] [2021-12-16 09:05:45,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-16 09:05:45,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-16 09:05:45,799 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:05:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:05:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1327307402, now seen corresponding path program 1 times [2021-12-16 09:05:45,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:05:45,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995983862] [2021-12-16 09:05:45,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:45,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:05:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:05:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:05:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:46,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 09:05:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:46,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-16 09:05:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 4 proven. 535 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:46,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:05:46,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995983862] [2021-12-16 09:05:46,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995983862] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:05:46,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995619868] [2021-12-16 09:05:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:05:46,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:05:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:05:46,113 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:05:46,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-16 09:05:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:05:46,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-16 09:05:46,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:05:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 26 proven. 525 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 09:05:46,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:05:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 4 proven. 535 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-16 09:05:47,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995619868] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:05:47,634 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:05:47,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2021-12-16 09:05:47,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514241841] [2021-12-16 09:05:47,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:05:47,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-16 09:05:47,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:05:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-16 09:05:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=1986, Unknown=0, NotChecked=0, Total=2652 [2021-12-16 09:05:47,636 INFO L87 Difference]: Start difference. First operand 282 states and 315 transitions. Second operand has 52 states, 52 states have (on average 5.346153846153846) internal successors, (278), 52 states have internal predecessors, (278), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 09:06:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:06:19,745 INFO L93 Difference]: Finished difference Result 708 states and 810 transitions. [2021-12-16 09:06:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-16 09:06:19,747 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.346153846153846) internal successors, (278), 52 states have internal predecessors, (278), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 128 [2021-12-16 09:06:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:06:19,751 INFO L225 Difference]: With dead ends: 708 [2021-12-16 09:06:19,751 INFO L226 Difference]: Without dead ends: 585 [2021-12-16 09:06:19,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=1640, Invalid=3902, Unknown=8, NotChecked=0, Total=5550 [2021-12-16 09:06:19,753 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 480 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 09:06:19,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 2191 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 09:06:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2021-12-16 09:06:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 282. [2021-12-16 09:06:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 269 states have internal predecessors, (293), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 09:06:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 306 transitions. [2021-12-16 09:06:19,777 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 306 transitions. Word has length 128 [2021-12-16 09:06:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:06:19,778 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 306 transitions. [2021-12-16 09:06:19,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.346153846153846) internal successors, (278), 52 states have internal predecessors, (278), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-16 09:06:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 306 transitions. [2021-12-16 09:06:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-16 09:06:19,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:06:19,779 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 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] [2021-12-16 09:06:19,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-16 09:06:19,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-16 09:06:19,995 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:06:19,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:06:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -110661052, now seen corresponding path program 2 times [2021-12-16 09:06:19,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:06:19,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429266149] [2021-12-16 09:06:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:06:19,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:06:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:20,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:06:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:20,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:06:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 09:06:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-16 09:06:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2021-12-16 09:06:20,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:06:20,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429266149] [2021-12-16 09:06:20,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429266149] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:06:20,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845152312] [2021-12-16 09:06:20,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:06:20,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:06:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:06:20,220 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:06:20,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-16 09:06:20,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-16 09:06:20,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:06:20,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 09:06:20,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:06:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2021-12-16 09:06:20,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:06:20,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845152312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:06:20,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:06:20,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2021-12-16 09:06:20,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797894050] [2021-12-16 09:06:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:06:20,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 09:06:20,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:06:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 09:06:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-12-16 09:06:20,693 INFO L87 Difference]: Start difference. First operand 282 states and 306 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 09:06:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:06:20,876 INFO L93 Difference]: Finished difference Result 335 states and 359 transitions. [2021-12-16 09:06:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:06:20,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 173 [2021-12-16 09:06:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:06:20,877 INFO L225 Difference]: With dead ends: 335 [2021-12-16 09:06:20,878 INFO L226 Difference]: Without dead ends: 332 [2021-12-16 09:06:20,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-12-16 09:06:20,878 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 80 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 09:06:20,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 502 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 09:06:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-12-16 09:06:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 293. [2021-12-16 09:06:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.1323529411764706) internal successors, (308), 280 states have internal predecessors, (308), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 09:06:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 321 transitions. [2021-12-16 09:06:20,895 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 321 transitions. Word has length 173 [2021-12-16 09:06:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:06:20,896 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 321 transitions. [2021-12-16 09:06:20,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-16 09:06:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 321 transitions. [2021-12-16 09:06:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-16 09:06:20,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:06:20,897 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 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, 1] [2021-12-16 09:06:20,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-16 09:06:21,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:06:21,111 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:06:21,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:06:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash 864474836, now seen corresponding path program 1 times [2021-12-16 09:06:21,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:06:21,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569019879] [2021-12-16 09:06:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:06:21,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:06:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:21,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 09:06:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:21,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 09:06:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:21,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 09:06:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-16 09:06:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:06:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2021-12-16 09:06:21,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:06:21,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569019879] [2021-12-16 09:06:21,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569019879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:06:21,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:06:21,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-16 09:06:21,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122243450] [2021-12-16 09:06:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:06:21,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 09:06:21,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:06:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 09:06:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-12-16 09:06:21,458 INFO L87 Difference]: Start difference. First operand 293 states and 321 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 09:06:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:06:21,683 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2021-12-16 09:06:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:06:21,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 174 [2021-12-16 09:06:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 09:06:21,685 INFO L225 Difference]: With dead ends: 348 [2021-12-16 09:06:21,685 INFO L226 Difference]: Without dead ends: 342 [2021-12-16 09:06:21,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-16 09:06:21,686 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 127 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 09:06:21,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 551 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 09:06:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-12-16 09:06:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 311. [2021-12-16 09:06:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 290 states have (on average 1.1310344827586207) internal successors, (328), 298 states have internal predecessors, (328), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-16 09:06:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2021-12-16 09:06:21,699 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 174 [2021-12-16 09:06:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 09:06:21,699 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2021-12-16 09:06:21,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 09:06:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2021-12-16 09:06:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-16 09:06:21,703 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 09:06:21,703 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 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] [2021-12-16 09:06:21,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 09:06:21,704 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2021-12-16 09:06:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:06:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1614496444, now seen corresponding path program 1 times [2021-12-16 09:06:21,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:06:21,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498096844] [2021-12-16 09:06:21,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:06:21,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:06:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:06:21,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:06:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:06:21,782 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:06:21,782 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 09:06:21,782 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2021-12-16 09:06:21,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2021-12-16 09:06:21,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2021-12-16 09:06:21,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2021-12-16 09:06:21,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2021-12-16 09:06:21,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2021-12-16 09:06:21,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2021-12-16 09:06:21,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2021-12-16 09:06:21,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2021-12-16 09:06:21,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2021-12-16 09:06:21,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2021-12-16 09:06:21,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2021-12-16 09:06:21,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2021-12-16 09:06:21,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2021-12-16 09:06:21,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2021-12-16 09:06:21,786 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2021-12-16 09:06:21,786 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2021-12-16 09:06:21,786 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2021-12-16 09:06:21,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-16 09:06:21,788 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:06:21,790 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 09:06:21,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:06:21 BoogieIcfgContainer [2021-12-16 09:06:21,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 09:06:21,840 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 09:06:21,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 09:06:21,840 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 09:06:21,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:05:16" (3/4) ... [2021-12-16 09:06:21,842 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 09:06:21,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 09:06:21,844 INFO L158 Benchmark]: Toolchain (without parser) took 65883.54ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 44.8MB in the beginning and 102.2MB in the end (delta: -57.4MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2021-12-16 09:06:21,844 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:06:21,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.04ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.6MB in the beginning and 71.9MB in the end (delta: -27.3MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2021-12-16 09:06:21,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.95ms. Allocated memory is still 98.6MB. Free memory was 71.9MB in the beginning and 69.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 09:06:21,845 INFO L158 Benchmark]: Boogie Preprocessor took 25.91ms. Allocated memory is still 98.6MB. Free memory was 69.9MB in the beginning and 68.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 09:06:21,845 INFO L158 Benchmark]: RCFGBuilder took 372.00ms. Allocated memory is still 98.6MB. Free memory was 68.6MB in the beginning and 53.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-16 09:06:21,845 INFO L158 Benchmark]: TraceAbstraction took 65181.69ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 53.5MB in the beginning and 102.2MB in the end (delta: -48.7MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2021-12-16 09:06:21,846 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 144.7MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:06:21,847 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.18ms. Allocated memory is still 81.8MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.04ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.6MB in the beginning and 71.9MB in the end (delta: -27.3MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.95ms. Allocated memory is still 98.6MB. Free memory was 71.9MB in the beginning and 69.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.91ms. Allocated memory is still 98.6MB. Free memory was 69.9MB in the beginning and 68.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.00ms. Allocated memory is still 98.6MB. Free memory was 68.6MB in the beginning and 53.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 65181.69ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 53.5MB in the beginning and 102.2MB in the end (delta: -48.7MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 144.7MB. Free memory is still 102.2MB. 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: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 173, overapproximation of bitwiseAnd at line 174. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sa ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=127, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24] [L77] EXPR e + 128 [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=2, e=-24, res=2] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=36028797018963970, __retres4=2, e=-24, res=2] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=36028797018963970, ea=127, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, one=2, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L77] EXPR e + 128 [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=1, e=0, res=1] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=36028797018963969, __retres4=1, e=0, res=1] [L241] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=36028797018963969, ea=127, eb=0, ma=33554432, mb=16777216, one=2, zero=0] [L241] b = base2flt(mb, eb) [L243] COND FALSE !(a < zero) VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, one=2, zero=0] [L246] COND TRUE a > zero [L247] tmp = 1 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, one=2, tmp=1, zero=0] [L251] sa = tmp VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, one=2, sa=1, tmp=1, zero=0] [L254] CALL mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L158] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L165] COND FALSE !(! b) [L171] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L172] EXPR (int )(a >> 24U) - 128 [L172] ea = (int )(a >> 24U) - 128 [L173] ma = ma | (1U << 24U) [L174] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127] [L175] (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127] - 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 65.1s, OverallIterations: 26, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 51.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4214 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4202 mSDsluCounter, 12729 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10841 mSDsCounter, 736 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5346 IncrementalHoareTripleChecker+Invalid, 6082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 736 mSolverCounterUnsat, 1888 mSDtfsCounter, 5346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2314 GetRequests, 1880 SyntacticMatches, 4 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3467 ImplicationChecksByTransitivity, 50.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=25, InterpolantAutomatonStates: 321, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 2593 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 2769 NumberOfCodeBlocks, 2522 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3334 ConstructedInterpolants, 0 QuantifiedInterpolants, 12045 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2272 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 49 InterpolantComputations, 16 PerfectInterpolantSequences, 6246/10574 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 [2021-12-16 09:06:21,937 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