./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 02:15:10,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:15:10,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:15:10,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:15:10,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:15:10,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:15:10,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:15:10,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:15:10,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:15:10,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:15:10,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:15:10,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:15:10,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:15:10,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:15:10,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:15:10,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:15:10,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:15:10,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:15:10,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:15:10,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:15:10,738 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:15:10,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:15:10,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:15:10,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:15:10,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:15:10,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:15:10,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:15:10,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:15:10,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:15:10,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:15:10,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:15:10,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:15:10,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:15:10,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:15:10,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:15:10,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:15:10,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:15:10,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:15:10,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:15:10,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:15:10,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:15:10,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:15:10,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-13 02:15:10,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:15:10,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:15:10,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:15:10,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:15:10,783 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:15:10,783 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:15:10,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:15:10,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:15:10,784 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:15:10,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:15:10,784 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:15:10,784 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:15:10,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:15:10,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:15:10,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:15:10,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:15:10,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:15:10,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:15:10,785 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:15:10,785 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:15:10,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:15:10,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:15:10,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:15:10,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:15:10,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:15:10,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:15:10,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:10,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:15:10,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:15:10,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:15:10,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:15:10,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:15:10,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:15:10,791 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2022-07-13 02:15:10,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:15:11,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:15:11,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:15:11,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:15:11,028 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:15:11,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2022-07-13 02:15:11,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339739154/1508b8d56e7a4f20a7458110fc2cf828/FLAG394078f1c [2022-07-13 02:15:11,433 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:15:11,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2022-07-13 02:15:11,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339739154/1508b8d56e7a4f20a7458110fc2cf828/FLAG394078f1c [2022-07-13 02:15:11,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339739154/1508b8d56e7a4f20a7458110fc2cf828 [2022-07-13 02:15:11,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:15:11,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:15:11,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:11,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:15:11,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:15:11,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:11" (1/1) ... [2022-07-13 02:15:11,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4089c070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:11, skipping insertion in model container [2022-07-13 02:15:11,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:11" (1/1) ... [2022-07-13 02:15:11,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:15:11,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:15:12,010 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_1-2a.c.cil.c[755,768] [2022-07-13 02:15:12,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:12,148 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:15:12,158 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_1-2a.c.cil.c[755,768] [2022-07-13 02:15:12,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:12,231 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:15:12,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12 WrapperNode [2022-07-13 02:15:12,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:12,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:12,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:15:12,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:15:12,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,281 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 226 [2022-07-13 02:15:12,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:12,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:15:12,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:15:12,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:15:12,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:15:12,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:15:12,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:15:12,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:15:12,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (1/1) ... [2022-07-13 02:15:12,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:12,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:12,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 02:15:12,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 02:15:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:15:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 02:15:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 02:15:12,446 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 02:15:12,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:15:12,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:15:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 02:15:12,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 02:15:12,533 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:15:12,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:15:12,955 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:15:12,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:15:12,961 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 02:15:12,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:12 BoogieIcfgContainer [2022-07-13 02:15:12,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:15:12,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:15:12,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:15:12,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:15:12,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:15:11" (1/3) ... [2022-07-13 02:15:12,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b73f0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:12, skipping insertion in model container [2022-07-13 02:15:12,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:12" (2/3) ... [2022-07-13 02:15:12,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b73f0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:12, skipping insertion in model container [2022-07-13 02:15:12,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:12" (3/3) ... [2022-07-13 02:15:12,973 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2022-07-13 02:15:12,982 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:15:12,982 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-13 02:15:13,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:15:13,035 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@5b43da4f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b0d9143 [2022-07-13 02:15:13,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-13 02:15:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 111 states have (on average 1.7837837837837838) internal successors, (198), 133 states have internal predecessors, (198), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 02:15:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:13,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:13,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:13,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1487654612, now seen corresponding path program 1 times [2022-07-13 02:15:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:13,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228165232] [2022-07-13 02:15:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:13,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:13,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228165232] [2022-07-13 02:15:13,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228165232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:13,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:13,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:15:13,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113754931] [2022-07-13 02:15:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:13,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 02:15:13,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 02:15:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:13,198 INFO L87 Difference]: Start difference. First operand has 142 states, 111 states have (on average 1.7837837837837838) internal successors, (198), 133 states have internal predecessors, (198), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:13,242 INFO L93 Difference]: Finished difference Result 279 states and 432 transitions. [2022-07-13 02:15:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 02:15:13,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 02:15:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:13,274 INFO L225 Difference]: With dead ends: 279 [2022-07-13 02:15:13,275 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 02:15:13,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:13,283 INFO L413 NwaCegarLoop]: 193 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, 193 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:13,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 02:15:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-13 02:15:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 99 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2022-07-13 02:15:13,322 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 136 transitions. Word has length 9 [2022-07-13 02:15:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:13,322 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 136 transitions. [2022-07-13 02:15:13,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 136 transitions. [2022-07-13 02:15:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:13,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:13,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:13,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:15:13,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:13,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1486713264, now seen corresponding path program 1 times [2022-07-13 02:15:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:13,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043670563] [2022-07-13 02:15:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:13,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:13,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043670563] [2022-07-13 02:15:13,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043670563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:13,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:13,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095845087] [2022-07-13 02:15:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:13,411 INFO L87 Difference]: Start difference. First operand 107 states and 136 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:13,503 INFO L93 Difference]: Finished difference Result 273 states and 363 transitions. [2022-07-13 02:15:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 02:15:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:13,505 INFO L225 Difference]: With dead ends: 273 [2022-07-13 02:15:13,505 INFO L226 Difference]: Without dead ends: 169 [2022-07-13 02:15:13,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:13,507 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:13,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 358 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-13 02:15:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2022-07-13 02:15:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 147 states have internal predecessors, (201), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 211 transitions. [2022-07-13 02:15:13,518 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 211 transitions. Word has length 9 [2022-07-13 02:15:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:13,518 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 211 transitions. [2022-07-13 02:15:13,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 211 transitions. [2022-07-13 02:15:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 02:15:13,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:13,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:13,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:15:13,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash 71825417, now seen corresponding path program 1 times [2022-07-13 02:15:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120554261] [2022-07-13 02:15:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:13,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:13,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120554261] [2022-07-13 02:15:13,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120554261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:13,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:13,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406958956] [2022-07-13 02:15:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:13,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:13,567 INFO L87 Difference]: Start difference. First operand 156 states and 211 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-13 02:15:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:13,662 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2022-07-13 02:15:13,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:13,663 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-13 02:15:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:13,664 INFO L225 Difference]: With dead ends: 191 [2022-07-13 02:15:13,664 INFO L226 Difference]: Without dead ends: 188 [2022-07-13 02:15:13,664 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-13 02:15:13,665 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 161 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:13,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 479 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-13 02:15:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2022-07-13 02:15:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 154 states have internal predecessors, (212), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 222 transitions. [2022-07-13 02:15:13,680 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 222 transitions. Word has length 13 [2022-07-13 02:15:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:13,680 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 222 transitions. [2022-07-13 02:15:13,681 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-13 02:15:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 222 transitions. [2022-07-13 02:15:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 02:15:13,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:13,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:13,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 02:15:13,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2068379248, now seen corresponding path program 1 times [2022-07-13 02:15:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:13,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550001315] [2022-07-13 02:15:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:13,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550001315] [2022-07-13 02:15:13,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550001315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:13,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:13,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:13,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42346401] [2022-07-13 02:15:13,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:13,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:13,713 INFO L87 Difference]: Start difference. First operand 163 states and 222 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-13 02:15:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:13,810 INFO L93 Difference]: Finished difference Result 306 states and 402 transitions. [2022-07-13 02:15:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:13,810 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-13 02:15:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:13,811 INFO L225 Difference]: With dead ends: 306 [2022-07-13 02:15:13,812 INFO L226 Difference]: Without dead ends: 198 [2022-07-13 02:15:13,812 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-13 02:15:13,813 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 190 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:13,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 396 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-13 02:15:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2022-07-13 02:15:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.524822695035461) internal successors, (215), 158 states have internal predecessors, (215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2022-07-13 02:15:13,820 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 14 [2022-07-13 02:15:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:13,821 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2022-07-13 02:15:13,821 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-13 02:15:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2022-07-13 02:15:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:15:13,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:13,822 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 02:15:13,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:13,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1659659560, now seen corresponding path program 1 times [2022-07-13 02:15:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:13,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671690944] [2022-07-13 02:15:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:13,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:13,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671690944] [2022-07-13 02:15:13,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671690944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:13,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584810792] [2022-07-13 02:15:13,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:13,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:13,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:13,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:13,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 02:15:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:13,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:13,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:13,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:13,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584810792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:13,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:13,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376252739] [2022-07-13 02:15:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:13,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:13,970 INFO L87 Difference]: Start difference. First operand 167 states and 225 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:14,044 INFO L93 Difference]: Finished difference Result 237 states and 322 transitions. [2022-07-13 02:15:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:14,044 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-13 02:15:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:14,045 INFO L225 Difference]: With dead ends: 237 [2022-07-13 02:15:14,046 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 02:15:14,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:14,047 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 189 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:14,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 377 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 02:15:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 203. [2022-07-13 02:15:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 177 states have (on average 1.5536723163841808) internal successors, (275), 193 states have internal predecessors, (275), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 285 transitions. [2022-07-13 02:15:14,054 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 285 transitions. Word has length 16 [2022-07-13 02:15:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:14,055 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 285 transitions. [2022-07-13 02:15:14,055 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 285 transitions. [2022-07-13 02:15:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 02:15:14,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:14,056 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:14,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:14,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:14,299 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1313978510, now seen corresponding path program 1 times [2022-07-13 02:15:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:14,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973405327] [2022-07-13 02:15:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:14,349 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-13 02:15:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:14,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973405327] [2022-07-13 02:15:14,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973405327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:14,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716370137] [2022-07-13 02:15:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:14,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:14,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:14,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 02:15:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:14,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:15:14,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:14,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:14,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716370137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:14,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:14,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 02:15:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510892666] [2022-07-13 02:15:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:14,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:14,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:14,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:14,415 INFO L87 Difference]: Start difference. First operand 203 states and 285 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-13 02:15:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:14,460 INFO L93 Difference]: Finished difference Result 255 states and 356 transitions. [2022-07-13 02:15:14,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:14,461 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-13 02:15:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:14,462 INFO L225 Difference]: With dead ends: 255 [2022-07-13 02:15:14,462 INFO L226 Difference]: Without dead ends: 253 [2022-07-13 02:15:14,463 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-13 02:15:14,463 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 26 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 387 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:14,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 387 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-13 02:15:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 196. [2022-07-13 02:15:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 186 states have internal predecessors, (260), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 270 transitions. [2022-07-13 02:15:14,470 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 270 transitions. Word has length 15 [2022-07-13 02:15:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:14,470 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 270 transitions. [2022-07-13 02:15:14,471 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-13 02:15:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 270 transitions. [2022-07-13 02:15:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 02:15:14,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:14,471 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:14,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:14,688 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,SelfDestructingSolverStorable5 [2022-07-13 02:15:14,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash 90161249, now seen corresponding path program 1 times [2022-07-13 02:15:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:14,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527477471] [2022-07-13 02:15:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527477471] [2022-07-13 02:15:14,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527477471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403825451] [2022-07-13 02:15:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:14,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:14,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:14,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 02:15:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:14,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 02:15:14,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 02:15:14,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:14,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403825451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:14,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:14,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-13 02:15:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990107018] [2022-07-13 02:15:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:14,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:15:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:15:14,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:14,795 INFO L87 Difference]: Start difference. First operand 196 states and 270 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:14,835 INFO L93 Difference]: Finished difference Result 205 states and 279 transitions. [2022-07-13 02:15:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:15:14,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-13 02:15:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:14,837 INFO L225 Difference]: With dead ends: 205 [2022-07-13 02:15:14,837 INFO L226 Difference]: Without dead ends: 204 [2022-07-13 02:15:14,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:14,840 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:14,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-13 02:15:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2022-07-13 02:15:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 168 states have (on average 1.5178571428571428) internal successors, (255), 183 states have internal predecessors, (255), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 265 transitions. [2022-07-13 02:15:14,847 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 265 transitions. Word has length 17 [2022-07-13 02:15:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:14,847 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 265 transitions. [2022-07-13 02:15:14,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 265 transitions. [2022-07-13 02:15:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:15:14,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:14,848 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:14,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:15,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:15,054 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:15,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash -612520448, now seen corresponding path program 1 times [2022-07-13 02:15:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:15,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227972721] [2022-07-13 02:15:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:15,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:15,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227972721] [2022-07-13 02:15:15,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227972721] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:15,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643415935] [2022-07-13 02:15:15,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:15,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:15,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:15,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 02:15:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:15,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:15,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:15,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643415935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:15,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:15,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16633113] [2022-07-13 02:15:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:15,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:15,200 INFO L87 Difference]: Start difference. First operand 193 states and 265 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:15,285 INFO L93 Difference]: Finished difference Result 236 states and 319 transitions. [2022-07-13 02:15:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:15,285 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-13 02:15:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:15,287 INFO L225 Difference]: With dead ends: 236 [2022-07-13 02:15:15,287 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 02:15:15,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:15,288 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 174 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:15,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 378 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 02:15:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 201. [2022-07-13 02:15:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 191 states have internal predecessors, (266), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 276 transitions. [2022-07-13 02:15:15,297 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 276 transitions. Word has length 18 [2022-07-13 02:15:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:15,297 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 276 transitions. [2022-07-13 02:15:15,297 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 276 transitions. [2022-07-13 02:15:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:15:15,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:15,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:15,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:15,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:15,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:15,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -738180446, now seen corresponding path program 1 times [2022-07-13 02:15:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:15,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142390949] [2022-07-13 02:15:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,538 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-13 02:15:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:15,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142390949] [2022-07-13 02:15:15,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142390949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:15,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047117152] [2022-07-13 02:15:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:15,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:15,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:15,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:15,539 INFO L87 Difference]: Start difference. First operand 201 states and 276 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-13 02:15:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:15,599 INFO L93 Difference]: Finished difference Result 256 states and 352 transitions. [2022-07-13 02:15:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:15,599 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-13 02:15:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:15,600 INFO L225 Difference]: With dead ends: 256 [2022-07-13 02:15:15,600 INFO L226 Difference]: Without dead ends: 254 [2022-07-13 02:15:15,601 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-13 02:15:15,602 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 24 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:15,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 374 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-13 02:15:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2022-07-13 02:15:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.5) internal successors, (264), 191 states have internal predecessors, (264), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2022-07-13 02:15:15,611 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 274 transitions. Word has length 19 [2022-07-13 02:15:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:15,612 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 274 transitions. [2022-07-13 02:15:15,612 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-13 02:15:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 274 transitions. [2022-07-13 02:15:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 02:15:15,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:15,615 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-13 02:15:15,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 02:15:15,616 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash 894698226, now seen corresponding path program 1 times [2022-07-13 02:15:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:15,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259157800] [2022-07-13 02:15:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,687 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-13 02:15:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:15,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259157800] [2022-07-13 02:15:15,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259157800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:15,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238053489] [2022-07-13 02:15:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:15,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:15,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:15,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 02:15:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:15,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:15,778 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-13 02:15:15,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:15,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238053489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:15,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:15,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530358526] [2022-07-13 02:15:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:15,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:15,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:15,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:15,780 INFO L87 Difference]: Start difference. First operand 201 states and 274 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-13 02:15:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:15,838 INFO L93 Difference]: Finished difference Result 231 states and 315 transitions. [2022-07-13 02:15:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:15,839 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-13 02:15:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:15,840 INFO L225 Difference]: With dead ends: 231 [2022-07-13 02:15:15,840 INFO L226 Difference]: Without dead ends: 228 [2022-07-13 02:15:15,840 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-13 02:15:15,840 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 179 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:15,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 375 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-13 02:15:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 189. [2022-07-13 02:15:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 167 states have (on average 1.4610778443113772) internal successors, (244), 179 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 254 transitions. [2022-07-13 02:15:15,846 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 254 transitions. Word has length 23 [2022-07-13 02:15:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:15,846 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 254 transitions. [2022-07-13 02:15:15,846 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-13 02:15:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 254 transitions. [2022-07-13 02:15:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 02:15:15,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:15,847 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-13 02:15:15,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:16,062 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,SelfDestructingSolverStorable9 [2022-07-13 02:15:16,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1698985882, now seen corresponding path program 1 times [2022-07-13 02:15:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:16,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101909335] [2022-07-13 02:15:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,098 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-13 02:15:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:16,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101909335] [2022-07-13 02:15:16,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101909335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:16,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015862369] [2022-07-13 02:15:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:16,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:16,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:16,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 02:15:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:16,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:16,189 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-13 02:15:16,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:16,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015862369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:16,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:16,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504299487] [2022-07-13 02:15:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:16,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:16,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:16,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:16,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:16,190 INFO L87 Difference]: Start difference. First operand 189 states and 254 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-13 02:15:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:16,248 INFO L93 Difference]: Finished difference Result 219 states and 294 transitions. [2022-07-13 02:15:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:16,249 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-13 02:15:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:16,250 INFO L225 Difference]: With dead ends: 219 [2022-07-13 02:15:16,250 INFO L226 Difference]: Without dead ends: 216 [2022-07-13 02:15:16,250 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-13 02:15:16,250 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 163 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:16,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 381 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-13 02:15:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2022-07-13 02:15:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.440251572327044) internal successors, (229), 168 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 239 transitions. [2022-07-13 02:15:16,256 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 239 transitions. Word has length 25 [2022-07-13 02:15:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:16,256 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 239 transitions. [2022-07-13 02:15:16,256 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-13 02:15:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 239 transitions. [2022-07-13 02:15:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 02:15:16,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:16,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:16,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:16,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:16,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1113378165, now seen corresponding path program 1 times [2022-07-13 02:15:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:16,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081168761] [2022-07-13 02:15:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:16,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:16,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081168761] [2022-07-13 02:15:16,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081168761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:16,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:16,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 02:15:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320281403] [2022-07-13 02:15:16,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:16,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:15:16,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:16,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:15:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:15:16,611 INFO L87 Difference]: Start difference. First operand 178 states and 239 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:16,704 INFO L93 Difference]: Finished difference Result 330 states and 422 transitions. [2022-07-13 02:15:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:15:16,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-13 02:15:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:16,705 INFO L225 Difference]: With dead ends: 330 [2022-07-13 02:15:16,706 INFO L226 Difference]: Without dead ends: 260 [2022-07-13 02:15:16,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:16,706 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 89 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:16,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 758 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-13 02:15:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 180. [2022-07-13 02:15:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 170 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 239 transitions. [2022-07-13 02:15:16,728 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 239 transitions. Word has length 31 [2022-07-13 02:15:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:16,728 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 239 transitions. [2022-07-13 02:15:16,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2022-07-13 02:15:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 02:15:16,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:16,729 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-13 02:15:16,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 02:15:16,730 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2056125210, now seen corresponding path program 1 times [2022-07-13 02:15:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:16,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824404878] [2022-07-13 02:15:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:16,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:16,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824404878] [2022-07-13 02:15:16,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824404878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:16,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339508931] [2022-07-13 02:15:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:16,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:16,856 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:16,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 02:15:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:16,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:16,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 02:15:17,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339508931] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:17,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 02:15:17,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 13 [2022-07-13 02:15:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905637390] [2022-07-13 02:15:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:17,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:17,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:17,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:15:17,046 INFO L87 Difference]: Start difference. First operand 180 states and 239 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:17,080 INFO L93 Difference]: Finished difference Result 232 states and 297 transitions. [2022-07-13 02:15:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:17,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-07-13 02:15:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:17,081 INFO L225 Difference]: With dead ends: 232 [2022-07-13 02:15:17,081 INFO L226 Difference]: Without dead ends: 181 [2022-07-13 02:15:17,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:15:17,082 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 107 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:17,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 189 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-13 02:15:17,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2022-07-13 02:15:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 170 states have internal predecessors, (228), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 238 transitions. [2022-07-13 02:15:17,102 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 238 transitions. Word has length 35 [2022-07-13 02:15:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:17,102 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 238 transitions. [2022-07-13 02:15:17,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 238 transitions. [2022-07-13 02:15:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 02:15:17,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:17,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:17,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:17,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:17,320 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:17,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash 842612718, now seen corresponding path program 1 times [2022-07-13 02:15:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:17,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906424772] [2022-07-13 02:15:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:17,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906424772] [2022-07-13 02:15:17,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906424772] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:17,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056601470] [2022-07-13 02:15:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:17,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:17,384 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:17,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 02:15:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 02:15:17,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:17,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:17,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056601470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:17,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:17,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-13 02:15:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187170833] [2022-07-13 02:15:17,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:17,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 02:15:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 02:15:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:17,527 INFO L87 Difference]: Start difference. First operand 180 states and 238 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:15:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:17,697 INFO L93 Difference]: Finished difference Result 450 states and 559 transitions. [2022-07-13 02:15:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 02:15:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-07-13 02:15:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:17,699 INFO L225 Difference]: With dead ends: 450 [2022-07-13 02:15:17,699 INFO L226 Difference]: Without dead ends: 386 [2022-07-13 02:15:17,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-13 02:15:17,699 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 317 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:17,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1618 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-13 02:15:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 194. [2022-07-13 02:15:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 182 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-13 02:15:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 256 transitions. [2022-07-13 02:15:17,707 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 256 transitions. Word has length 38 [2022-07-13 02:15:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:17,707 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 256 transitions. [2022-07-13 02:15:17,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:15:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 256 transitions. [2022-07-13 02:15:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 02:15:17,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:17,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:17,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:17,931 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,SelfDestructingSolverStorable13 [2022-07-13 02:15:17,932 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1651959344, now seen corresponding path program 1 times [2022-07-13 02:15:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:17,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6710304] [2022-07-13 02:15:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:17,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:17,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6710304] [2022-07-13 02:15:17,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6710304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:17,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541922881] [2022-07-13 02:15:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:17,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:17,995 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:17,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 02:15:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 02:15:18,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 02:15:18,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:18,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541922881] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:18,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:18,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-07-13 02:15:18,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117435935] [2022-07-13 02:15:18,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:18,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 02:15:18,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:18,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 02:15:18,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-13 02:15:18,203 INFO L87 Difference]: Start difference. First operand 194 states and 256 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:18,576 INFO L93 Difference]: Finished difference Result 490 states and 640 transitions. [2022-07-13 02:15:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 02:15:18,577 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2022-07-13 02:15:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:18,578 INFO L225 Difference]: With dead ends: 490 [2022-07-13 02:15:18,578 INFO L226 Difference]: Without dead ends: 280 [2022-07-13 02:15:18,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-07-13 02:15:18,579 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 208 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:18,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1128 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:15:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-13 02:15:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 135. [2022-07-13 02:15:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 125 states have internal predecessors, (161), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions. [2022-07-13 02:15:18,586 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 38 [2022-07-13 02:15:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:18,586 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions. [2022-07-13 02:15:18,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2022-07-13 02:15:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 02:15:18,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:18,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:18,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:18,787 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,SelfDestructingSolverStorable14 [2022-07-13 02:15:18,787 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:18,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash -931267937, now seen corresponding path program 2 times [2022-07-13 02:15:18,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:18,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136416900] [2022-07-13 02:15:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:18,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:18,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:18,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136416900] [2022-07-13 02:15:18,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136416900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:18,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86060673] [2022-07-13 02:15:18,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:18,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:18,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:18,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:18,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 02:15:18,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 02:15:18,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:18,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:18,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:18,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:18,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86060673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:18,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:18,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-13 02:15:18,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968822536] [2022-07-13 02:15:18,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:18,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:15:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:18,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:15:18,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:18,966 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:19,000 INFO L93 Difference]: Finished difference Result 260 states and 317 transitions. [2022-07-13 02:15:19,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:19,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-07-13 02:15:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:19,001 INFO L225 Difference]: With dead ends: 260 [2022-07-13 02:15:19,001 INFO L226 Difference]: Without dead ends: 202 [2022-07-13 02:15:19,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:15:19,002 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 67 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:19,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 605 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-13 02:15:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 143. [2022-07-13 02:15:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 132 states have internal predecessors, (170), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 02:15:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2022-07-13 02:15:19,008 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 42 [2022-07-13 02:15:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:19,008 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2022-07-13 02:15:19,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-07-13 02:15:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 02:15:19,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:19,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:19,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:19,226 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,SelfDestructingSolverStorable15 [2022-07-13 02:15:19,226 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1932658151, now seen corresponding path program 1 times [2022-07-13 02:15:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:19,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261438323] [2022-07-13 02:15:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:19,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:19,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261438323] [2022-07-13 02:15:19,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261438323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:19,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199463956] [2022-07-13 02:15:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:19,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:19,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:19,280 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:19,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 02:15:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:15:19,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 02:15:19,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:19,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199463956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:19,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:19,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-07-13 02:15:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514666263] [2022-07-13 02:15:19,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:19,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 02:15:19,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 02:15:19,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:19,447 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:15:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:19,740 INFO L93 Difference]: Finished difference Result 306 states and 390 transitions. [2022-07-13 02:15:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 02:15:19,741 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-07-13 02:15:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:19,742 INFO L225 Difference]: With dead ends: 306 [2022-07-13 02:15:19,742 INFO L226 Difference]: Without dead ends: 244 [2022-07-13 02:15:19,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-07-13 02:15:19,742 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 381 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:19,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 719 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:15:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-13 02:15:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 135. [2022-07-13 02:15:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 125 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 02:15:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2022-07-13 02:15:19,748 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 44 [2022-07-13 02:15:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:19,748 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2022-07-13 02:15:19,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:15:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2022-07-13 02:15:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 02:15:19,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:19,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:19,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:19,959 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,SelfDestructingSolverStorable16 [2022-07-13 02:15:19,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1236341633, now seen corresponding path program 1 times [2022-07-13 02:15:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:19,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032942252] [2022-07-13 02:15:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:19,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032942252] [2022-07-13 02:15:20,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032942252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050619412] [2022-07-13 02:15:20,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:20,076 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:20,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 02:15:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 02:15:20,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:20,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:20,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050619412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:20,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:20,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2022-07-13 02:15:20,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426551737] [2022-07-13 02:15:20,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 02:15:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 02:15:20,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-13 02:15:20,355 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:15:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:20,538 INFO L93 Difference]: Finished difference Result 283 states and 347 transitions. [2022-07-13 02:15:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:15:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-07-13 02:15:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:20,539 INFO L225 Difference]: With dead ends: 283 [2022-07-13 02:15:20,540 INFO L226 Difference]: Without dead ends: 227 [2022-07-13 02:15:20,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:15:20,540 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 248 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:20,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1039 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-13 02:15:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-07-13 02:15:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 144 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-13 02:15:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2022-07-13 02:15:20,546 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 46 [2022-07-13 02:15:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:20,546 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2022-07-13 02:15:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:15:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-07-13 02:15:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 02:15:20,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,547 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 02:15:20,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 02:15:20,762 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1527027040, now seen corresponding path program 1 times [2022-07-13 02:15:20,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:20,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711242352] [2022-07-13 02:15:20,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 02:15:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:20,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:20,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711242352] [2022-07-13 02:15:20,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711242352] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:20,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959354616] [2022-07-13 02:15:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:20,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:20,801 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-13 02:15:20,803 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-13 02:15:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 02:15:20,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:20,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:20,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959354616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:20,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:20,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-07-13 02:15:20,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643106687] [2022-07-13 02:15:20,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:15:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:15:20,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:20,854 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:20,879 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2022-07-13 02:15:20,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:15:20,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-07-13 02:15:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:20,883 INFO L225 Difference]: With dead ends: 296 [2022-07-13 02:15:20,887 INFO L226 Difference]: Without dead ends: 180 [2022-07-13 02:15:20,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:20,888 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:20,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 220 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-13 02:15:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2022-07-13 02:15:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 154 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-13 02:15:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 203 transitions. [2022-07-13 02:15:20,900 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 203 transitions. Word has length 52 [2022-07-13 02:15:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:20,901 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 203 transitions. [2022-07-13 02:15:20,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 203 transitions. [2022-07-13 02:15:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 02:15:20,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,903 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-13 02:15:21,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,124 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -782219223, now seen corresponding path program 1 times [2022-07-13 02:15:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296700394] [2022-07-13 02:15:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:21,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296700394] [2022-07-13 02:15:21,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296700394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:21,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418412090] [2022-07-13 02:15:21,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:21,194 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-13 02:15:21,195 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-13 02:15:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 02:15:21,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:21,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:21,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418412090] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:21,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:21,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-07-13 02:15:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446881260] [2022-07-13 02:15:21,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:15:21,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:15:21,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:15:21,374 INFO L87 Difference]: Start difference. First operand 166 states and 203 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,610 INFO L93 Difference]: Finished difference Result 419 states and 503 transitions. [2022-07-13 02:15:21,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 02:15:21,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-07-13 02:15:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,612 INFO L225 Difference]: With dead ends: 419 [2022-07-13 02:15:21,612 INFO L226 Difference]: Without dead ends: 368 [2022-07-13 02:15:21,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:21,612 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 243 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1656 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-13 02:15:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 186. [2022-07-13 02:15:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.294478527607362) internal successors, (211), 172 states have internal predecessors, (211), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 02:15:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2022-07-13 02:15:21,622 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 53 [2022-07-13 02:15:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,622 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2022-07-13 02:15:21,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-07-13 02:15:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 02:15:21,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,623 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:21,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,839 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash -782217301, now seen corresponding path program 1 times [2022-07-13 02:15:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071623824] [2022-07-13 02:15:21,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:21,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071623824] [2022-07-13 02:15:21,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071623824] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:21,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426836599] [2022-07-13 02:15:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:21,892 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-13 02:15:21,893 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-13 02:15:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 02:15:21,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:22,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:22,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426836599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:22,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:22,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-07-13 02:15:22,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149629648] [2022-07-13 02:15:22,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 02:15:22,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 02:15:22,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-13 02:15:22,159 INFO L87 Difference]: Start difference. First operand 186 states and 227 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,658 INFO L93 Difference]: Finished difference Result 544 states and 674 transitions. [2022-07-13 02:15:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 02:15:22,659 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-07-13 02:15:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,660 INFO L225 Difference]: With dead ends: 544 [2022-07-13 02:15:22,660 INFO L226 Difference]: Without dead ends: 488 [2022-07-13 02:15:22,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 02:15:22,662 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 556 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:22,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 998 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 02:15:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-07-13 02:15:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 201. [2022-07-13 02:15:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 185 states have internal predecessors, (226), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-13 02:15:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 245 transitions. [2022-07-13 02:15:22,693 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 245 transitions. Word has length 53 [2022-07-13 02:15:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,693 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 245 transitions. [2022-07-13 02:15:22,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 245 transitions. [2022-07-13 02:15:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 02:15:22,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,694 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:22,710 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-13 02:15:22,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,900 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash 27127403, now seen corresponding path program 1 times [2022-07-13 02:15:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590101869] [2022-07-13 02:15:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590101869] [2022-07-13 02:15:22,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590101869] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105996334] [2022-07-13 02:15:22,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,987 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-13 02:15:23,003 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-13 02:15:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:15:23,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:23,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:23,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105996334] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:23,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:23,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 20 [2022-07-13 02:15:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737951365] [2022-07-13 02:15:23,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:23,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 02:15:23,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 02:15:23,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:15:23,282 INFO L87 Difference]: Start difference. First operand 201 states and 245 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:23,919 INFO L93 Difference]: Finished difference Result 436 states and 549 transitions. [2022-07-13 02:15:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 02:15:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-07-13 02:15:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:23,921 INFO L225 Difference]: With dead ends: 436 [2022-07-13 02:15:23,921 INFO L226 Difference]: Without dead ends: 346 [2022-07-13 02:15:23,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 02:15:23,922 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 168 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:23,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1954 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:15:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-13 02:15:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 186. [2022-07-13 02:15:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 172 states have internal predecessors, (210), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 02:15:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 226 transitions. [2022-07-13 02:15:23,931 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 226 transitions. Word has length 53 [2022-07-13 02:15:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:23,931 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 226 transitions. [2022-07-13 02:15:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2022-07-13 02:15:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 02:15:23,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:23,932 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:23,962 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-13 02:15:24,148 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,SelfDestructingSolverStorable21 [2022-07-13 02:15:24,148 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:24,149 INFO L85 PathProgramCache]: Analyzing trace with hash 513325306, now seen corresponding path program 1 times [2022-07-13 02:15:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:24,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728509715] [2022-07-13 02:15:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 02:15:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728509715] [2022-07-13 02:15:24,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728509715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936067389] [2022-07-13 02:15:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:24,195 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-13 02:15:24,229 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-13 02:15:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:24,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:24,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:24,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936067389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:24,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:24,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-13 02:15:24,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34736340] [2022-07-13 02:15:24,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:24,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:24,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:24,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:24,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:24,274 INFO L87 Difference]: Start difference. First operand 186 states and 226 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:24,330 INFO L93 Difference]: Finished difference Result 411 states and 521 transitions. [2022-07-13 02:15:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:24,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-07-13 02:15:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:24,331 INFO L225 Difference]: With dead ends: 411 [2022-07-13 02:15:24,331 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 02:15:24,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:24,332 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 50 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:24,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 233 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 02:15:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 212. [2022-07-13 02:15:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 198 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 02:15:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 258 transitions. [2022-07-13 02:15:24,340 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 258 transitions. Word has length 53 [2022-07-13 02:15:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:24,340 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 258 transitions. [2022-07-13 02:15:24,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 258 transitions. [2022-07-13 02:15:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 02:15:24,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:24,341 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:24,360 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-13 02:15:24,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,558 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -814993957, now seen corresponding path program 1 times [2022-07-13 02:15:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:24,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628899970] [2022-07-13 02:15:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 02:15:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:24,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628899970] [2022-07-13 02:15:24,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628899970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:24,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46001523] [2022-07-13 02:15:24,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:24,595 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-13 02:15:24,601 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-13 02:15:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 02:15:24,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:24,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:24,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46001523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:24,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:24,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-13 02:15:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652314108] [2022-07-13 02:15:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:24,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:24,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:24,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:24,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:24,688 INFO L87 Difference]: Start difference. First operand 212 states and 258 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:24,743 INFO L93 Difference]: Finished difference Result 385 states and 475 transitions. [2022-07-13 02:15:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:15:24,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-07-13 02:15:24,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:24,749 INFO L225 Difference]: With dead ends: 385 [2022-07-13 02:15:24,749 INFO L226 Difference]: Without dead ends: 237 [2022-07-13 02:15:24,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:24,749 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 18 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:24,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 334 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-13 02:15:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 208. [2022-07-13 02:15:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 194 states have internal predecessors, (239), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 02:15:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 255 transitions. [2022-07-13 02:15:24,762 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 255 transitions. Word has length 54 [2022-07-13 02:15:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:24,762 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 255 transitions. [2022-07-13 02:15:24,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 255 transitions. [2022-07-13 02:15:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 02:15:24,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:24,766 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:24,784 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-13 02:15:24,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,982 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1003371972, now seen corresponding path program 1 times [2022-07-13 02:15:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:24,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748461745] [2022-07-13 02:15:24,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:25,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748461745] [2022-07-13 02:15:25,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748461745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:25,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:25,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 02:15:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755526436] [2022-07-13 02:15:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 02:15:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 02:15:25,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:25,137 INFO L87 Difference]: Start difference. First operand 208 states and 255 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,389 INFO L93 Difference]: Finished difference Result 390 states and 472 transitions. [2022-07-13 02:15:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:15:25,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-07-13 02:15:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,391 INFO L225 Difference]: With dead ends: 390 [2022-07-13 02:15:25,391 INFO L226 Difference]: Without dead ends: 389 [2022-07-13 02:15:25,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-13 02:15:25,391 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 314 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:25,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1037 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:15:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-13 02:15:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 234. [2022-07-13 02:15:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 218 states have internal predecessors, (271), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 11 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-13 02:15:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2022-07-13 02:15:25,402 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 55 [2022-07-13 02:15:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,402 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2022-07-13 02:15:25,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2022-07-13 02:15:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 02:15:25,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,403 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:25,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 02:15:25,403 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1812718598, now seen corresponding path program 1 times [2022-07-13 02:15:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422361988] [2022-07-13 02:15:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:25,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422361988] [2022-07-13 02:15:25,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422361988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:25,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:25,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 02:15:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911869414] [2022-07-13 02:15:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:15:25,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:15:25,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:15:25,494 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,659 INFO L93 Difference]: Finished difference Result 429 states and 519 transitions. [2022-07-13 02:15:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:15:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-07-13 02:15:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,660 INFO L225 Difference]: With dead ends: 429 [2022-07-13 02:15:25,660 INFO L226 Difference]: Without dead ends: 378 [2022-07-13 02:15:25,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:25,661 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 299 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:25,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1123 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-07-13 02:15:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 258. [2022-07-13 02:15:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 241 states have internal predecessors, (298), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-13 02:15:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 317 transitions. [2022-07-13 02:15:25,672 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 317 transitions. Word has length 55 [2022-07-13 02:15:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,672 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 317 transitions. [2022-07-13 02:15:25,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 317 transitions. [2022-07-13 02:15:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 02:15:25,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,673 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-13 02:15:25,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 02:15:25,673 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:25,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1309999454, now seen corresponding path program 1 times [2022-07-13 02:15:25,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591590024] [2022-07-13 02:15:25,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 02:15:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591590024] [2022-07-13 02:15:25,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591590024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:25,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431488440] [2022-07-13 02:15:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:25,776 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-13 02:15:25,804 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-13 02:15:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 02:15:25,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 02:15:25,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 02:15:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431488440] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:26,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 02:15:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 21 [2022-07-13 02:15:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819300180] [2022-07-13 02:15:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:26,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:15:26,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:26,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:15:26,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-07-13 02:15:26,089 INFO L87 Difference]: Start difference. First operand 258 states and 317 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:26,202 INFO L93 Difference]: Finished difference Result 402 states and 484 transitions. [2022-07-13 02:15:26,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:15:26,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-07-13 02:15:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:26,203 INFO L225 Difference]: With dead ends: 402 [2022-07-13 02:15:26,203 INFO L226 Difference]: Without dead ends: 291 [2022-07-13 02:15:26,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-07-13 02:15:26,204 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 42 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:26,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1081 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-13 02:15:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2022-07-13 02:15:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 228 states have (on average 1.2719298245614035) internal successors, (290), 235 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-13 02:15:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 309 transitions. [2022-07-13 02:15:26,218 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 309 transitions. Word has length 62 [2022-07-13 02:15:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:26,218 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 309 transitions. [2022-07-13 02:15:26,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 309 transitions. [2022-07-13 02:15:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 02:15:26,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:26,220 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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] [2022-07-13 02:15:26,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:26,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:26,437 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash 158610151, now seen corresponding path program 1 times [2022-07-13 02:15:26,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:26,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777624534] [2022-07-13 02:15:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:26,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:15:26,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 02:15:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:15:26,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 02:15:26,496 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 02:15:26,497 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2022-07-13 02:15:26,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2022-07-13 02:15:26,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2022-07-13 02:15:26,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2022-07-13 02:15:26,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2022-07-13 02:15:26,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2022-07-13 02:15:26,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2022-07-13 02:15:26,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2022-07-13 02:15:26,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2022-07-13 02:15:26,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2022-07-13 02:15:26,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2022-07-13 02:15:26,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2022-07-13 02:15:26,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2022-07-13 02:15:26,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2022-07-13 02:15:26,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2022-07-13 02:15:26,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2022-07-13 02:15:26,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2022-07-13 02:15:26,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2022-07-13 02:15:26,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2022-07-13 02:15:26,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2022-07-13 02:15:26,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 02:15:26,503 INFO L356 BasicCegarLoop]: Path program histogram: [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] [2022-07-13 02:15:26,505 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 02:15:26,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:15:26 BoogieIcfgContainer [2022-07-13 02:15:26,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 02:15:26,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 02:15:26,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 02:15:26,556 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 02:15:26,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:12" (3/4) ... [2022-07-13 02:15:26,558 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 02:15:26,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 02:15:26,559 INFO L158 Benchmark]: Toolchain (without parser) took 14721.08ms. Allocated memory was 77.6MB in the beginning and 232.8MB in the end (delta: 155.2MB). Free memory was 46.4MB in the beginning and 137.5MB in the end (delta: -91.1MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2022-07-13 02:15:26,559 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 47.4MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:15:26,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.65ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 46.2MB in the beginning and 67.0MB in the end (delta: -20.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-07-13 02:15:26,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.03ms. Allocated memory is still 94.4MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:15:26,560 INFO L158 Benchmark]: Boogie Preprocessor took 53.01ms. Allocated memory is still 94.4MB. Free memory was 64.7MB in the beginning and 63.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:15:26,562 INFO L158 Benchmark]: RCFGBuilder took 629.54ms. Allocated memory is still 94.4MB. Free memory was 62.7MB in the beginning and 63.5MB in the end (delta: -775.2kB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-07-13 02:15:26,562 INFO L158 Benchmark]: TraceAbstraction took 13588.41ms. Allocated memory was 94.4MB in the beginning and 232.8MB in the end (delta: 138.4MB). Free memory was 63.1MB in the beginning and 137.5MB in the end (delta: -74.4MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2022-07-13 02:15:26,564 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 232.8MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:15:26,567 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.09ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 47.4MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.65ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 46.2MB in the beginning and 67.0MB in the end (delta: -20.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.03ms. Allocated memory is still 94.4MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.01ms. Allocated memory is still 94.4MB. Free memory was 64.7MB in the beginning and 63.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.54ms. Allocated memory is still 94.4MB. Free memory was 62.7MB in the beginning and 63.5MB in the end (delta: -775.2kB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13588.41ms. Allocated memory was 94.4MB in the beginning and 232.8MB in the end (delta: 138.4MB). Free memory was 63.1MB in the beginning and 137.5MB in the end (delta: -74.4MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 232.8MB. Free memory is still 137.5MB. 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: 110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 77. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=-126, eb=-1] [L252] 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] [L26] unsigned int res ; [L27] 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] [L30] COND TRUE ! m [L31] __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] [L81] 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] [L252] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L252] zero = base2flt(0, 0) [L253] 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))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L30] COND FALSE !(! m) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L36] 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))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L58] COND TRUE 1 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L60] 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))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L77] 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))=36028799166447617, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L78] EXPR e + 128 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=36028799166447617, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L78] EXPR e + 128 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=36028799166447617, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=36028799166447617] [L78] 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))=36028799166447617, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L79] __retres4 = res VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=36028799166447617, __retres4=2147483647, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L81] return (__retres4); VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=36028799166447617, \result=36028799166447615, __retres4=2147483647, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L253] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=36028799166447615, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, res = m | ((unsigned int ) (e + 128) << 24U)=33554432, zero=0] [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-1, \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] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L58] COND TRUE 1 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L78] EXPR e + 128 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L78] EXPR e + 128 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=33554432] [L78] res = m | ((unsigned int ) (e + 128) << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432] [L79] __retres4 = res VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, __retres4=2147483647, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432] [L81] return (__retres4); VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int ) (e + 128) << 24U))=33554432, \result=2147483647, __retres4=2147483647, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432] [L254] RET, EXPR base2flt(mb, eb) VAL [a=2147483647, base2flt(mb, eb)=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432, tmp=1, zero=0] [L264] sa = tmp VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432, sa=1, tmp=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432, sa=1, tmp=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432, sa=1, tmp=1, tmp___0=1, zero=0] [L274] sb = tmp___0 VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432] [L95] COND FALSE !(a < b) VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432] [L102] COND FALSE !(! b) VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432] [L109] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432] [L110] (int )(a >> 24U) - 128 VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int ) (e + 128) << 24U)=2130706432] - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: 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, 142 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4394 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4332 mSDsluCounter, 18636 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15104 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4664 IncrementalHoareTripleChecker+Invalid, 5071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 3532 mSDtfsCounter, 4664 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1522 GetRequests, 1207 SyntacticMatches, 11 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=26, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 2022 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1725 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2046 ConstructedInterpolants, 0 QuantifiedInterpolants, 5555 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2433 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 55 InterpolantComputations, 20 PerfectInterpolantSequences, 594/743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 02:15:26,590 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