./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version ff03de63 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_5a.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 f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 20:50:20,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 20:50:20,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 20:50:20,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 20:50:20,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 20:50:20,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 20:50:20,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 20:50:20,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 20:50:20,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 20:50:20,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 20:50:20,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 20:50:20,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 20:50:20,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 20:50:20,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 20:50:20,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 20:50:20,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 20:50:20,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 20:50:20,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 20:50:20,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 20:50:20,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 20:50:20,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 20:50:20,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 20:50:20,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 20:50:20,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 20:50:20,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 20:50:20,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 20:50:20,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 20:50:20,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 20:50:20,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 20:50:20,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 20:50:20,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 20:50:20,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 20:50:20,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 20:50:20,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 20:50:20,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 20:50:20,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 20:50:20,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 20:50:20,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 20:50:20,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 20:50:20,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 20:50:20,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 20:50:20,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-21 20:50:20,659 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 20:50:20,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 20:50:20,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 20:50:20,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 20:50:20,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 20:50:20,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 20:50:20,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 20:50:20,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 20:50:20,664 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 20:50:20,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 20:50:20,665 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 20:50:20,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 20:50:20,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 20:50:20,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 20:50:20,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 20:50:20,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 20:50:20,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 20:50:20,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 20:50:20,666 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-21 20:50:20,666 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 20:50:20,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 20:50:20,667 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 20:50:20,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 20:50:20,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 20:50:20,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 20:50:20,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 20:50:20,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:50:20,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 20:50:20,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 20:50:20,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 20:50:20,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 20:50:20,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 20:50:20,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 20:50:20,670 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 20:50:20,670 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 -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2021-12-21 20:50:20,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 20:50:20,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 20:50:20,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 20:50:20,886 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 20:50:20,887 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 20:50:20,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2021-12-21 20:50:20,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4989de76/cc71094f41304dbcbaccd1e393b525ae/FLAG016a62577 [2021-12-21 20:50:21,295 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 20:50:21,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2021-12-21 20:50:21,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4989de76/cc71094f41304dbcbaccd1e393b525ae/FLAG016a62577 [2021-12-21 20:50:21,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4989de76/cc71094f41304dbcbaccd1e393b525ae [2021-12-21 20:50:21,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 20:50:21,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 20:50:21,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 20:50:21,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 20:50:21,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 20:50:21,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5983b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21, skipping insertion in model container [2021-12-21 20:50:21,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 20:50:21,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:50:21,438 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_5a.c.cil.c[728,741] [2021-12-21 20:50:21,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:50:21,478 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 20:50:21,486 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_5a.c.cil.c[728,741] [2021-12-21 20:50:21,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:50:21,532 INFO L208 MainTranslator]: Completed translation [2021-12-21 20:50:21,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21 WrapperNode [2021-12-21 20:50:21,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 20:50:21,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 20:50:21,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 20:50:21,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 20:50:21,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,579 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2021-12-21 20:50:21,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 20:50:21,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 20:50:21,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 20:50:21,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 20:50:21,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 20:50:21,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 20:50:21,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 20:50:21,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 20:50:21,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (1/1) ... [2021-12-21 20:50:21,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:50:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:21,642 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-21 20:50:21,643 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-21 20:50:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 20:50:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 20:50:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2021-12-21 20:50:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2021-12-21 20:50:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 20:50:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 20:50:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-21 20:50:21,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-21 20:50:21,710 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 20:50:21,711 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 20:50:21,888 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 20:50:21,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 20:50:21,892 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 20:50:21,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:21 BoogieIcfgContainer [2021-12-21 20:50:21,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 20:50:21,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 20:50:21,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 20:50:21,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 20:50:21,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:50:21" (1/3) ... [2021-12-21 20:50:21,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a7a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:50:21, skipping insertion in model container [2021-12-21 20:50:21,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:21" (2/3) ... [2021-12-21 20:50:21,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a7a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:50:21, skipping insertion in model container [2021-12-21 20:50:21,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:21" (3/3) ... [2021-12-21 20:50:21,899 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2021-12-21 20:50:21,902 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 20:50:21,903 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-12-21 20:50:21,931 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 20:50:21,935 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-21 20:50:21,935 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-12-21 20:50:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 76 states have internal predecessors, (98), 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-21 20:50:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 20:50:21,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:21,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:21,954 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash 598641474, now seen corresponding path program 1 times [2021-12-21 20:50:21,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:21,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066439609] [2021-12-21 20:50:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:21,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:22,049 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-21 20:50:22,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:22,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066439609] [2021-12-21 20:50:22,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066439609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:22,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:22,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:50:22,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389514296] [2021-12-21 20:50:22,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:22,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 20:50:22,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:22,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 20:50:22,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 20:50:22,073 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 76 states have internal predecessors, (98), 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-21 20:50:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:22,098 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2021-12-21 20:50:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 20:50:22,100 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-21 20:50:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:22,105 INFO L225 Difference]: With dead ends: 161 [2021-12-21 20:50:22,105 INFO L226 Difference]: Without dead ends: 63 [2021-12-21 20:50:22,108 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-21 20:50:22,110 INFO L933 BasicCegarLoop]: 101 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, 101 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-21 20:50:22,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-21 20:50:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-21 20:50:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.5) internal successors, (66), 57 states have internal predecessors, (66), 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-21 20:50:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2021-12-21 20:50:22,137 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 9 [2021-12-21 20:50:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:22,137 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2021-12-21 20:50:22,137 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-21 20:50:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2021-12-21 20:50:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 20:50:22,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:22,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:22,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 20:50:22,139 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 597700208, now seen corresponding path program 1 times [2021-12-21 20:50:22,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:22,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071866947] [2021-12-21 20:50:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:22,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:22,204 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-21 20:50:22,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:22,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071866947] [2021-12-21 20:50:22,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071866947] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:22,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:22,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:50:22,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470093666] [2021-12-21 20:50:22,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:22,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:22,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:50:22,207 INFO L87 Difference]: Start difference. First operand 63 states and 74 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-21 20:50:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:22,271 INFO L93 Difference]: Finished difference Result 163 states and 201 transitions. [2021-12-21 20:50:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:22,272 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-21 20:50:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:22,274 INFO L225 Difference]: With dead ends: 163 [2021-12-21 20:50:22,274 INFO L226 Difference]: Without dead ends: 103 [2021-12-21 20:50:22,275 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-21 20:50:22,276 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 56 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 185 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.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:22,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 185 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-21 20:50:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2021-12-21 20:50:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.472972972972973) internal successors, (109), 87 states have internal predecessors, (109), 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-21 20:50:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2021-12-21 20:50:22,294 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 9 [2021-12-21 20:50:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:22,295 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2021-12-21 20:50:22,295 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-21 20:50:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2021-12-21 20:50:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 20:50:22,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:22,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:22,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 20:50:22,298 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -501328777, now seen corresponding path program 1 times [2021-12-21 20:50:22,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:22,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386589988] [2021-12-21 20:50:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:22,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:22,397 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-21 20:50:22,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:22,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386589988] [2021-12-21 20:50:22,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386589988] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:22,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:22,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:22,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406834941] [2021-12-21 20:50:22,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:22,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:22,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:22,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:22,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:22,400 INFO L87 Difference]: Start difference. First operand 94 states and 117 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-21 20:50:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:22,498 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2021-12-21 20:50:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:22,499 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-21 20:50:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:22,500 INFO L225 Difference]: With dead ends: 113 [2021-12-21 20:50:22,500 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 20:50:22,500 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-21 20:50:22,503 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 72 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 251 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:22,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 251 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 20:50:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2021-12-21 20:50:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 89 states have internal predecessors, (110), 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-21 20:50:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2021-12-21 20:50:22,513 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 13 [2021-12-21 20:50:22,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:22,513 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2021-12-21 20:50:22,513 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-21 20:50:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2021-12-21 20:50:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 20:50:22,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:22,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:22,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 20:50:22,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1638677198, now seen corresponding path program 1 times [2021-12-21 20:50:22,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:22,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28024536] [2021-12-21 20:50:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:22,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:22,546 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-21 20:50:22,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28024536] [2021-12-21 20:50:22,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28024536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:22,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:22,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:22,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005523935] [2021-12-21 20:50:22,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:22,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:22,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:22,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:22,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:22,548 INFO L87 Difference]: Start difference. First operand 96 states and 118 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-21 20:50:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:22,612 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2021-12-21 20:50:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:22,613 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-21 20:50:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:22,614 INFO L225 Difference]: With dead ends: 210 [2021-12-21 20:50:22,614 INFO L226 Difference]: Without dead ends: 117 [2021-12-21 20:50:22,614 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-21 20:50:22,615 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 199 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-21 20:50:22,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 199 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-21 20:50:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2021-12-21 20:50:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.425) internal successors, (114), 93 states have internal predecessors, (114), 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-21 20:50:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2021-12-21 20:50:22,624 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 14 [2021-12-21 20:50:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:22,626 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2021-12-21 20:50:22,626 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-21 20:50:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2021-12-21 20:50:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 20:50:22,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:22,627 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:22,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 20:50:22,627 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1935698782, now seen corresponding path program 1 times [2021-12-21 20:50:22,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:22,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900513848] [2021-12-21 20:50:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:22,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:22,679 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-21 20:50:22,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:22,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900513848] [2021-12-21 20:50:22,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900513848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:22,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:22,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:50:22,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989106092] [2021-12-21 20:50:22,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:22,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:50:22,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:22,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:50:22,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:50:22,681 INFO L87 Difference]: Start difference. First operand 100 states and 122 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-21 20:50:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:22,697 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2021-12-21 20:50:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:50:22,697 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-21 20:50:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:22,698 INFO L225 Difference]: With dead ends: 106 [2021-12-21 20:50:22,698 INFO L226 Difference]: Without dead ends: 105 [2021-12-21 20:50:22,699 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-21 20:50:22,700 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 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-21 20:50:22,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-21 20:50:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2021-12-21 20:50:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 91 states have internal predecessors, (111), 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-21 20:50:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2021-12-21 20:50:22,707 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 15 [2021-12-21 20:50:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:22,707 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2021-12-21 20:50:22,707 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-21 20:50:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2021-12-21 20:50:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 20:50:22,708 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:22,708 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:22,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 20:50:22,708 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:22,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1935700960, now seen corresponding path program 1 times [2021-12-21 20:50:22,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475908064] [2021-12-21 20:50:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:22,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:22,737 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-21 20:50:22,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:22,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475908064] [2021-12-21 20:50:22,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475908064] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:22,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326423328] [2021-12-21 20:50:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:22,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:22,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:22,751 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-21 20:50:22,774 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-21 20:50:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:22,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:50:22,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:22,842 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-21 20:50:22,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:50:22,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326423328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:22,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:50:22,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-21 20:50:22,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898154349] [2021-12-21 20:50:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:22,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:22,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:50:22,845 INFO L87 Difference]: Start difference. First operand 98 states and 119 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-21 20:50:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:22,866 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2021-12-21 20:50:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:22,866 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-21 20:50:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:22,867 INFO L225 Difference]: With dead ends: 118 [2021-12-21 20:50:22,867 INFO L226 Difference]: Without dead ends: 117 [2021-12-21 20:50:22,868 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-21 20:50:22,869 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:22,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 152 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-21 20:50:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2021-12-21 20:50:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 93 states have internal predecessors, (113), 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-21 20:50:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2021-12-21 20:50:22,875 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 15 [2021-12-21 20:50:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:22,876 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2021-12-21 20:50:22,876 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-21 20:50:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2021-12-21 20:50:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-21 20:50:22,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:22,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:22,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:23,093 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-21 20:50:23,094 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:23,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash -481426080, now seen corresponding path program 1 times [2021-12-21 20:50:23,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:23,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299430067] [2021-12-21 20:50:23,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:23,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,136 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-21 20:50:23,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:23,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299430067] [2021-12-21 20:50:23,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299430067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:23,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:23,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:50:23,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488369276] [2021-12-21 20:50:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:23,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:23,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:50:23,138 INFO L87 Difference]: Start difference. First operand 100 states and 121 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-21 20:50:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:23,159 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2021-12-21 20:50:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:23,160 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-21 20:50:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:23,160 INFO L225 Difference]: With dead ends: 121 [2021-12-21 20:50:23,161 INFO L226 Difference]: Without dead ends: 119 [2021-12-21 20:50:23,161 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-21 20:50:23,161 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 13 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:23,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 141 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-21 20:50:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2021-12-21 20:50:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.379746835443038) internal successors, (109), 90 states have internal predecessors, (109), 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-21 20:50:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2021-12-21 20:50:23,193 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 19 [2021-12-21 20:50:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:23,193 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2021-12-21 20:50:23,194 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-21 20:50:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2021-12-21 20:50:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 20:50:23,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:23,199 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-21 20:50:23,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 20:50:23,199 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash 976326642, now seen corresponding path program 1 times [2021-12-21 20:50:23,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:23,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659584003] [2021-12-21 20:50:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:23,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,276 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-21 20:50:23,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:23,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659584003] [2021-12-21 20:50:23,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659584003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:23,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:23,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:23,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453906972] [2021-12-21 20:50:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:23,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:23,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:23,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:23,278 INFO L87 Difference]: Start difference. First operand 97 states and 117 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-21 20:50:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:23,340 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2021-12-21 20:50:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:23,342 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-21 20:50:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:23,343 INFO L225 Difference]: With dead ends: 141 [2021-12-21 20:50:23,343 INFO L226 Difference]: Without dead ends: 139 [2021-12-21 20:50:23,343 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-21 20:50:23,344 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 89 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 198 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:23,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 198 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-21 20:50:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2021-12-21 20:50:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 111 states have internal predecessors, (138), 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-21 20:50:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2021-12-21 20:50:23,357 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 23 [2021-12-21 20:50:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:23,357 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2021-12-21 20:50:23,358 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-21 20:50:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2021-12-21 20:50:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 20:50:23,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:23,359 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-21 20:50:23,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 20:50:23,359 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1460484966, now seen corresponding path program 1 times [2021-12-21 20:50:23,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:23,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905920916] [2021-12-21 20:50:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:23,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,423 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-21 20:50:23,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905920916] [2021-12-21 20:50:23,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905920916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:23,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:23,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:23,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732583335] [2021-12-21 20:50:23,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:23,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:23,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:23,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:23,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:23,426 INFO L87 Difference]: Start difference. First operand 119 states and 146 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-21 20:50:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:23,474 INFO L93 Difference]: Finished difference Result 135 states and 162 transitions. [2021-12-21 20:50:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:23,474 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-21 20:50:23,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:23,477 INFO L225 Difference]: With dead ends: 135 [2021-12-21 20:50:23,477 INFO L226 Difference]: Without dead ends: 133 [2021-12-21 20:50:23,478 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-21 20:50:23,478 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 78 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 200 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-21 20:50:23,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 200 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-21 20:50:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2021-12-21 20:50:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 108 states have internal predecessors, (133), 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-21 20:50:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2021-12-21 20:50:23,485 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 25 [2021-12-21 20:50:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:23,485 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2021-12-21 20:50:23,485 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-21 20:50:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2021-12-21 20:50:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 20:50:23,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:23,487 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-21 20:50:23,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 20:50:23,487 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:23,488 INFO L85 PathProgramCache]: Analyzing trace with hash 18081416, now seen corresponding path program 1 times [2021-12-21 20:50:23,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:23,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240842339] [2021-12-21 20:50:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:23,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:50:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,533 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-21 20:50:23,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:23,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240842339] [2021-12-21 20:50:23,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240842339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:23,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:23,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:23,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029276270] [2021-12-21 20:50:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:23,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:23,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:23,535 INFO L87 Difference]: Start difference. First operand 116 states and 141 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-21 20:50:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:23,584 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2021-12-21 20:50:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:23,585 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-21 20:50:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:23,586 INFO L225 Difference]: With dead ends: 130 [2021-12-21 20:50:23,586 INFO L226 Difference]: Without dead ends: 128 [2021-12-21 20:50:23,586 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-21 20:50:23,587 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 87 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 191 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-21 20:50:23,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 191 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-21 20:50:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2021-12-21 20:50:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 102 states have internal predecessors, (125), 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-21 20:50:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2021-12-21 20:50:23,594 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 30 [2021-12-21 20:50:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:23,594 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2021-12-21 20:50:23,595 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-21 20:50:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2021-12-21 20:50:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 20:50:23,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:23,597 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-21 20:50:23,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 20:50:23,600 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:23,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:23,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1083821488, now seen corresponding path program 1 times [2021-12-21 20:50:23,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:23,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973877702] [2021-12-21 20:50:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:23,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:50:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,654 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-21 20:50:23,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:23,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973877702] [2021-12-21 20:50:23,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973877702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:23,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:23,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:23,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211629820] [2021-12-21 20:50:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:23,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:23,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:23,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:23,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:23,656 INFO L87 Difference]: Start difference. First operand 110 states and 133 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-21 20:50:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:23,731 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2021-12-21 20:50:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:23,743 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-21 20:50:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:23,744 INFO L225 Difference]: With dead ends: 124 [2021-12-21 20:50:23,744 INFO L226 Difference]: Without dead ends: 122 [2021-12-21 20:50:23,744 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-21 20:50:23,745 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 76 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 191 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-21 20:50:23,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 191 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-21 20:50:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2021-12-21 20:50:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 97 states have internal predecessors, (120), 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-21 20:50:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2021-12-21 20:50:23,750 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 32 [2021-12-21 20:50:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:23,750 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2021-12-21 20:50:23,750 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-21 20:50:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2021-12-21 20:50:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 20:50:23,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:23,751 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-21 20:50:23,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 20:50:23,751 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1149948741, now seen corresponding path program 1 times [2021-12-21 20:50:23,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:23,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215734752] [2021-12-21 20:50:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:23,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:50:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 20:50:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,870 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-21 20:50:23,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215734752] [2021-12-21 20:50:23,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215734752] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666198963] [2021-12-21 20:50:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:23,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:23,872 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-21 20:50:23,873 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-21 20:50:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:23,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-21 20:50:23,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:24,024 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-21 20:50:24,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:24,169 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-21 20:50:24,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666198963] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:24,169 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:24,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 8] total 18 [2021-12-21 20:50:24,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242321191] [2021-12-21 20:50:24,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:24,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 20:50:24,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 20:50:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-12-21 20:50:24,172 INFO L87 Difference]: Start difference. First operand 105 states and 128 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-21 20:50:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:24,412 INFO L93 Difference]: Finished difference Result 290 states and 352 transitions. [2021-12-21 20:50:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 20:50:24,413 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-21 20:50:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:24,414 INFO L225 Difference]: With dead ends: 290 [2021-12-21 20:50:24,414 INFO L226 Difference]: Without dead ends: 152 [2021-12-21 20:50:24,415 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-21 20:50:24,415 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:24,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 739 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-21 20:50:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 102. [2021-12-21 20:50:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 93 states have internal predecessors, (110), 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-21 20:50:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2021-12-21 20:50:24,443 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 36 [2021-12-21 20:50:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:24,443 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-12-21 20:50:24,443 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-21 20:50:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2021-12-21 20:50:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-21 20:50:24,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:24,445 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-21 20:50:24,464 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-21 20:50:24,661 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-21 20:50:24,662 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1115202185, now seen corresponding path program 1 times [2021-12-21 20:50:24,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:24,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779280367] [2021-12-21 20:50:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:24,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 20:50:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:24,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 20:50:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:24,733 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-21 20:50:24,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779280367] [2021-12-21 20:50:24,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779280367] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749700981] [2021-12-21 20:50:24,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:24,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:24,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:24,735 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-21 20:50:24,736 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-21 20:50:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:24,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 20:50:24,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:24,872 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-21 20:50:24,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:25,003 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-21 20:50:25,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749700981] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:25,004 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:25,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2021-12-21 20:50:25,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955868294] [2021-12-21 20:50:25,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:25,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 20:50:25,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 20:50:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-21 20:50:25,005 INFO L87 Difference]: Start difference. First operand 102 states and 118 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-21 20:50:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:25,264 INFO L93 Difference]: Finished difference Result 245 states and 281 transitions. [2021-12-21 20:50:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 20:50:25,264 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-21 20:50:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:25,265 INFO L225 Difference]: With dead ends: 245 [2021-12-21 20:50:25,265 INFO L226 Difference]: Without dead ends: 167 [2021-12-21 20:50:25,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2021-12-21 20:50:25,266 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 201 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:25,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 400 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-21 20:50:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 102. [2021-12-21 20:50:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.244186046511628) internal successors, (107), 93 states have internal predecessors, (107), 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-21 20:50:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2021-12-21 20:50:25,288 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 49 [2021-12-21 20:50:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:25,288 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2021-12-21 20:50:25,288 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-21 20:50:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2021-12-21 20:50:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-21 20:50:25,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:25,289 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-21 20:50:25,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:25,505 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-21 20:50:25,506 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1579011142, now seen corresponding path program 1 times [2021-12-21 20:50:25,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:25,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633403754] [2021-12-21 20:50:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:25,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:25,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-21 20:50:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-21 20:50:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:25,557 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-21 20:50:25,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:25,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633403754] [2021-12-21 20:50:25,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633403754] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:25,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349983053] [2021-12-21 20:50:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:25,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:25,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:25,588 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-21 20:50:25,589 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-21 20:50:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:25,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 20:50:25,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:25,708 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-21 20:50:25,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:25,847 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-21 20:50:25,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349983053] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:25,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:25,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-21 20:50:25,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598995229] [2021-12-21 20:50:25,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:25,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 20:50:25,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:25,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 20:50:25,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-12-21 20:50:25,850 INFO L87 Difference]: Start difference. First operand 102 states and 115 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-21 20:50:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:25,997 INFO L93 Difference]: Finished difference Result 389 states and 441 transitions. [2021-12-21 20:50:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 20:50:25,997 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-21 20:50:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:25,998 INFO L225 Difference]: With dead ends: 389 [2021-12-21 20:50:25,998 INFO L226 Difference]: Without dead ends: 312 [2021-12-21 20:50:25,999 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-21 20:50:25,999 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 145 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:25,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 353 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-21 20:50:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 122. [2021-12-21 20:50:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 113 states have internal predecessors, (131), 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-21 20:50:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2021-12-21 20:50:26,010 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 55 [2021-12-21 20:50:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:26,010 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2021-12-21 20:50:26,010 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-21 20:50:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2021-12-21 20:50:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-21 20:50:26,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:26,011 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-21 20:50:26,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-21 20:50:26,226 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-21 20:50:26,226 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:26,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1107207327, now seen corresponding path program 1 times [2021-12-21 20:50:26,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:26,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829782459] [2021-12-21 20:50:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:26,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-21 20:50:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 20:50:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,287 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-21 20:50:26,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:26,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829782459] [2021-12-21 20:50:26,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829782459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:26,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165763652] [2021-12-21 20:50:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:26,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:26,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:26,289 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-21 20:50:26,304 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-21 20:50:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 20:50:26,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:26,432 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-21 20:50:26,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:26,549 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-21 20:50:26,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165763652] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:26,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 20:50:26,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 8] total 16 [2021-12-21 20:50:26,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631695113] [2021-12-21 20:50:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:26,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:50:26,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:26,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:50:26,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-12-21 20:50:26,551 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-21 20:50:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:26,583 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2021-12-21 20:50:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-21 20:50:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:26,585 INFO L225 Difference]: With dead ends: 183 [2021-12-21 20:50:26,585 INFO L226 Difference]: Without dead ends: 157 [2021-12-21 20:50:26,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:50:26,585 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 29 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:26,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 307 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-21 20:50:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 128. [2021-12-21 20:50:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 118 states have internal predecessors, (136), 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-21 20:50:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2021-12-21 20:50:26,594 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 56 [2021-12-21 20:50:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:26,594 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2021-12-21 20:50:26,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-21 20:50:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2021-12-21 20:50:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-21 20:50:26,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:26,595 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-21 20:50:26,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:26,811 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-21 20:50:26,812 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash 667800035, now seen corresponding path program 1 times [2021-12-21 20:50:26,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:26,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334259096] [2021-12-21 20:50:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:26,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-21 20:50:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 20:50:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,885 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-21 20:50:26,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334259096] [2021-12-21 20:50:26,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334259096] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82313771] [2021-12-21 20:50:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:26,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:26,886 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-21 20:50:26,888 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-21 20:50:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:26,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 20:50:26,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:27,014 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-21 20:50:27,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:27,152 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-21 20:50:27,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82313771] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:27,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 20:50:27,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 9] total 18 [2021-12-21 20:50:27,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867343144] [2021-12-21 20:50:27,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:27,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:50:27,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:27,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:50:27,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-21 20:50:27,154 INFO L87 Difference]: Start difference. First operand 128 states and 145 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-21 20:50:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:27,209 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2021-12-21 20:50:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 20:50:27,210 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-21 20:50:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:27,210 INFO L225 Difference]: With dead ends: 158 [2021-12-21 20:50:27,210 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 20:50:27,211 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-21 20:50:27,211 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:27,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 360 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 20:50:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2021-12-21 20:50:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 113 states have internal predecessors, (129), 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-21 20:50:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2021-12-21 20:50:27,218 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 56 [2021-12-21 20:50:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:27,218 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2021-12-21 20:50:27,218 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-21 20:50:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2021-12-21 20:50:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 20:50:27,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:27,219 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-21 20:50:27,253 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-21 20:50:27,435 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-21 20:50:27,436 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash -95677998, now seen corresponding path program 2 times [2021-12-21 20:50:27,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:27,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831792494] [2021-12-21 20:50:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:27,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-21 20:50:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 20:50:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,495 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-21 20:50:27,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:27,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831792494] [2021-12-21 20:50:27,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831792494] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:27,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059980254] [2021-12-21 20:50:27,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:50:27,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:27,497 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-21 20:50:27,498 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-21 20:50:27,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:50:27,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:50:27,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 20:50:27,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:27,637 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-21 20:50:27,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:50:27,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059980254] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:27,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:50:27,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2021-12-21 20:50:27,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319238192] [2021-12-21 20:50:27,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:27,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 20:50:27,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:27,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 20:50:27,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-21 20:50:27,640 INFO L87 Difference]: Start difference. First operand 122 states and 137 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-21 20:50:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:27,708 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2021-12-21 20:50:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:50:27,709 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-21 20:50:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:27,710 INFO L225 Difference]: With dead ends: 180 [2021-12-21 20:50:27,710 INFO L226 Difference]: Without dead ends: 178 [2021-12-21 20:50:27,710 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-21 20:50:27,710 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 88 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:27,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 466 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-21 20:50:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 139. [2021-12-21 20:50:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 129 states have internal predecessors, (148), 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-21 20:50:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2021-12-21 20:50:27,721 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 60 [2021-12-21 20:50:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:27,721 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2021-12-21 20:50:27,721 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-21 20:50:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2021-12-21 20:50:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 20:50:27,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:27,722 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-21 20:50:27,741 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-21 20:50:27,936 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-21 20:50:27,936 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash -95618416, now seen corresponding path program 1 times [2021-12-21 20:50:27,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:27,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491698898] [2021-12-21 20:50:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:27,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-21 20:50:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 20:50:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:27,993 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-21 20:50:27,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:27,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491698898] [2021-12-21 20:50:27,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491698898] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:27,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533625712] [2021-12-21 20:50:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:27,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:27,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:27,995 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-21 20:50:27,996 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-21 20:50:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:28,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 20:50:28,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:28,118 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-21 20:50:28,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:28,251 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-21 20:50:28,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533625712] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:28,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:28,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-12-21 20:50:28,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895705554] [2021-12-21 20:50:28,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:28,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 20:50:28,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:28,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 20:50:28,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:50:28,253 INFO L87 Difference]: Start difference. First operand 139 states and 157 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-21 20:50:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:28,454 INFO L93 Difference]: Finished difference Result 336 states and 380 transitions. [2021-12-21 20:50:28,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 20:50:28,455 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-21 20:50:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:28,456 INFO L225 Difference]: With dead ends: 336 [2021-12-21 20:50:28,456 INFO L226 Difference]: Without dead ends: 236 [2021-12-21 20:50:28,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2021-12-21 20:50:28,457 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 126 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:28,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 321 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-21 20:50:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 139. [2021-12-21 20:50:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 122 states have (on average 1.180327868852459) internal successors, (144), 129 states have internal predecessors, (144), 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-21 20:50:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2021-12-21 20:50:28,465 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 60 [2021-12-21 20:50:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:28,466 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2021-12-21 20:50:28,466 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-21 20:50:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2021-12-21 20:50:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-21 20:50:28,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:28,467 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-21 20:50:28,500 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-21 20:50:28,684 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-21 20:50:28,684 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 536939497, now seen corresponding path program 1 times [2021-12-21 20:50:28,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:28,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439712634] [2021-12-21 20:50:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:28,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:28,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 20:50:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 20:50:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:28,777 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-21 20:50:28,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:28,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439712634] [2021-12-21 20:50:28,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439712634] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:28,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695545910] [2021-12-21 20:50:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:28,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:28,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:28,782 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-21 20:50:28,782 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-21 20:50:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:28,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 20:50:28,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:28,951 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-21 20:50:28,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:29,237 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-21 20:50:29,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695545910] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:29,237 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:29,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2021-12-21 20:50:29,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394934168] [2021-12-21 20:50:29,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:29,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-21 20:50:29,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:29,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 20:50:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2021-12-21 20:50:29,239 INFO L87 Difference]: Start difference. First operand 139 states and 153 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-21 20:50:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:29,450 INFO L93 Difference]: Finished difference Result 651 states and 723 transitions. [2021-12-21 20:50:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 20:50:29,451 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-21 20:50:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:29,452 INFO L225 Difference]: With dead ends: 651 [2021-12-21 20:50:29,452 INFO L226 Difference]: Without dead ends: 557 [2021-12-21 20:50:29,453 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-21 20:50:29,453 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 339 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:29,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 453 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2021-12-21 20:50:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 179. [2021-12-21 20:50:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 162 states have (on average 1.1851851851851851) internal successors, (192), 169 states have internal predecessors, (192), 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-21 20:50:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 201 transitions. [2021-12-21 20:50:29,467 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 201 transitions. Word has length 79 [2021-12-21 20:50:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:29,467 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 201 transitions. [2021-12-21 20:50:29,467 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-21 20:50:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 201 transitions. [2021-12-21 20:50:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-21 20:50:29,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:29,468 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-21 20:50:29,507 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-21 20:50:29,693 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-21 20:50:29,694 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:29,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash -732586736, now seen corresponding path program 2 times [2021-12-21 20:50:29,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:29,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122322708] [2021-12-21 20:50:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:29,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:29,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 20:50:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:29,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-21 20:50:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:29,800 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-21 20:50:29,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122322708] [2021-12-21 20:50:29,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122322708] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929726448] [2021-12-21 20:50:29,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:50:29,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:29,802 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-21 20:50:29,803 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-21 20:50:29,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:50:29,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:50:29,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 20:50:29,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:30,012 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-21 20:50:30,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:50:30,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929726448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:30,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:50:30,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2021-12-21 20:50:30,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307547495] [2021-12-21 20:50:30,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:30,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 20:50:30,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:30,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 20:50:30,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:50:30,013 INFO L87 Difference]: Start difference. First operand 179 states and 201 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-21 20:50:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:30,137 INFO L93 Difference]: Finished difference Result 218 states and 237 transitions. [2021-12-21 20:50:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 20:50:30,137 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-21 20:50:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:30,138 INFO L225 Difference]: With dead ends: 218 [2021-12-21 20:50:30,138 INFO L226 Difference]: Without dead ends: 217 [2021-12-21 20:50:30,138 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-21 20:50:30,138 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 87 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:30,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 461 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-21 20:50:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 179. [2021-12-21 20:50:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 162 states have (on average 1.1790123456790123) internal successors, (191), 169 states have internal predecessors, (191), 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-21 20:50:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 200 transitions. [2021-12-21 20:50:30,150 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 200 transitions. Word has length 80 [2021-12-21 20:50:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:30,150 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 200 transitions. [2021-12-21 20:50:30,150 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-21 20:50:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 200 transitions. [2021-12-21 20:50:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-21 20:50:30,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:30,151 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-21 20:50:30,188 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-21 20:50:30,354 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-21 20:50:30,354 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:30,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash 301529620, now seen corresponding path program 1 times [2021-12-21 20:50:30,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:30,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113530602] [2021-12-21 20:50:30,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:30,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:30,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:30,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-21 20:50:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-21 20:50:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:30,541 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-21 20:50:30,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113530602] [2021-12-21 20:50:30,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113530602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741665536] [2021-12-21 20:50:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:30,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:30,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:30,543 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-21 20:50:30,566 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-21 20:50:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:30,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 20:50:30,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:30,814 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-21 20:50:30,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:31,155 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-21 20:50:31,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741665536] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:31,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:31,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-21 20:50:31,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303446149] [2021-12-21 20:50:31,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:31,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-21 20:50:31,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-21 20:50:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2021-12-21 20:50:31,157 INFO L87 Difference]: Start difference. First operand 179 states and 200 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-21 20:50:41,094 WARN L227 SmtUtils]: Spent 9.80s on a formula simplification. DAG size of input: 41 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-21 20:50:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:53,918 INFO L93 Difference]: Finished difference Result 464 states and 526 transitions. [2021-12-21 20:50:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 20:50:53,919 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-21 20:50:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:53,920 INFO L225 Difference]: With dead ends: 464 [2021-12-21 20:50:53,920 INFO L226 Difference]: Without dead ends: 364 [2021-12-21 20:50:53,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=500, Invalid=902, Unknown=4, NotChecked=0, Total=1406 [2021-12-21 20:50:53,921 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 254 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:53,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 703 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 20:50:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-12-21 20:50:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 179. [2021-12-21 20:50:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 162 states have (on average 1.1296296296296295) internal successors, (183), 169 states have internal predecessors, (183), 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-21 20:50:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions. [2021-12-21 20:50:53,934 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 82 [2021-12-21 20:50:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:53,934 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions. [2021-12-21 20:50:53,935 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-21 20:50:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2021-12-21 20:50:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-21 20:50:53,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:53,936 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-21 20:50:53,967 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-21 20:50:54,152 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-21 20:50:54,153 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:54,153 INFO L85 PathProgramCache]: Analyzing trace with hash 195178925, now seen corresponding path program 1 times [2021-12-21 20:50:54,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:54,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228825810] [2021-12-21 20:50:54,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:54,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-21 20:50:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-21 20:50:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:54,385 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-21 20:50:54,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:54,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228825810] [2021-12-21 20:50:54,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228825810] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484809935] [2021-12-21 20:50:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:54,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:54,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:54,396 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-21 20:50:54,449 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-21 20:50:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:54,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 20:50:54,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:54,782 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-21 20:50:54,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:55,474 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-21 20:50:55,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484809935] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:55,475 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:55,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2021-12-21 20:50:55,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939833197] [2021-12-21 20:50:55,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:55,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-21 20:50:55,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:55,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-21 20:50:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2021-12-21 20:50:55,477 INFO L87 Difference]: Start difference. First operand 179 states and 192 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-21 20:50:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:55,944 INFO L93 Difference]: Finished difference Result 1131 states and 1249 transitions. [2021-12-21 20:50:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-21 20:50:55,944 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-21 20:50:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:55,947 INFO L225 Difference]: With dead ends: 1131 [2021-12-21 20:50:55,947 INFO L226 Difference]: Without dead ends: 1037 [2021-12-21 20:50:55,948 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-21 20:50:55,948 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 775 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:55,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 714 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:50:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-12-21 20:50:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 259. [2021-12-21 20:50:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 242 states have (on average 1.1528925619834711) internal successors, (279), 249 states have internal predecessors, (279), 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-21 20:50:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions. [2021-12-21 20:50:55,992 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 121 [2021-12-21 20:50:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:55,992 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions. [2021-12-21 20:50:55,993 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-21 20:50:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions. [2021-12-21 20:50:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-21 20:50:55,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:55,994 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-21 20:50:56,019 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-21 20:50:56,210 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-21 20:50:56,210 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1969340652, now seen corresponding path program 2 times [2021-12-21 20:50:56,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:56,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330398682] [2021-12-21 20:50:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:56,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:56,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-21 20:50:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:56,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-21 20:50:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:56,471 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-21 20:50:56,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:56,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330398682] [2021-12-21 20:50:56,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330398682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:56,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128511484] [2021-12-21 20:50:56,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:50:56,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:56,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:56,488 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-21 20:50:56,503 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-21 20:50:56,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 20:50:56,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:50:56,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 20:50:56,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:56,781 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-21 20:50:56,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:57,023 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-21 20:50:57,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128511484] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:57,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:57,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 28 [2021-12-21 20:50:57,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998714483] [2021-12-21 20:50:57,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:57,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-21 20:50:57,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:57,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-21 20:50:57,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2021-12-21 20:50:57,025 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand has 28 states, 28 states have (on average 4.785714285714286) internal successors, (134), 26 states have internal predecessors, (134), 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-21 20:50:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:57,551 INFO L93 Difference]: Finished difference Result 575 states and 655 transitions. [2021-12-21 20:50:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 20:50:57,551 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.785714285714286) internal successors, (134), 26 states have internal predecessors, (134), 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-21 20:50:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:57,553 INFO L225 Difference]: With dead ends: 575 [2021-12-21 20:50:57,553 INFO L226 Difference]: Without dead ends: 481 [2021-12-21 20:50:57,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2021-12-21 20:50:57,554 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 382 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:57,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 1579 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 20:50:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-12-21 20:50:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 276. [2021-12-21 20:50:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 257 states have (on average 1.1478599221789882) internal successors, (295), 263 states have internal predecessors, (295), 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-21 20:50:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 308 transitions. [2021-12-21 20:50:57,583 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 308 transitions. Word has length 122 [2021-12-21 20:50:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:57,583 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 308 transitions. [2021-12-21 20:50:57,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.785714285714286) internal successors, (134), 26 states have internal predecessors, (134), 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-21 20:50:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 308 transitions. [2021-12-21 20:50:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-21 20:50:57,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:57,585 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-21 20:50:57,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:57,801 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-21 20:50:57,801 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1978346494, now seen corresponding path program 1 times [2021-12-21 20:50:57,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:57,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085548820] [2021-12-21 20:50:57,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:57,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:58,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-21 20:50:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 20:50:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:58,206 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-21 20:50:58,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:58,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085548820] [2021-12-21 20:50:58,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085548820] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:58,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074143513] [2021-12-21 20:50:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:58,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:58,207 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-21 20:50:58,208 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-21 20:50:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:58,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-21 20:50:58,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:58,626 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-21 20:50:58,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:59,294 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-21 20:50:59,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074143513] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:59,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:59,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2021-12-21 20:50:59,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931682290] [2021-12-21 20:50:59,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:59,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-21 20:50:59,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-21 20:50:59,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=1986, Unknown=0, NotChecked=0, Total=2652 [2021-12-21 20:50:59,296 INFO L87 Difference]: Start difference. First operand 276 states and 308 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-21 20:51:05,245 WARN L227 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 46 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-21 20:51:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:51:30,272 INFO L93 Difference]: Finished difference Result 696 states and 796 transitions. [2021-12-21 20:51:30,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-21 20:51:30,274 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-21 20:51:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:51:30,276 INFO L225 Difference]: With dead ends: 696 [2021-12-21 20:51:30,276 INFO L226 Difference]: Without dead ends: 579 [2021-12-21 20:51:30,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=1642, Invalid=3902, Unknown=6, NotChecked=0, Total=5550 [2021-12-21 20:51:30,278 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 613 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 20:51:30,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 2018 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 20:51:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-12-21 20:51:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 276. [2021-12-21 20:51:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 257 states have (on average 1.11284046692607) internal successors, (286), 263 states have internal predecessors, (286), 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-21 20:51:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 299 transitions. [2021-12-21 20:51:30,297 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 299 transitions. Word has length 128 [2021-12-21 20:51:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:51:30,298 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 299 transitions. [2021-12-21 20:51:30,298 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-21 20:51:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 299 transitions. [2021-12-21 20:51:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-21 20:51:30,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:51:30,299 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-21 20:51:30,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-21 20:51:30,523 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-21 20:51:30,523 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:51:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:51:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash -434441148, now seen corresponding path program 2 times [2021-12-21 20:51:30,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:51:30,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058986859] [2021-12-21 20:51:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:51:30,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:51:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:30,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:51:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:51:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-21 20:51:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:30,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-21 20:51:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:30,698 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-21 20:51:30,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:51:30,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058986859] [2021-12-21 20:51:30,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058986859] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:51:30,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126715598] [2021-12-21 20:51:30,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:51:30,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:51:30,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:51:30,700 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:51:30,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 20:51:30,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:51:30,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:51:30,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 20:51:30,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:51:31,138 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-21 20:51:31,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:51:31,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126715598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:51:31,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:51:31,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2021-12-21 20:51:31,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153336540] [2021-12-21 20:51:31,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:51:31,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 20:51:31,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:51:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 20:51:31,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-12-21 20:51:31,141 INFO L87 Difference]: Start difference. First operand 276 states and 299 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-21 20:51:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:51:31,302 INFO L93 Difference]: Finished difference Result 314 states and 335 transitions. [2021-12-21 20:51:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 20:51:31,303 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-21 20:51:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:51:31,304 INFO L225 Difference]: With dead ends: 314 [2021-12-21 20:51:31,304 INFO L226 Difference]: Without dead ends: 312 [2021-12-21 20:51:31,304 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-21 20:51:31,305 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:51:31,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 387 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:51:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-21 20:51:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2021-12-21 20:51:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 266 states have (on average 1.1203007518796992) internal successors, (298), 272 states have internal predecessors, (298), 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-21 20:51:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 311 transitions. [2021-12-21 20:51:31,342 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 311 transitions. Word has length 173 [2021-12-21 20:51:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:51:31,343 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 311 transitions. [2021-12-21 20:51:31,343 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-21 20:51:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 311 transitions. [2021-12-21 20:51:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-21 20:51:31,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:51:31,344 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-21 20:51:31,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-21 20:51:31,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:51:31,561 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:51:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:51:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash -582773548, now seen corresponding path program 1 times [2021-12-21 20:51:31,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:51:31,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373315646] [2021-12-21 20:51:31,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:51:31,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:51:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:51:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:51:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-21 20:51:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:31,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-21 20:51:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:51:31,746 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-21 20:51:31,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:51:31,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373315646] [2021-12-21 20:51:31,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373315646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:51:31,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:51:31,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 20:51:31,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908697684] [2021-12-21 20:51:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:51:31,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 20:51:31,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:51:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 20:51:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:51:31,749 INFO L87 Difference]: Start difference. First operand 285 states and 311 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-21 20:51:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:51:31,920 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2021-12-21 20:51:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 20:51:31,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 174 [2021-12-21 20:51:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:51:31,921 INFO L225 Difference]: With dead ends: 312 [2021-12-21 20:51:31,921 INFO L226 Difference]: Without dead ends: 302 [2021-12-21 20:51:31,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-21 20:51:31,922 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 69 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:51:31,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 433 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:51:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-12-21 20:51:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 279. [2021-12-21 20:51:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 260 states have (on average 1.1115384615384616) internal successors, (289), 266 states have internal predecessors, (289), 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-21 20:51:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 302 transitions. [2021-12-21 20:51:31,953 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 302 transitions. Word has length 174 [2021-12-21 20:51:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:51:31,953 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 302 transitions. [2021-12-21 20:51:31,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-21 20:51:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 302 transitions. [2021-12-21 20:51:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-21 20:51:31,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:51:31,955 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-21 20:51:31,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-21 20:51:31,955 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:51:31,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:51:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1923649980, now seen corresponding path program 1 times [2021-12-21 20:51:31,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:51:31,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754313720] [2021-12-21 20:51:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:51:31,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:51:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:51:31,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 20:51:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:51:32,007 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 20:51:32,007 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 20:51:32,008 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2021-12-21 20:51:32,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2021-12-21 20:51:32,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2021-12-21 20:51:32,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2021-12-21 20:51:32,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2021-12-21 20:51:32,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2021-12-21 20:51:32,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2021-12-21 20:51:32,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2021-12-21 20:51:32,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2021-12-21 20:51:32,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2021-12-21 20:51:32,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2021-12-21 20:51:32,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2021-12-21 20:51:32,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2021-12-21 20:51:32,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2021-12-21 20:51:32,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2021-12-21 20:51:32,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2021-12-21 20:51:32,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-21 20:51:32,013 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, 1] [2021-12-21 20:51:32,015 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 20:51:32,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:51:32 BoogieIcfgContainer [2021-12-21 20:51:32,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 20:51:32,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 20:51:32,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 20:51:32,058 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 20:51:32,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:21" (3/4) ... [2021-12-21 20:51:32,060 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 20:51:32,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 20:51:32,061 INFO L158 Benchmark]: Toolchain (without parser) took 70747.53ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 61.3MB in the beginning and 129.0MB in the end (delta: -67.7MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2021-12-21 20:51:32,061 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:51:32,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.90ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 61.3MB in the beginning and 85.8MB in the end (delta: -24.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 20:51:32,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.87ms. Allocated memory is still 111.1MB. Free memory was 85.8MB in the beginning and 84.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:51:32,062 INFO L158 Benchmark]: Boogie Preprocessor took 32.04ms. Allocated memory is still 111.1MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:51:32,062 INFO L158 Benchmark]: RCFGBuilder took 280.92ms. Allocated memory is still 111.1MB. Free memory was 82.4MB in the beginning and 67.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-21 20:51:32,062 INFO L158 Benchmark]: TraceAbstraction took 70163.00ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 67.3MB in the beginning and 130.1MB in the end (delta: -62.7MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2021-12-21 20:51:32,062 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 195.0MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:51:32,063 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.20ms. Allocated memory is still 92.3MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.90ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 61.3MB in the beginning and 85.8MB in the end (delta: -24.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.87ms. Allocated memory is still 111.1MB. Free memory was 85.8MB in the beginning and 84.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.04ms. Allocated memory is still 111.1MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.92ms. Allocated memory is still 111.1MB. Free memory was 82.4MB in the beginning and 67.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 70163.00ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 67.3MB in the beginning and 130.1MB in the end (delta: -62.7MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 195.0MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 sb ; [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 !(b < zero) VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, one=2, zero=0] [L246] COND TRUE b > zero [L247] tmp = 1 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, one=2, tmp=1, zero=0] [L251] sb = tmp VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, one=2, sb=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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 70.1s, OverallIterations: 27, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 57.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3846 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3836 mSDsluCounter, 11640 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9874 mSDsCounter, 722 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5244 IncrementalHoareTripleChecker+Invalid, 5966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 722 mSolverCounterUnsat, 1766 mSDtfsCounter, 5244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2428 GetRequests, 1992 SyntacticMatches, 1 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3436 ImplicationChecksByTransitivity, 56.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=25, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 2569 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2881 NumberOfCodeBlocks, 2634 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3499 ConstructedInterpolants, 0 QuantifiedInterpolants, 12354 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2433 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 52 InterpolantComputations, 17 PerfectInterpolantSequences, 6328/10682 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-21 20:51:32,151 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