./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 791161d1 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-?-791161d [2022-07-23 13:34:27,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 13:34:27,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 13:34:27,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 13:34:27,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 13:34:27,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 13:34:27,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 13:34:27,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 13:34:27,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 13:34:27,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 13:34:27,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 13:34:27,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 13:34:27,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 13:34:27,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 13:34:27,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 13:34:27,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 13:34:27,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 13:34:27,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 13:34:27,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 13:34:27,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 13:34:27,688 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 13:34:27,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 13:34:27,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 13:34:27,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 13:34:27,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 13:34:27,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 13:34:27,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 13:34:27,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 13:34:27,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 13:34:27,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 13:34:27,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 13:34:27,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 13:34:27,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 13:34:27,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 13:34:27,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 13:34:27,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 13:34:27,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 13:34:27,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 13:34:27,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 13:34:27,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 13:34:27,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 13:34:27,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 13:34:27,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-23 13:34:27,747 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 13:34:27,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 13:34:27,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 13:34:27,748 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 13:34:27,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 13:34:27,749 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 13:34:27,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 13:34:27,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 13:34:27,750 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 13:34:27,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 13:34:27,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 13:34:27,751 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 13:34:27,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 13:34:27,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 13:34:27,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 13:34:27,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 13:34:27,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 13:34:27,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 13:34:27,752 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-23 13:34:27,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 13:34:27,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 13:34:27,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 13:34:27,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 13:34:27,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 13:34:27,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 13:34:27,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 13:34:27,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:34:27,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 13:34:27,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 13:34:27,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 13:34:27,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 13:34:27,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 13:34:27,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 13:34:27,756 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 [2022-07-23 13:34:28,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 13:34:28,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 13:34:28,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 13:34:28,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 13:34:28,033 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 13:34:28,034 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 [2022-07-23 13:34:28,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f5b5108/8401c1275785476ea5aba31c1a342aad/FLAG632ad7272 [2022-07-23 13:34:28,484 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 13:34:28,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2022-07-23 13:34:28,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f5b5108/8401c1275785476ea5aba31c1a342aad/FLAG632ad7272 [2022-07-23 13:34:28,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f5b5108/8401c1275785476ea5aba31c1a342aad [2022-07-23 13:34:28,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 13:34:28,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 13:34:28,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 13:34:28,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 13:34:28,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 13:34:28,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fed5c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28, skipping insertion in model container [2022-07-23 13:34:28,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 13:34:28,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:34:28,719 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] [2022-07-23 13:34:28,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:34:28,775 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 13:34:28,784 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] [2022-07-23 13:34:28,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:34:28,835 INFO L208 MainTranslator]: Completed translation [2022-07-23 13:34:28,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28 WrapperNode [2022-07-23 13:34:28,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 13:34:28,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 13:34:28,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 13:34:28,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 13:34:28,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,876 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 188 [2022-07-23 13:34:28,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 13:34:28,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 13:34:28,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 13:34:28,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 13:34:28,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 13:34:28,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 13:34:28,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 13:34:28,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 13:34:28,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (1/1) ... [2022-07-23 13:34:28,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:34:28,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:28,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 13:34:28,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 13:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 13:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 13:34:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-23 13:34:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-23 13:34:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 13:34:28,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 13:34:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 13:34:28,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 13:34:29,077 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 13:34:29,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 13:34:29,405 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 13:34:29,411 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 13:34:29,412 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 13:34:29,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:29 BoogieIcfgContainer [2022-07-23 13:34:29,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 13:34:29,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 13:34:29,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 13:34:29,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 13:34:29,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 01:34:28" (1/3) ... [2022-07-23 13:34:29,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b73c486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:34:29, skipping insertion in model container [2022-07-23 13:34:29,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:28" (2/3) ... [2022-07-23 13:34:29,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b73c486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:34:29, skipping insertion in model container [2022-07-23 13:34:29,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:29" (3/3) ... [2022-07-23 13:34:29,430 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2022-07-23 13:34:29,443 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 13:34:29,443 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-07-23 13:34:29,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 13:34:29,511 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56816583, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35d0dd2b [2022-07-23 13:34:29,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-07-23 13:34:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.7765957446808511) internal successors, (167), 113 states have internal predecessors, (167), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-23 13:34:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 13:34:29,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:29,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:29,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:29,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash 839293121, now seen corresponding path program 1 times [2022-07-23 13:34:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:29,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199174816] [2022-07-23 13:34:29,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:29,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:29,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:29,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199174816] [2022-07-23 13:34:29,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199174816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:29,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:29,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:34:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779585654] [2022-07-23 13:34:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 13:34:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:29,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 13:34:29,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 13:34:29,686 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.7765957446808511) internal successors, (167), 113 states have internal predecessors, (167), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:29,725 INFO L93 Difference]: Finished difference Result 235 states and 355 transitions. [2022-07-23 13:34:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 13:34:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 13:34:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:29,733 INFO L225 Difference]: With dead ends: 235 [2022-07-23 13:34:29,734 INFO L226 Difference]: Without dead ends: 91 [2022-07-23 13:34:29,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 13:34:29,745 INFO L413 NwaCegarLoop]: 160 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, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:29,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:34:29,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-23 13:34:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-23 13:34:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.542857142857143) internal successors, (108), 85 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2022-07-23 13:34:29,781 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 9 [2022-07-23 13:34:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:29,781 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2022-07-23 13:34:29,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2022-07-23 13:34:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 13:34:29,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:29,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:29,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 13:34:29,784 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash 838351773, now seen corresponding path program 1 times [2022-07-23 13:34:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:29,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124147683] [2022-07-23 13:34:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:29,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:29,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124147683] [2022-07-23 13:34:29,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124147683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:29,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:29,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:34:29,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443142857] [2022-07-23 13:34:29,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:29,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:34:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:34:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:29,868 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:29,978 INFO L93 Difference]: Finished difference Result 241 states and 325 transitions. [2022-07-23 13:34:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:34:29,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 13:34:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:29,982 INFO L225 Difference]: With dead ends: 241 [2022-07-23 13:34:29,982 INFO L226 Difference]: Without dead ends: 153 [2022-07-23 13:34:29,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:34:29,985 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 106 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:29,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 292 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-23 13:34:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2022-07-23 13:34:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 133 states have internal predecessors, (183), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 191 transitions. [2022-07-23 13:34:30,000 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 191 transitions. Word has length 9 [2022-07-23 13:34:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:30,000 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 191 transitions. [2022-07-23 13:34:30,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 191 transitions. [2022-07-23 13:34:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 13:34:30,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:30,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:30,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 13:34:30,002 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1105067146, now seen corresponding path program 1 times [2022-07-23 13:34:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:30,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777430279] [2022-07-23 13:34:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:30,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777430279] [2022-07-23 13:34:30,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777430279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:30,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:30,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:34:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029992519] [2022-07-23 13:34:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:30,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:30,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:30,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:34:30,055 INFO L87 Difference]: Start difference. First operand 140 states and 191 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) [2022-07-23 13:34:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:30,196 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2022-07-23 13:34:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:30,197 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 [2022-07-23 13:34:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:30,202 INFO L225 Difference]: With dead ends: 175 [2022-07-23 13:34:30,202 INFO L226 Difference]: Without dead ends: 172 [2022-07-23 13:34:30,203 INFO L412 NwaCegarLoop]: 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 [2022-07-23 13:34:30,210 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 161 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:30,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 392 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-23 13:34:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 147. [2022-07-23 13:34:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.552) internal successors, (194), 140 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 202 transitions. [2022-07-23 13:34:30,233 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 202 transitions. Word has length 13 [2022-07-23 13:34:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:30,234 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 202 transitions. [2022-07-23 13:34:30,234 INFO L496 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) [2022-07-23 13:34:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 202 transitions. [2022-07-23 13:34:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 13:34:30,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:30,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:30,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 13:34:30,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash 102656963, now seen corresponding path program 1 times [2022-07-23 13:34:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:30,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380995561] [2022-07-23 13:34:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380995561] [2022-07-23 13:34:30,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380995561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:30,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:30,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:34:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969334493] [2022-07-23 13:34:30,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:30,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:30,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:30,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:34:30,315 INFO L87 Difference]: Start difference. First operand 147 states and 202 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) [2022-07-23 13:34:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:30,438 INFO L93 Difference]: Finished difference Result 326 states and 448 transitions. [2022-07-23 13:34:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:30,440 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 [2022-07-23 13:34:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:30,442 INFO L225 Difference]: With dead ends: 326 [2022-07-23 13:34:30,442 INFO L226 Difference]: Without dead ends: 182 [2022-07-23 13:34:30,446 INFO L412 NwaCegarLoop]: 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 [2022-07-23 13:34:30,455 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 190 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:30,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 313 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-23 13:34:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 151. [2022-07-23 13:34:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.5271317829457365) internal successors, (197), 144 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2022-07-23 13:34:30,478 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 14 [2022-07-23 13:34:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:30,479 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2022-07-23 13:34:30,479 INFO L496 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) [2022-07-23 13:34:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2022-07-23 13:34:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 13:34:30,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:30,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:30,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 13:34:30,483 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1563632331, now seen corresponding path program 1 times [2022-07-23 13:34:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:30,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970105443] [2022-07-23 13:34:30,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 13:34:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:30,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970105443] [2022-07-23 13:34:30,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970105443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:30,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:30,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:34:30,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752385158] [2022-07-23 13:34:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:30,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:34:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:30,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:34:30,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:34:30,533 INFO L87 Difference]: Start difference. First operand 151 states and 205 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) [2022-07-23 13:34:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:30,560 INFO L93 Difference]: Finished difference Result 159 states and 215 transitions. [2022-07-23 13:34:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:34:30,561 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 [2022-07-23 13:34:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:30,562 INFO L225 Difference]: With dead ends: 159 [2022-07-23 13:34:30,562 INFO L226 Difference]: Without dead ends: 158 [2022-07-23 13:34:30,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:34:30,564 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 210 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 [2022-07-23 13:34:30,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 210 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:34:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-23 13:34:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2022-07-23 13:34:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.515625) internal successors, (194), 142 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 202 transitions. [2022-07-23 13:34:30,592 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 202 transitions. Word has length 15 [2022-07-23 13:34:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:30,592 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 202 transitions. [2022-07-23 13:34:30,593 INFO L496 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) [2022-07-23 13:34:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 202 transitions. [2022-07-23 13:34:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 13:34:30,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:30,595 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:30,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 13:34:30,599 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:30,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1563634591, now seen corresponding path program 1 times [2022-07-23 13:34:30,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480908364] [2022-07-23 13:34:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:30,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480908364] [2022-07-23 13:34:30,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480908364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:30,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403987958] [2022-07-23 13:34:30,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:30,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:30,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:30,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:30,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 13:34:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:30,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:34:30,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:34:30,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:30,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403987958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:30,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:30,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-23 13:34:30,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116233664] [2022-07-23 13:34:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:30,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:34:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:30,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:34:30,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:34:30,797 INFO L87 Difference]: Start difference. First operand 149 states and 202 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) [2022-07-23 13:34:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:30,877 INFO L93 Difference]: Finished difference Result 187 states and 257 transitions. [2022-07-23 13:34:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:34:30,878 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 [2022-07-23 13:34:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:30,879 INFO L225 Difference]: With dead ends: 187 [2022-07-23 13:34:30,879 INFO L226 Difference]: Without dead ends: 185 [2022-07-23 13:34:30,879 INFO L412 NwaCegarLoop]: 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 [2022-07-23 13:34:30,880 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 26 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:30,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 334 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-23 13:34:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 151. [2022-07-23 13:34:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 144 states have internal predecessors, (196), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 204 transitions. [2022-07-23 13:34:30,889 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 204 transitions. Word has length 15 [2022-07-23 13:34:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:30,889 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 204 transitions. [2022-07-23 13:34:30,890 INFO L496 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) [2022-07-23 13:34:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2022-07-23 13:34:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 13:34:30,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:30,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:30,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:31,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-23 13:34:31,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1393735601, now seen corresponding path program 1 times [2022-07-23 13:34:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:31,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772638449] [2022-07-23 13:34:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 13:34:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772638449] [2022-07-23 13:34:31,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772638449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:31,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:31,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:34:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170149342] [2022-07-23 13:34:31,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:31,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:34:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:31,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:34:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:31,167 INFO L87 Difference]: Start difference. First operand 151 states and 204 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) [2022-07-23 13:34:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:31,234 INFO L93 Difference]: Finished difference Result 193 states and 266 transitions. [2022-07-23 13:34:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:34:31,235 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 [2022-07-23 13:34:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:31,239 INFO L225 Difference]: With dead ends: 193 [2022-07-23 13:34:31,239 INFO L226 Difference]: Without dead ends: 190 [2022-07-23 13:34:31,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:31,240 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 30 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:31,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 225 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:34:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-23 13:34:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2022-07-23 13:34:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 136 states have (on average 1.5) internal successors, (204), 149 states have internal predecessors, (204), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 212 transitions. [2022-07-23 13:34:31,260 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 212 transitions. Word has length 19 [2022-07-23 13:34:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:31,260 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 212 transitions. [2022-07-23 13:34:31,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:34:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 212 transitions. [2022-07-23 13:34:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 13:34:31,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:31,265 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:31,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 13:34:31,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1984698145, now seen corresponding path program 1 times [2022-07-23 13:34:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:31,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626282327] [2022-07-23 13:34:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:31,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 13:34:31,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:31,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626282327] [2022-07-23 13:34:31,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626282327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:31,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825823231] [2022-07-23 13:34:31,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:31,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:31,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:31,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:31,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 13:34:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:34:31,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 13:34:31,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:31,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825823231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:31,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:31,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-23 13:34:31,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258788760] [2022-07-23 13:34:31,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:31,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:31,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 13:34:31,442 INFO L87 Difference]: Start difference. First operand 156 states and 212 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) [2022-07-23 13:34:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:31,532 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2022-07-23 13:34:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:31,533 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 [2022-07-23 13:34:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:31,535 INFO L225 Difference]: With dead ends: 238 [2022-07-23 13:34:31,535 INFO L226 Difference]: Without dead ends: 235 [2022-07-23 13:34:31,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:34:31,537 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 169 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:31,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 308 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-23 13:34:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 193. [2022-07-23 13:34:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 172 states have (on average 1.5174418604651163) internal successors, (261), 185 states have internal predecessors, (261), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 269 transitions. [2022-07-23 13:34:31,548 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 269 transitions. Word has length 23 [2022-07-23 13:34:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:31,549 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 269 transitions. [2022-07-23 13:34:31,549 INFO L496 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) [2022-07-23 13:34:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 269 transitions. [2022-07-23 13:34:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 13:34:31,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:31,550 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:31,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 13:34:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-23 13:34:31,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash 558011975, now seen corresponding path program 1 times [2022-07-23 13:34:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:31,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251482067] [2022-07-23 13:34:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 13:34:31,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:31,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251482067] [2022-07-23 13:34:31,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251482067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:31,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084882665] [2022-07-23 13:34:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:31,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:31,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:31,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:31,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 13:34:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:31,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:34:31,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 13:34:31,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:31,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084882665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:31,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:31,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-23 13:34:31,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477651745] [2022-07-23 13:34:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:31,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 13:34:31,927 INFO L87 Difference]: Start difference. First operand 193 states and 269 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) [2022-07-23 13:34:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:32,010 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2022-07-23 13:34:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:32,011 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 [2022-07-23 13:34:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:32,012 INFO L225 Difference]: With dead ends: 226 [2022-07-23 13:34:32,012 INFO L226 Difference]: Without dead ends: 223 [2022-07-23 13:34:32,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:34:32,013 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 149 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:32,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 318 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-23 13:34:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 185. [2022-07-23 13:34:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.5) internal successors, (246), 177 states have internal predecessors, (246), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 254 transitions. [2022-07-23 13:34:32,027 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 254 transitions. Word has length 25 [2022-07-23 13:34:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:32,027 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 254 transitions. [2022-07-23 13:34:32,027 INFO L496 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) [2022-07-23 13:34:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 254 transitions. [2022-07-23 13:34:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 13:34:32,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:32,028 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:32,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-23 13:34:32,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:32,238 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:32,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1892329959, now seen corresponding path program 1 times [2022-07-23 13:34:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:32,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832449992] [2022-07-23 13:34:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 13:34:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 13:34:32,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:32,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832449992] [2022-07-23 13:34:32,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832449992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:32,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992162659] [2022-07-23 13:34:32,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:32,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:32,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:32,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 13:34:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:34:32,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 13:34:32,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:32,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992162659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:32,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:32,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-23 13:34:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938698440] [2022-07-23 13:34:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:32,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:32,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 13:34:32,397 INFO L87 Difference]: Start difference. First operand 185 states and 254 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) [2022-07-23 13:34:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:32,471 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2022-07-23 13:34:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:32,472 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 [2022-07-23 13:34:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:32,473 INFO L225 Difference]: With dead ends: 215 [2022-07-23 13:34:32,473 INFO L226 Difference]: Without dead ends: 212 [2022-07-23 13:34:32,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:34:32,474 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 167 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:32,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 297 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-23 13:34:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 173. [2022-07-23 13:34:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 165 states have internal predecessors, (226), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 234 transitions. [2022-07-23 13:34:32,483 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 234 transitions. Word has length 30 [2022-07-23 13:34:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:32,483 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 234 transitions. [2022-07-23 13:34:32,483 INFO L496 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) [2022-07-23 13:34:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2022-07-23 13:34:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 13:34:32,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:32,484 INFO L195 NwaCegarLoop]: 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] [2022-07-23 13:34:32,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:32,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:32,707 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:32,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1649593009, now seen corresponding path program 1 times [2022-07-23 13:34:32,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:32,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768087503] [2022-07-23 13:34:32,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:32,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 13:34:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 13:34:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768087503] [2022-07-23 13:34:32,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768087503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446165774] [2022-07-23 13:34:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:32,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:32,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:32,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:32,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 13:34:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:32,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:34:32,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 13:34:32,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:32,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446165774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:32,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:32,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-23 13:34:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355740052] [2022-07-23 13:34:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:32,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:32,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 13:34:32,837 INFO L87 Difference]: Start difference. First operand 173 states and 234 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (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) [2022-07-23 13:34:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:32,924 INFO L93 Difference]: Finished difference Result 203 states and 275 transitions. [2022-07-23 13:34:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:32,924 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 [2022-07-23 13:34:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:32,926 INFO L225 Difference]: With dead ends: 203 [2022-07-23 13:34:32,926 INFO L226 Difference]: Without dead ends: 200 [2022-07-23 13:34:32,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:34:32,927 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 147 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:32,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 303 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-23 13:34:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 162. [2022-07-23 13:34:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 147 states have (on average 1.435374149659864) internal successors, (211), 154 states have internal predecessors, (211), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2022-07-23 13:34:32,937 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 219 transitions. Word has length 32 [2022-07-23 13:34:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:32,937 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 219 transitions. [2022-07-23 13:34:32,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (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) [2022-07-23 13:34:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 219 transitions. [2022-07-23 13:34:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 13:34:32,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:32,938 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-23 13:34:32,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:33,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-23 13:34:33,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1309482490, now seen corresponding path program 1 times [2022-07-23 13:34:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:33,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428477007] [2022-07-23 13:34:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 13:34:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:33,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 13:34:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 13:34:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:33,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428477007] [2022-07-23 13:34:33,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428477007] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:33,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839996357] [2022-07-23 13:34:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:33,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:33,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:33,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:33,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 13:34:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:33,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-23 13:34:33,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-23 13:34:33,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:34:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 13:34:33,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839996357] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:34:33,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:34:33,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 8] total 19 [2022-07-23 13:34:33,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471506283] [2022-07-23 13:34:33,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:34:33,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 13:34:33,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:33,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 13:34:33,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-23 13:34:33,551 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-23 13:34:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:34,167 INFO L93 Difference]: Finished difference Result 723 states and 944 transitions. [2022-07-23 13:34:34,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 13:34:34,167 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-07-23 13:34:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:34,169 INFO L225 Difference]: With dead ends: 723 [2022-07-23 13:34:34,170 INFO L226 Difference]: Without dead ends: 475 [2022-07-23 13:34:34,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-07-23 13:34:34,171 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 412 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:34,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1121 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 13:34:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-07-23 13:34:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 185. [2022-07-23 13:34:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 169 states have (on average 1.3905325443786982) internal successors, (235), 176 states have internal predecessors, (235), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 243 transitions. [2022-07-23 13:34:34,188 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 243 transitions. Word has length 37 [2022-07-23 13:34:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:34,189 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 243 transitions. [2022-07-23 13:34:34,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-23 13:34:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2022-07-23 13:34:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 13:34:34,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:34,189 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-23 13:34:34,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:34,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:34,407 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 776524844, now seen corresponding path program 1 times [2022-07-23 13:34:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:34,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231825251] [2022-07-23 13:34:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 13:34:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-23 13:34:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-23 13:34:34,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:34,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231825251] [2022-07-23 13:34:34,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231825251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:34,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:34,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 13:34:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598620577] [2022-07-23 13:34:34,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:34,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 13:34:34,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:34,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 13:34:34,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 13:34:34,502 INFO L87 Difference]: Start difference. First operand 185 states and 243 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 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) [2022-07-23 13:34:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:34,614 INFO L93 Difference]: Finished difference Result 370 states and 452 transitions. [2022-07-23 13:34:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 13:34:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 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 57 [2022-07-23 13:34:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:34,617 INFO L225 Difference]: With dead ends: 370 [2022-07-23 13:34:34,617 INFO L226 Difference]: Without dead ends: 314 [2022-07-23 13:34:34,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-23 13:34:34,618 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 152 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:34,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 726 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-07-23 13:34:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 185. [2022-07-23 13:34:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 169 states have (on average 1.378698224852071) internal successors, (233), 176 states have internal predecessors, (233), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 13:34:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2022-07-23 13:34:34,629 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 57 [2022-07-23 13:34:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:34,629 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2022-07-23 13:34:34,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 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) [2022-07-23 13:34:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2022-07-23 13:34:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 13:34:34,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:34,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-23 13:34:34,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 13:34:34,631 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash -828181155, now seen corresponding path program 2 times [2022-07-23 13:34:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:34,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587135877] [2022-07-23 13:34:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:34,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 13:34:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-23 13:34:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:34,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587135877] [2022-07-23 13:34:34,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587135877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:34,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543237170] [2022-07-23 13:34:34,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:34:34,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:34,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:34,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 13:34:34,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 13:34:34,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:34:34,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 13:34:34,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-23 13:34:34,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:34,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543237170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:34,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:34,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-07-23 13:34:34,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127745474] [2022-07-23 13:34:34,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:34,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 13:34:34,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:34,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 13:34:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-23 13:34:34,831 INFO L87 Difference]: Start difference. First operand 185 states and 241 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2022-07-23 13:34:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:34,956 INFO L93 Difference]: Finished difference Result 317 states and 389 transitions. [2022-07-23 13:34:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 13:34:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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 61 [2022-07-23 13:34:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:34,958 INFO L225 Difference]: With dead ends: 317 [2022-07-23 13:34:34,958 INFO L226 Difference]: Without dead ends: 279 [2022-07-23 13:34:34,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-23 13:34:34,959 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 173 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:34,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 786 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-23 13:34:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 216. [2022-07-23 13:34:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 199 states have (on average 1.35678391959799) internal successors, (270), 206 states have internal predecessors, (270), 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) [2022-07-23 13:34:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2022-07-23 13:34:34,973 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 61 [2022-07-23 13:34:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:34,974 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2022-07-23 13:34:34,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2022-07-23 13:34:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2022-07-23 13:34:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 13:34:34,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:34,975 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-23 13:34:35,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:35,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:35,199 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash -828183077, now seen corresponding path program 1 times [2022-07-23 13:34:35,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:35,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713276951] [2022-07-23 13:34:35,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:35,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 13:34:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-23 13:34:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:35,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713276951] [2022-07-23 13:34:35,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713276951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:35,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072269500] [2022-07-23 13:34:35,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:35,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:35,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:35,279 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:35,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 13:34:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:35,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 13:34:35,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 13:34:35,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:34:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:35,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072269500] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:34:35,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:34:35,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-07-23 13:34:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938508827] [2022-07-23 13:34:35,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:34:35,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 13:34:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:35,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 13:34:35,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-23 13:34:35,508 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-23 13:34:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:36,019 INFO L93 Difference]: Finished difference Result 1111 states and 1461 transitions. [2022-07-23 13:34:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 13:34:36,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-07-23 13:34:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:36,024 INFO L225 Difference]: With dead ends: 1111 [2022-07-23 13:34:36,024 INFO L226 Difference]: Without dead ends: 931 [2022-07-23 13:34:36,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=346, Invalid=710, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 13:34:36,025 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 706 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:36,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 605 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 13:34:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-07-23 13:34:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 236. [2022-07-23 13:34:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 226 states have internal predecessors, (294), 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) [2022-07-23 13:34:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 303 transitions. [2022-07-23 13:34:36,046 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 303 transitions. Word has length 61 [2022-07-23 13:34:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:36,046 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 303 transitions. [2022-07-23 13:34:36,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-23 13:34:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 303 transitions. [2022-07-23 13:34:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 13:34:36,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:36,047 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:36,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:36,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-23 13:34:36,275 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1752267481, now seen corresponding path program 1 times [2022-07-23 13:34:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:36,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123134841] [2022-07-23 13:34:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:36,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:36,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 13:34:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-23 13:34:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:36,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123134841] [2022-07-23 13:34:36,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123134841] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:36,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386813740] [2022-07-23 13:34:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:36,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:36,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:36,377 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:36,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 13:34:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:36,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 13:34:36,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 13:34:36,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:34:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 13:34:36,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386813740] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:34:36,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:34:36,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2022-07-23 13:34:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243145788] [2022-07-23 13:34:36,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:34:36,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 13:34:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:36,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 13:34:36,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-23 13:34:36,645 INFO L87 Difference]: Start difference. First operand 236 states and 303 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-23 13:34:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:37,559 INFO L93 Difference]: Finished difference Result 691 states and 875 transitions. [2022-07-23 13:34:37,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-23 13:34:37,560 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 64 [2022-07-23 13:34:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:37,562 INFO L225 Difference]: With dead ends: 691 [2022-07-23 13:34:37,562 INFO L226 Difference]: Without dead ends: 498 [2022-07-23 13:34:37,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=565, Invalid=1985, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 13:34:37,564 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 573 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:37,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 605 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 13:34:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-07-23 13:34:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 236. [2022-07-23 13:34:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 226 states have internal predecessors, (290), 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) [2022-07-23 13:34:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 299 transitions. [2022-07-23 13:34:37,581 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 299 transitions. Word has length 64 [2022-07-23 13:34:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:37,582 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 299 transitions. [2022-07-23 13:34:37,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-23 13:34:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 299 transitions. [2022-07-23 13:34:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 13:34:37,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:37,583 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:37,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:37,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-23 13:34:37,806 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:37,807 INFO L85 PathProgramCache]: Analyzing trace with hash 22079575, now seen corresponding path program 1 times [2022-07-23 13:34:37,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:37,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228636043] [2022-07-23 13:34:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:37,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 13:34:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:37,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 13:34:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:37,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:37,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228636043] [2022-07-23 13:34:37,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228636043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:37,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800192177] [2022-07-23 13:34:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:37,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:37,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:37,943 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:37,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 13:34:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:38,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 13:34:38,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 13:34:38,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:34:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:38,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800192177] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:34:38,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:34:38,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-23 13:34:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139298726] [2022-07-23 13:34:38,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:34:38,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 13:34:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 13:34:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 13:34:38,197 INFO L87 Difference]: Start difference. First operand 236 states and 299 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 13:34:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:38,851 INFO L93 Difference]: Finished difference Result 866 states and 1099 transitions. [2022-07-23 13:34:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 13:34:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-23 13:34:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:38,854 INFO L225 Difference]: With dead ends: 866 [2022-07-23 13:34:38,854 INFO L226 Difference]: Without dead ends: 630 [2022-07-23 13:34:38,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-07-23 13:34:38,856 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 540 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:38,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 665 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 13:34:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-07-23 13:34:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 267. [2022-07-23 13:34:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 250 states have (on average 1.284) internal successors, (321), 257 states have internal predecessors, (321), 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) [2022-07-23 13:34:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2022-07-23 13:34:38,886 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 71 [2022-07-23 13:34:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:38,887 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2022-07-23 13:34:38,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 13:34:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2022-07-23 13:34:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 13:34:38,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:38,888 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-07-23 13:34:38,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:39,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 13:34:39,111 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash -859088779, now seen corresponding path program 1 times [2022-07-23 13:34:39,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:39,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588542177] [2022-07-23 13:34:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:39,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:39,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 13:34:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 13:34:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:39,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:39,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588542177] [2022-07-23 13:34:39,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588542177] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:39,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782785671] [2022-07-23 13:34:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:39,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:39,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:39,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 13:34:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:39,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 13:34:39,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 13:34:39,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:34:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:39,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782785671] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:34:39,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:34:39,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-07-23 13:34:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840454488] [2022-07-23 13:34:39,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:34:39,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-23 13:34:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:39,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-23 13:34:39,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2022-07-23 13:34:39,693 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-23 13:34:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:40,757 INFO L93 Difference]: Finished difference Result 1871 states and 2467 transitions. [2022-07-23 13:34:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-23 13:34:40,757 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-07-23 13:34:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:40,763 INFO L225 Difference]: With dead ends: 1871 [2022-07-23 13:34:40,763 INFO L226 Difference]: Without dead ends: 1649 [2022-07-23 13:34:40,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1154, Invalid=2386, Unknown=0, NotChecked=0, Total=3540 [2022-07-23 13:34:40,765 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1680 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:40,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 875 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 13:34:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2022-07-23 13:34:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 318. [2022-07-23 13:34:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 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) [2022-07-23 13:34:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 393 transitions. [2022-07-23 13:34:40,813 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 393 transitions. Word has length 83 [2022-07-23 13:34:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:40,813 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 393 transitions. [2022-07-23 13:34:40,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-23 13:34:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 393 transitions. [2022-07-23 13:34:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-23 13:34:40,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:40,819 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:40,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:41,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 13:34:41,035 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash -782914729, now seen corresponding path program 2 times [2022-07-23 13:34:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:41,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251012375] [2022-07-23 13:34:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:41,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-23 13:34:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 13:34:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:41,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:41,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251012375] [2022-07-23 13:34:41,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251012375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:41,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581393714] [2022-07-23 13:34:41,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:34:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:41,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:41,215 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:34:41,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-23 13:34:41,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 13:34:41,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:34:41,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 13:34:41,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-23 13:34:41,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:41,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581393714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:41,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:41,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2022-07-23 13:34:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142119254] [2022-07-23 13:34:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:41,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 13:34:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:41,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 13:34:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-07-23 13:34:41,362 INFO L87 Difference]: Start difference. First operand 318 states and 393 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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) [2022-07-23 13:34:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:41,487 INFO L93 Difference]: Finished difference Result 381 states and 458 transitions. [2022-07-23 13:34:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 13:34:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 91 [2022-07-23 13:34:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:41,489 INFO L225 Difference]: With dead ends: 381 [2022-07-23 13:34:41,489 INFO L226 Difference]: Without dead ends: 379 [2022-07-23 13:34:41,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-07-23 13:34:41,490 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 164 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:41,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 788 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-23 13:34:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 318. [2022-07-23 13:34:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 308 states have internal predecessors, (384), 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) [2022-07-23 13:34:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 393 transitions. [2022-07-23 13:34:41,521 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 393 transitions. Word has length 91 [2022-07-23 13:34:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:41,521 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 393 transitions. [2022-07-23 13:34:41,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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) [2022-07-23 13:34:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 393 transitions. [2022-07-23 13:34:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-23 13:34:41,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:41,522 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:41,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:41,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:41,735 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1592259433, now seen corresponding path program 1 times [2022-07-23 13:34:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308902628] [2022-07-23 13:34:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-23 13:34:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 13:34:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-23 13:34:41,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:41,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308902628] [2022-07-23 13:34:41,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308902628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:41,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009378292] [2022-07-23 13:34:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:41,810 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) [2022-07-23 13:34:41,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-23 13:34:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:41,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 13:34:41,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-23 13:34:41,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:34:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-23 13:34:41,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009378292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:34:41,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:34:41,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-23 13:34:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235290068] [2022-07-23 13:34:41,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:34:41,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 13:34:41,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:41,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 13:34:41,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-23 13:34:41,987 INFO L87 Difference]: Start difference. First operand 318 states and 393 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-23 13:34:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:42,156 INFO L93 Difference]: Finished difference Result 626 states and 748 transitions. [2022-07-23 13:34:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 13:34:42,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 91 [2022-07-23 13:34:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:42,159 INFO L225 Difference]: With dead ends: 626 [2022-07-23 13:34:42,159 INFO L226 Difference]: Without dead ends: 576 [2022-07-23 13:34:42,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-23 13:34:42,161 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 240 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:42,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1340 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:34:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-07-23 13:34:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 345. [2022-07-23 13:34:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 326 states have (on average 1.2668711656441718) internal successors, (413), 332 states have internal predecessors, (413), 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) [2022-07-23 13:34:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2022-07-23 13:34:42,192 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 91 [2022-07-23 13:34:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:42,192 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2022-07-23 13:34:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-23 13:34:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2022-07-23 13:34:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-23 13:34:42,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:42,194 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:42,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-23 13:34:42,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-23 13:34:42,417 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:34:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1592261355, now seen corresponding path program 1 times [2022-07-23 13:34:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:42,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313680917] [2022-07-23 13:34:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:34:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-23 13:34:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 13:34:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:42,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313680917] [2022-07-23 13:34:42,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313680917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:42,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040008015] [2022-07-23 13:34:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:42,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:42,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:42,587 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) [2022-07-23 13:34:42,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-23 13:34:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:42,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 13:34:42,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 13:34:42,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:34:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:34:43,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040008015] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:34:43,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:34:43,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-07-23 13:34:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845944195] [2022-07-23 13:34:43,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:34:43,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 13:34:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 13:34:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 13:34:43,156 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 13:34:53,524 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 42 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 13:35:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:35:06,537 INFO L93 Difference]: Finished difference Result 1210 states and 1556 transitions. [2022-07-23 13:35:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-23 13:35:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-07-23 13:35:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:35:06,543 INFO L225 Difference]: With dead ends: 1210 [2022-07-23 13:35:06,544 INFO L226 Difference]: Without dead ends: 905 [2022-07-23 13:35:06,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=993, Invalid=2909, Unknown=4, NotChecked=0, Total=3906 [2022-07-23 13:35:06,546 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 883 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 13:35:06,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1485 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-23 13:35:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-07-23 13:35:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 374. [2022-07-23 13:35:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 355 states have (on average 1.2338028169014084) internal successors, (438), 361 states have internal predecessors, (438), 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) [2022-07-23 13:35:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 451 transitions. [2022-07-23 13:35:06,590 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 451 transitions. Word has length 91 [2022-07-23 13:35:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:35:06,591 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 451 transitions. [2022-07-23 13:35:06,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 13:35:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 451 transitions. [2022-07-23 13:35:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-23 13:35:06,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:35:06,593 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-23 13:35:06,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-23 13:35:06,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:35:06,807 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:35:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:35:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1757329459, now seen corresponding path program 1 times [2022-07-23 13:35:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:35:06,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364511515] [2022-07-23 13:35:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:06,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:35:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:06,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:35:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:35:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 13:35:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 13:35:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:35:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:35:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364511515] [2022-07-23 13:35:07,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364511515] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:35:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305902711] [2022-07-23 13:35:07,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:35:07,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:35:07,073 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) [2022-07-23 13:35:07,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-23 13:35:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:07,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 13:35:07,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:35:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 26 proven. 483 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-23 13:35:07,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:35:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:35:08,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305902711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:35:08,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:35:08,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2022-07-23 13:35:08,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389850284] [2022-07-23 13:35:08,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:35:08,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 13:35:08,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:35:08,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 13:35:08,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=1702, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 13:35:08,078 INFO L87 Difference]: Start difference. First operand 374 states and 451 transitions. Second operand has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-23 13:35:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:35:10,931 INFO L93 Difference]: Finished difference Result 3475 states and 4693 transitions. [2022-07-23 13:35:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-07-23 13:35:10,931 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 123 [2022-07-23 13:35:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:35:10,941 INFO L225 Difference]: With dead ends: 3475 [2022-07-23 13:35:10,942 INFO L226 Difference]: Without dead ends: 3186 [2022-07-23 13:35:10,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3725 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4229, Invalid=8881, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 13:35:10,946 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 4090 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 13:35:10,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 1303 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 13:35:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2022-07-23 13:35:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 465. [2022-07-23 13:35:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 446 states have (on average 1.2309417040358743) internal successors, (549), 452 states have internal predecessors, (549), 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) [2022-07-23 13:35:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 562 transitions. [2022-07-23 13:35:11,046 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 562 transitions. Word has length 123 [2022-07-23 13:35:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:35:11,047 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 562 transitions. [2022-07-23 13:35:11,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-23 13:35:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 562 transitions. [2022-07-23 13:35:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-23 13:35:11,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:35:11,049 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:35:11,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-23 13:35:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:35:11,273 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:35:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:35:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1189284629, now seen corresponding path program 2 times [2022-07-23 13:35:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:35:11,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847423664] [2022-07-23 13:35:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:35:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:11,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:35:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:11,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:35:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:11,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 13:35:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 13:35:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 4 proven. 465 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-23 13:35:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:35:11,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847423664] [2022-07-23 13:35:11,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847423664] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:35:11,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453275987] [2022-07-23 13:35:11,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:35:11,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:35:11,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:35:11,640 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:35:11,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-23 13:35:11,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 13:35:11,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:35:11,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 13:35:11,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:35:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-23 13:35:11,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:35:11,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453275987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:35:11,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:35:11,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2022-07-23 13:35:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698639049] [2022-07-23 13:35:11,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:35:11,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 13:35:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:35:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 13:35:11,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-23 13:35:11,936 INFO L87 Difference]: Start difference. First operand 465 states and 562 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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) [2022-07-23 13:35:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:35:12,163 INFO L93 Difference]: Finished difference Result 553 states and 653 transitions. [2022-07-23 13:35:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 13:35:12,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 131 [2022-07-23 13:35:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:35:12,166 INFO L225 Difference]: With dead ends: 553 [2022-07-23 13:35:12,166 INFO L226 Difference]: Without dead ends: 520 [2022-07-23 13:35:12,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2022-07-23 13:35:12,168 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 123 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:35:12,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 863 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:35:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-23 13:35:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 463. [2022-07-23 13:35:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 444 states have (on average 1.2274774774774775) internal successors, (545), 450 states have internal predecessors, (545), 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) [2022-07-23 13:35:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 558 transitions. [2022-07-23 13:35:12,213 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 558 transitions. Word has length 131 [2022-07-23 13:35:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:35:12,214 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 558 transitions. [2022-07-23 13:35:12,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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) [2022-07-23 13:35:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 558 transitions. [2022-07-23 13:35:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-23 13:35:12,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:35:12,216 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:35:12,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-23 13:35:12,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-23 13:35:12,421 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:35:12,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:35:12,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2118452602, now seen corresponding path program 1 times [2022-07-23 13:35:12,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:35:12,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444481589] [2022-07-23 13:35:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:12,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:35:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:35:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:35:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 13:35:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 13:35:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-23 13:35:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:35:12,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444481589] [2022-07-23 13:35:12,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444481589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:35:12,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:35:12,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 13:35:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589718510] [2022-07-23 13:35:12,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:35:12,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 13:35:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:35:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 13:35:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 13:35:12,501 INFO L87 Difference]: Start difference. First operand 463 states and 558 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 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) [2022-07-23 13:35:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:35:12,650 INFO L93 Difference]: Finished difference Result 846 states and 1036 transitions. [2022-07-23 13:35:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:35:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 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 137 [2022-07-23 13:35:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:35:12,653 INFO L225 Difference]: With dead ends: 846 [2022-07-23 13:35:12,653 INFO L226 Difference]: Without dead ends: 571 [2022-07-23 13:35:12,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 13:35:12,654 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 60 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 667 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 [2022-07-23 13:35:12,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 667 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:35:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-23 13:35:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 468. [2022-07-23 13:35:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.2249443207126949) internal successors, (550), 455 states have internal predecessors, (550), 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) [2022-07-23 13:35:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 563 transitions. [2022-07-23 13:35:12,713 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 563 transitions. Word has length 137 [2022-07-23 13:35:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:35:12,713 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 563 transitions. [2022-07-23 13:35:12,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 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) [2022-07-23 13:35:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 563 transitions. [2022-07-23 13:35:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 13:35:12,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:35:12,715 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:35:12,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 13:35:12,716 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:35:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:35:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -407400813, now seen corresponding path program 1 times [2022-07-23 13:35:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:35:12,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126141301] [2022-07-23 13:35:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:35:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:35:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:35:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 13:35:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 13:35:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-23 13:35:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:35:12,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126141301] [2022-07-23 13:35:12,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126141301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:35:12,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:35:12,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 13:35:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991745104] [2022-07-23 13:35:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:35:12,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 13:35:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:35:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 13:35:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 13:35:12,818 INFO L87 Difference]: Start difference. First operand 468 states and 563 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 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) [2022-07-23 13:35:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:35:13,147 INFO L93 Difference]: Finished difference Result 813 states and 947 transitions. [2022-07-23 13:35:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 13:35:13,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 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 138 [2022-07-23 13:35:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:35:13,150 INFO L225 Difference]: With dead ends: 813 [2022-07-23 13:35:13,150 INFO L226 Difference]: Without dead ends: 777 [2022-07-23 13:35:13,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-07-23 13:35:13,151 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 382 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 13:35:13,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 905 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 13:35:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2022-07-23 13:35:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 508. [2022-07-23 13:35:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 488 states have (on average 1.2274590163934427) internal successors, (599), 493 states have internal predecessors, (599), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:35:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 614 transitions. [2022-07-23 13:35:13,209 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 614 transitions. Word has length 138 [2022-07-23 13:35:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:35:13,210 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 614 transitions. [2022-07-23 13:35:13,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 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) [2022-07-23 13:35:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 614 transitions. [2022-07-23 13:35:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 13:35:13,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:35:13,212 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:35:13,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 13:35:13,213 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:35:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:35:13,213 INFO L85 PathProgramCache]: Analyzing trace with hash -407402735, now seen corresponding path program 1 times [2022-07-23 13:35:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:35:13,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200280319] [2022-07-23 13:35:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:13,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:35:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:35:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:35:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 13:35:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 13:35:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-23 13:35:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:35:13,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200280319] [2022-07-23 13:35:13,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200280319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:35:13,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:35:13,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 13:35:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275153617] [2022-07-23 13:35:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:35:13,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 13:35:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:35:13,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 13:35:13,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-23 13:35:13,350 INFO L87 Difference]: Start difference. First operand 508 states and 614 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 9 states have internal predecessors, (49), 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) [2022-07-23 13:35:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:35:13,785 INFO L93 Difference]: Finished difference Result 936 states and 1086 transitions. [2022-07-23 13:35:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 13:35:13,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 9 states have internal predecessors, (49), 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 138 [2022-07-23 13:35:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:35:13,788 INFO L225 Difference]: With dead ends: 936 [2022-07-23 13:35:13,788 INFO L226 Difference]: Without dead ends: 893 [2022-07-23 13:35:13,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-07-23 13:35:13,789 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 267 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 13:35:13,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 2063 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 13:35:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-07-23 13:35:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 524. [2022-07-23 13:35:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 503 states have (on average 1.2246520874751492) internal successors, (616), 507 states have internal predecessors, (616), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-23 13:35:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 633 transitions. [2022-07-23 13:35:13,873 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 633 transitions. Word has length 138 [2022-07-23 13:35:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:35:13,874 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 633 transitions. [2022-07-23 13:35:13,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 9 states have internal predecessors, (49), 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) [2022-07-23 13:35:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 633 transitions. [2022-07-23 13:35:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 13:35:13,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:35:13,876 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:35:13,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 13:35:13,877 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:35:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:35:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1216749361, now seen corresponding path program 1 times [2022-07-23 13:35:13,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:35:13,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984811736] [2022-07-23 13:35:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:35:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:35:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:35:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:14,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 13:35:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 13:35:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 473 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 13:35:14,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:35:14,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984811736] [2022-07-23 13:35:14,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984811736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:35:14,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211202915] [2022-07-23 13:35:14,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:14,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:35:14,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:35:14,235 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:35:14,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-23 13:35:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:14,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-23 13:35:14,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:35:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2022-07-23 13:35:14,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:35:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-23 13:35:14,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211202915] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-23 13:35:14,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:35:14,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 10] total 33 [2022-07-23 13:35:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367591724] [2022-07-23 13:35:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:35:14,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 13:35:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:35:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 13:35:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 13:35:14,906 INFO L87 Difference]: Start difference. First operand 524 states and 633 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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) [2022-07-23 13:35:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:35:15,169 INFO L93 Difference]: Finished difference Result 613 states and 726 transitions. [2022-07-23 13:35:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 13:35:15,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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 138 [2022-07-23 13:35:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:35:15,171 INFO L225 Difference]: With dead ends: 613 [2022-07-23 13:35:15,171 INFO L226 Difference]: Without dead ends: 541 [2022-07-23 13:35:15,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2022-07-23 13:35:15,172 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 30 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:35:15,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 731 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:35:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-07-23 13:35:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 508. [2022-07-23 13:35:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 488 states have (on average 1.2254098360655739) internal successors, (598), 493 states have internal predecessors, (598), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:35:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 613 transitions. [2022-07-23 13:35:15,226 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 613 transitions. Word has length 138 [2022-07-23 13:35:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:35:15,226 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 613 transitions. [2022-07-23 13:35:15,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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) [2022-07-23 13:35:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 613 transitions. [2022-07-23 13:35:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-23 13:35:15,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:35:15,228 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:35:15,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-23 13:35:15,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-23 13:35:15,446 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:35:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:35:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2089841741, now seen corresponding path program 1 times [2022-07-23 13:35:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:35:15,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091484277] [2022-07-23 13:35:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:35:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:35:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:35:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 13:35:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:15,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 13:35:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-23 13:35:15,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:35:15,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091484277] [2022-07-23 13:35:15,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091484277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:35:15,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:35:15,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 13:35:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89643552] [2022-07-23 13:35:15,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:35:15,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 13:35:15,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:35:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 13:35:15,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-23 13:35:15,543 INFO L87 Difference]: Start difference. First operand 508 states and 613 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 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) [2022-07-23 13:35:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:35:15,810 INFO L93 Difference]: Finished difference Result 1031 states and 1242 transitions. [2022-07-23 13:35:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 13:35:15,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 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 139 [2022-07-23 13:35:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:35:15,813 INFO L225 Difference]: With dead ends: 1031 [2022-07-23 13:35:15,813 INFO L226 Difference]: Without dead ends: 716 [2022-07-23 13:35:15,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-23 13:35:15,813 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 171 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:35:15,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 855 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:35:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-07-23 13:35:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 515. [2022-07-23 13:35:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 495 states have (on average 1.2262626262626262) internal successors, (607), 500 states have internal predecessors, (607), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:35:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 622 transitions. [2022-07-23 13:35:15,867 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 622 transitions. Word has length 139 [2022-07-23 13:35:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:35:15,867 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 622 transitions. [2022-07-23 13:35:15,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 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) [2022-07-23 13:35:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 622 transitions. [2022-07-23 13:35:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-23 13:35:15,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:35:15,869 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:35:15,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 13:35:15,870 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:35:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:35:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash 898729452, now seen corresponding path program 1 times [2022-07-23 13:35:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:35:15,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750970026] [2022-07-23 13:35:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:35:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:35:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:15,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:35:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 13:35:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 13:35:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 4 proven. 475 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 13:35:16,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:35:16,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750970026] [2022-07-23 13:35:16,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750970026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:35:16,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117904130] [2022-07-23 13:35:16,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:35:16,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:35:16,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:35:16,208 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:35:16,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-23 13:35:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:35:16,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 13:35:16,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:35:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 36 proven. 455 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-23 13:35:16,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:35:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 4 proven. 475 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 13:35:17,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117904130] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:35:17,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:35:17,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2022-07-23 13:35:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162239260] [2022-07-23 13:35:17,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:35:17,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 13:35:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:35:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 13:35:17,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1831, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 13:35:17,585 INFO L87 Difference]: Start difference. First operand 515 states and 622 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 13:35:26,889 WARN L233 SmtUtils]: Spent 7.52s on a formula simplification. DAG size of input: 57 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 13:36:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:36:03,458 INFO L93 Difference]: Finished difference Result 1921 states and 2445 transitions. [2022-07-23 13:36:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-23 13:36:03,460 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 140 [2022-07-23 13:36:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:36:03,464 INFO L225 Difference]: With dead ends: 1921 [2022-07-23 13:36:03,464 INFO L226 Difference]: Without dead ends: 1532 [2022-07-23 13:36:03,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3172 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=2911, Invalid=9966, Unknown=5, NotChecked=0, Total=12882 [2022-07-23 13:36:03,468 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1853 mSDsluCounter, 4390 mSDsCounter, 0 mSdLazyCounter, 4627 mSolverCounterSat, 957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 5584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 957 IncrementalHoareTripleChecker+Valid, 4627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 13:36:03,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 4543 Invalid, 5584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [957 Valid, 4627 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-23 13:36:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2022-07-23 13:36:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 595. [2022-07-23 13:36:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 575 states have (on average 1.2052173913043478) internal successors, (693), 580 states have internal predecessors, (693), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:36:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 708 transitions. [2022-07-23 13:36:03,554 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 708 transitions. Word has length 140 [2022-07-23 13:36:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:36:03,555 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 708 transitions. [2022-07-23 13:36:03,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 13:36:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 708 transitions. [2022-07-23 13:36:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-23 13:36:03,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:36:03,557 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:03,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-23 13:36:03,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-23 13:36:03,770 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:36:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:36:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1709137516, now seen corresponding path program 2 times [2022-07-23 13:36:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:36:03,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609515241] [2022-07-23 13:36:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:36:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:36:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:36:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 13:36:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 13:36:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-23 13:36:03,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:36:03,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609515241] [2022-07-23 13:36:03,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609515241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:36:03,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088737891] [2022-07-23 13:36:03,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:36:03,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:36:03,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:36:03,970 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:36:03,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-23 13:36:04,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 13:36:04,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:36:04,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 13:36:04,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:36:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-23 13:36:04,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:36:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-23 13:36:04,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088737891] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:36:04,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:36:04,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-23 13:36:04,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127739712] [2022-07-23 13:36:04,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:36:04,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 13:36:04,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:36:04,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 13:36:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-23 13:36:04,371 INFO L87 Difference]: Start difference. First operand 595 states and 708 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-23 13:36:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:36:04,534 INFO L93 Difference]: Finished difference Result 771 states and 911 transitions. [2022-07-23 13:36:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 13:36:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 190 [2022-07-23 13:36:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:36:04,539 INFO L225 Difference]: With dead ends: 771 [2022-07-23 13:36:04,540 INFO L226 Difference]: Without dead ends: 718 [2022-07-23 13:36:04,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-23 13:36:04,541 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 214 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:36:04,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 869 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:36:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-07-23 13:36:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 593. [2022-07-23 13:36:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 573 states have (on average 1.2006980802792322) internal successors, (688), 578 states have internal predecessors, (688), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:36:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 703 transitions. [2022-07-23 13:36:04,620 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 703 transitions. Word has length 190 [2022-07-23 13:36:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:36:04,620 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 703 transitions. [2022-07-23 13:36:04,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-23 13:36:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 703 transitions. [2022-07-23 13:36:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-23 13:36:04,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:36:04,623 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:04,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-23 13:36:04,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:36:04,829 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:36:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:36:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash 787678057, now seen corresponding path program 1 times [2022-07-23 13:36:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:36:04,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41705101] [2022-07-23 13:36:04,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:36:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:36:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:36:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 13:36:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 13:36:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-23 13:36:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:36:04,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41705101] [2022-07-23 13:36:04,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41705101] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:36:04,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480841194] [2022-07-23 13:36:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:04,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:36:04,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:36:04,974 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:36:04,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-23 13:36:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:05,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 13:36:05,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:36:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-23 13:36:05,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:36:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-23 13:36:05,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480841194] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-23 13:36:05,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:36:05,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 8] total 10 [2022-07-23 13:36:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475478105] [2022-07-23 13:36:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:36:05,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:36:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:36:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:36:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-23 13:36:05,170 INFO L87 Difference]: Start difference. First operand 593 states and 703 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-23 13:36:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:36:05,251 INFO L93 Difference]: Finished difference Result 649 states and 766 transitions. [2022-07-23 13:36:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:36:05,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 196 [2022-07-23 13:36:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:36:05,253 INFO L225 Difference]: With dead ends: 649 [2022-07-23 13:36:05,253 INFO L226 Difference]: Without dead ends: 612 [2022-07-23 13:36:05,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-23 13:36:05,254 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:36:05,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:36:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-07-23 13:36:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 611. [2022-07-23 13:36:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 591 states have (on average 1.1979695431472082) internal successors, (708), 596 states have internal predecessors, (708), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:36:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 723 transitions. [2022-07-23 13:36:05,335 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 723 transitions. Word has length 196 [2022-07-23 13:36:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:36:05,336 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 723 transitions. [2022-07-23 13:36:05,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-23 13:36:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 723 transitions. [2022-07-23 13:36:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-23 13:36:05,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:36:05,338 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:05,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-23 13:36:05,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-23 13:36:05,559 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:36:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:36:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1045843495, now seen corresponding path program 1 times [2022-07-23 13:36:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:36:05,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271815240] [2022-07-23 13:36:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:36:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:36:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:36:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 13:36:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:05,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 13:36:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-23 13:36:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:36:05,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271815240] [2022-07-23 13:36:05,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271815240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:36:05,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:36:05,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 13:36:05,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377835285] [2022-07-23 13:36:05,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:36:05,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 13:36:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:36:05,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 13:36:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 13:36:05,712 INFO L87 Difference]: Start difference. First operand 611 states and 723 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 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) [2022-07-23 13:36:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:36:05,926 INFO L93 Difference]: Finished difference Result 768 states and 896 transitions. [2022-07-23 13:36:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 13:36:05,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 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 196 [2022-07-23 13:36:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:36:05,928 INFO L225 Difference]: With dead ends: 768 [2022-07-23 13:36:05,928 INFO L226 Difference]: Without dead ends: 752 [2022-07-23 13:36:05,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-23 13:36:05,929 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 152 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:36:05,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 784 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:36:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-23 13:36:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 617. [2022-07-23 13:36:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 597 states have (on average 1.1976549413735342) internal successors, (715), 602 states have internal predecessors, (715), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:36:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 730 transitions. [2022-07-23 13:36:06,010 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 730 transitions. Word has length 196 [2022-07-23 13:36:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:36:06,010 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 730 transitions. [2022-07-23 13:36:06,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 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) [2022-07-23 13:36:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 730 transitions. [2022-07-23 13:36:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-23 13:36:06,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:36:06,013 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:06,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-23 13:36:06,014 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:36:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:36:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1045843557, now seen corresponding path program 1 times [2022-07-23 13:36:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:36:06,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240985998] [2022-07-23 13:36:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:36:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:36:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:36:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 13:36:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:06,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 13:36:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-23 13:36:06,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:36:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240985998] [2022-07-23 13:36:06,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240985998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:36:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904582158] [2022-07-23 13:36:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:06,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:36:06,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:36:06,232 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:36:06,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-23 13:36:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:06,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 13:36:06,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:36:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-23 13:36:06,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:36:06,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904582158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:36:06,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:36:06,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2022-07-23 13:36:06,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131197917] [2022-07-23 13:36:06,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:36:06,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 13:36:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:36:06,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 13:36:06,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-23 13:36:06,637 INFO L87 Difference]: Start difference. First operand 617 states and 730 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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) [2022-07-23 13:36:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:36:06,904 INFO L93 Difference]: Finished difference Result 685 states and 800 transitions. [2022-07-23 13:36:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 13:36:06,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 196 [2022-07-23 13:36:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:36:06,906 INFO L225 Difference]: With dead ends: 685 [2022-07-23 13:36:06,906 INFO L226 Difference]: Without dead ends: 683 [2022-07-23 13:36:06,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-23 13:36:06,907 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 124 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:36:06,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 690 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:36:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-07-23 13:36:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 632. [2022-07-23 13:36:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 612 states have (on average 1.1977124183006536) internal successors, (733), 617 states have internal predecessors, (733), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:36:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 748 transitions. [2022-07-23 13:36:06,999 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 748 transitions. Word has length 196 [2022-07-23 13:36:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:36:06,999 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 748 transitions. [2022-07-23 13:36:07,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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) [2022-07-23 13:36:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 748 transitions. [2022-07-23 13:36:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-23 13:36:07,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:36:07,002 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:07,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-23 13:36:07,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-23 13:36:07,227 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:36:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:36:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1938587819, now seen corresponding path program 1 times [2022-07-23 13:36:07,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:36:07,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284022057] [2022-07-23 13:36:07,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:07,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:36:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:36:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:07,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:36:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:07,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 13:36:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 13:36:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-23 13:36:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:36:07,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284022057] [2022-07-23 13:36:07,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284022057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:36:07,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:36:07,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 13:36:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429645624] [2022-07-23 13:36:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:36:07,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 13:36:07,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:36:07,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 13:36:07,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-23 13:36:07,458 INFO L87 Difference]: Start difference. First operand 632 states and 748 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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) [2022-07-23 13:36:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:36:07,829 INFO L93 Difference]: Finished difference Result 748 states and 876 transitions. [2022-07-23 13:36:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 13:36:07,829 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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 197 [2022-07-23 13:36:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:36:07,832 INFO L225 Difference]: With dead ends: 748 [2022-07-23 13:36:07,832 INFO L226 Difference]: Without dead ends: 738 [2022-07-23 13:36:07,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-07-23 13:36:07,832 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 164 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 13:36:07,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 946 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 13:36:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-07-23 13:36:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 626. [2022-07-23 13:36:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 606 states have (on average 1.1947194719471947) internal successors, (724), 611 states have internal predecessors, (724), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:36:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 739 transitions. [2022-07-23 13:36:07,916 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 739 transitions. Word has length 197 [2022-07-23 13:36:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:36:07,916 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 739 transitions. [2022-07-23 13:36:07,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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) [2022-07-23 13:36:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 739 transitions. [2022-07-23 13:36:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-23 13:36:07,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:36:07,918 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:07,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-23 13:36:07,919 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:36:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:36:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 156348892, now seen corresponding path program 1 times [2022-07-23 13:36:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:36:07,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11454516] [2022-07-23 13:36:07,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:36:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:08,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:36:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:08,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:36:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 13:36:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 13:36:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2022-07-23 13:36:08,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:36:08,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11454516] [2022-07-23 13:36:08,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11454516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:36:08,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704641123] [2022-07-23 13:36:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:08,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:36:08,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:36:08,072 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 13:36:08,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-23 13:36:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:08,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-23 13:36:08,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:36:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2022-07-23 13:36:08,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:36:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2022-07-23 13:36:08,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704641123] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:36:08,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:36:08,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2022-07-23 13:36:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501632957] [2022-07-23 13:36:08,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:36:08,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 13:36:08,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:36:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 13:36:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-07-23 13:36:08,766 INFO L87 Difference]: Start difference. First operand 626 states and 739 transitions. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 21 states have internal predecessors, (80), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-23 13:36:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:36:10,223 INFO L93 Difference]: Finished difference Result 1147 states and 1342 transitions. [2022-07-23 13:36:10,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 13:36:10,224 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 21 states have internal predecessors, (80), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 197 [2022-07-23 13:36:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:36:10,226 INFO L225 Difference]: With dead ends: 1147 [2022-07-23 13:36:10,226 INFO L226 Difference]: Without dead ends: 992 [2022-07-23 13:36:10,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=384, Invalid=2696, Unknown=0, NotChecked=0, Total=3080 [2022-07-23 13:36:10,228 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 494 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 13:36:10,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2301 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 13:36:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-07-23 13:36:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 620. [2022-07-23 13:36:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 600 states have (on average 1.1933333333333334) internal successors, (716), 605 states have internal predecessors, (716), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-23 13:36:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 731 transitions. [2022-07-23 13:36:10,318 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 731 transitions. Word has length 197 [2022-07-23 13:36:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:36:10,318 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 731 transitions. [2022-07-23 13:36:10,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 21 states have internal predecessors, (80), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-23 13:36:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 731 transitions. [2022-07-23 13:36:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-23 13:36:10,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:36:10,320 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:10,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-23 13:36:10,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:36:10,545 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:36:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:36:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash 33320039, now seen corresponding path program 1 times [2022-07-23 13:36:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:36:10,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678604619] [2022-07-23 13:36:10,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:36:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:36:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 13:36:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:10,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 13:36:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 13:36:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:36:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-07-23 13:36:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:36:10,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678604619] [2022-07-23 13:36:10,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678604619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:36:10,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:36:10,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 13:36:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397655861] [2022-07-23 13:36:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:36:10,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 13:36:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:36:10,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 13:36:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-23 13:36:10,850 INFO L87 Difference]: Start difference. First operand 620 states and 731 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 13:36:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:36:11,274 INFO L93 Difference]: Finished difference Result 766 states and 893 transitions. [2022-07-23 13:36:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 13:36:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 198 [2022-07-23 13:36:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:36:11,276 INFO L225 Difference]: With dead ends: 766 [2022-07-23 13:36:11,276 INFO L226 Difference]: Without dead ends: 734 [2022-07-23 13:36:11,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-23 13:36:11,277 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 189 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 13:36:11,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1093 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 13:36:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-07-23 13:36:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 608. [2022-07-23 13:36:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 589 states have (on average 1.1935483870967742) internal successors, (703), 594 states have internal predecessors, (703), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-23 13:36:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 717 transitions. [2022-07-23 13:36:11,359 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 717 transitions. Word has length 198 [2022-07-23 13:36:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:36:11,359 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 717 transitions. [2022-07-23 13:36:11,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-23 13:36:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 717 transitions. [2022-07-23 13:36:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-23 13:36:11,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:36:11,361 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:11,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-23 13:36:11,362 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-07-23 13:36:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:36:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1058160247, now seen corresponding path program 1 times [2022-07-23 13:36:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:36:11,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887178062] [2022-07-23 13:36:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:36:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:36:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 13:36:11,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 13:36:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 13:36:11,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 13:36:11,469 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 13:36:11,470 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-07-23 13:36:11,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-07-23 13:36:11,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-07-23 13:36:11,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-07-23 13:36:11,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-07-23 13:36:11,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-07-23 13:36:11,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-07-23 13:36:11,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-07-23 13:36:11,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-07-23 13:36:11,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-07-23 13:36:11,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-07-23 13:36:11,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-07-23 13:36:11,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-07-23 13:36:11,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-07-23 13:36:11,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-07-23 13:36:11,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-07-23 13:36:11,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-07-23 13:36:11,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-07-23 13:36:11,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-23 13:36:11,478 INFO L356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:36:11,483 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 13:36:11,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:36:11 BoogieIcfgContainer [2022-07-23 13:36:11,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 13:36:11,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 13:36:11,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 13:36:11,610 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 13:36:11,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:29" (3/4) ... [2022-07-23 13:36:11,613 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 13:36:11,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 13:36:11,614 INFO L158 Benchmark]: Toolchain (without parser) took 103105.61ms. Allocated memory was 90.2MB in the beginning and 312.5MB in the end (delta: 222.3MB). Free memory was 55.1MB in the beginning and 148.3MB in the end (delta: -93.2MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. [2022-07-23 13:36:11,615 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:36:11,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.86ms. Allocated memory is still 90.2MB. Free memory was 54.9MB in the beginning and 62.2MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 13:36:11,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.91ms. Allocated memory is still 90.2MB. Free memory was 62.2MB in the beginning and 60.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 13:36:11,621 INFO L158 Benchmark]: Boogie Preprocessor took 31.48ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 58.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 13:36:11,621 INFO L158 Benchmark]: RCFGBuilder took 504.63ms. Allocated memory is still 90.2MB. Free memory was 58.4MB in the beginning and 38.4MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-23 13:36:11,621 INFO L158 Benchmark]: TraceAbstraction took 102185.58ms. Allocated memory was 109.1MB in the beginning and 312.5MB in the end (delta: 203.4MB). Free memory was 85.6MB in the beginning and 148.3MB in the end (delta: -62.7MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. [2022-07-23 13:36:11,621 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 312.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:36:11,623 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.19ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.86ms. Allocated memory is still 90.2MB. Free memory was 54.9MB in the beginning and 62.2MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.91ms. Allocated memory is still 90.2MB. Free memory was 62.2MB in the beginning and 60.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.48ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 58.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.63ms. Allocated memory is still 90.2MB. Free memory was 58.4MB in the beginning and 38.4MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 102185.58ms. Allocated memory was 109.1MB in the beginning and 312.5MB in the end (delta: 203.4MB). Free memory was 85.6MB in the beginning and 148.3MB in the end (delta: -62.7MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 312.5MB. Free memory is still 148.3MB. 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: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=-126, eb=-127] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L78] __retres4 = res VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, \result=1744830464, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L29] COND FALSE !(! m) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L57] COND TRUE 1 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] EXPR e + 128 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] EXPR e + 128 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=33554433, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L78] __retres4 = res VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, __retres4=33554433, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=33554433, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L80] return (__retres4); VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, \result=33554433, __retres4=33554433, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=33554433, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=33554433, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=33554432, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L78] __retres4 = res VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, __retres4=2147483647, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, \result=36028799166447615, __retres4=2147483647, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L241] RET, EXPR base2flt(mb, eb) VAL [a=33554433, base2flt(mb, eb)=36028799166447615, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, zero=0] [L241] b = base2flt(mb, eb) [L243] COND FALSE !(b < zero) VAL [a=33554433, b=2147483647, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, zero=0] [L246] COND TRUE b > zero [L247] tmp = 1 VAL [a=33554433, b=2147483647, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=1, zero=0] [L251] sb = tmp VAL [a=33554433, b=2147483647, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, 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)=33554433, \old(b)=2147483647, a=33554433, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L158] COND TRUE a < b [L159] tmp = a [L160] a = b [L161] b = tmp VAL [\old(a)=33554433, \old(b)=2147483647, a=2147483647, b=33554433, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=33554433] [L165] COND FALSE !(! b) VAL [\old(a)=33554433, \old(b)=2147483647, a=2147483647, b=33554433, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=33554433] [L171] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=33554433, \old(b)=2147483647, a=2147483647, b=33554433, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=33554433] [L172] (int )(a >> 24U) - 128 VAL [\old(a)=33554433, \old(b)=2147483647, a=2147483647, b=33554433, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=33554433] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 120 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 102.0s, OverallIterations: 37, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 82.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15006 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14987 mSDsluCounter, 30967 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26802 mSDsCounter, 2946 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13197 IncrementalHoareTripleChecker+Invalid, 16143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2946 mSolverCounterUnsat, 4165 mSDtfsCounter, 13197 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4648 GetRequests, 3782 SyntacticMatches, 4 SemanticMatches, 862 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11355 ImplicationChecksByTransitivity, 74.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=33, InterpolantAutomatonStates: 660, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 9871 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 5650 NumberOfCodeBlocks, 5440 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 6862 ConstructedInterpolants, 0 QuantifiedInterpolants, 19531 SizeOfPredicates, 70 NumberOfNonLiveVariables, 4917 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 71 InterpolantComputations, 25 PerfectInterpolantSequences, 24772/29427 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-23 13:36:11,732 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