./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-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_4-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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 02:15:27,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:15:27,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:15:27,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:15:27,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:15:27,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:15:27,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:15:27,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:15:27,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:15:27,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:15:27,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:15:27,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:15:27,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:15:27,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:15:27,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:15:27,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:15:27,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:15:27,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:15:27,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:15:27,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:15:27,111 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:15:27,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:15:27,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:15:27,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:15:27,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:15:27,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:15:27,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:15:27,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:15:27,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:15:27,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:15:27,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:15:27,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:15:27,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:15:27,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:15:27,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:15:27,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:15:27,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:15:27,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:15:27,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:15:27,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:15:27,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:15:27,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:15:27,126 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:27,150 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:15:27,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:15:27,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:15:27,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:15:27,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:15:27,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:15:27,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:15:27,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:15:27,152 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:15:27,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:15:27,153 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:15:27,153 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:15:27,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:15:27,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:15:27,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:15:27,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:15:27,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:15:27,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:15:27,154 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:15:27,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:15:27,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:15:27,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:15:27,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:15:27,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:15:27,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:15:27,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:15:27,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:27,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:15:27,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:15:27,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:15:27,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:15:27,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:15:27,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:15:27,156 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2022-07-13 02:15:27,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:15:27,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:15:27,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:15:27,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:15:27,388 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:15:27,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-07-13 02:15:27,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c3c92ca/ce5bb7f6ce394bdfb650993f42ab6ed5/FLAGf734d2a43 [2022-07-13 02:15:27,799 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:15:27,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-07-13 02:15:27,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c3c92ca/ce5bb7f6ce394bdfb650993f42ab6ed5/FLAGf734d2a43 [2022-07-13 02:15:27,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c3c92ca/ce5bb7f6ce394bdfb650993f42ab6ed5 [2022-07-13 02:15:27,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:15:27,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:15:27,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:27,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:15:27,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:15:27,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:27" (1/1) ... [2022-07-13 02:15:27,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fd8acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:27, skipping insertion in model container [2022-07-13 02:15:27,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:27" (1/1) ... [2022-07-13 02:15:27,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:15:27,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:15:27,957 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_4-2a.c.cil.c[755,768] [2022-07-13 02:15:27,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:28,008 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:15:28,017 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_4-2a.c.cil.c[755,768] [2022-07-13 02:15:28,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:28,057 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:15:28,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:28 WrapperNode [2022-07-13 02:15:28,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:28,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:28,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:15:28,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:15:28,072 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:28" (1/1) ... [2022-07-13 02:15:28,078 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:28" (1/1) ... [2022-07-13 02:15:28,102 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-13 02:15:28,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:28,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:15:28,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:15:28,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:15:28,109 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:28" (1/1) ... [2022-07-13 02:15:28,110 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:28" (1/1) ... [2022-07-13 02:15:28,112 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:28" (1/1) ... [2022-07-13 02:15:28,112 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:28" (1/1) ... [2022-07-13 02:15:28,117 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:28" (1/1) ... [2022-07-13 02:15:28,121 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:28" (1/1) ... [2022-07-13 02:15:28,122 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:28" (1/1) ... [2022-07-13 02:15:28,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:15:28,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:15:28,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:15:28,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:15:28,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:28" (1/1) ... [2022-07-13 02:15:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:28,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:28,156 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:28,163 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:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:15:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 02:15:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 02:15:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 02:15:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:15:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:15:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-13 02:15:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-13 02:15:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 02:15:28,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 02:15:28,235 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:15:28,236 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:15:28,544 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:15:28,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:15:28,549 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 02:15:28,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:28 BoogieIcfgContainer [2022-07-13 02:15:28,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:15:28,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:15:28,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:15:28,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:15:28,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:15:27" (1/3) ... [2022-07-13 02:15:28,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7651db4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:28, skipping insertion in model container [2022-07-13 02:15:28,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:28" (2/3) ... [2022-07-13 02:15:28,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7651db4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:28, skipping insertion in model container [2022-07-13 02:15:28,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:28" (3/3) ... [2022-07-13 02:15:28,569 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2022-07-13 02:15:28,581 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:15:28,581 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-13 02:15:28,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:15:28,625 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@24b97c4e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a4933cc [2022-07-13 02:15:28,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-13 02:15:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 112 states have internal predecessors, (163), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 02:15:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:28,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:28,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:28,635 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:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash -475863887, now seen corresponding path program 1 times [2022-07-13 02:15:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:28,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499063413] [2022-07-13 02:15:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,746 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:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:28,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499063413] [2022-07-13 02:15:28,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499063413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:28,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:28,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:15:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879113022] [2022-07-13 02:15:28,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:28,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 02:15:28,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:28,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 02:15:28,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:28,772 INFO L87 Difference]: Start difference. First operand has 124 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 112 states have internal predecessors, (163), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 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:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:28,800 INFO L93 Difference]: Finished difference Result 243 states and 362 transitions. [2022-07-13 02:15:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 02:15:28,804 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:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:28,816 INFO L225 Difference]: With dead ends: 243 [2022-07-13 02:15:28,817 INFO L226 Difference]: Without dead ends: 112 [2022-07-13 02:15:28,823 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:28,827 INFO L413 NwaCegarLoop]: 158 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, 158 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:28,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 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:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-13 02:15:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-13 02:15:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 102 states have internal predecessors, (132), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2022-07-13 02:15:28,883 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 145 transitions. Word has length 9 [2022-07-13 02:15:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:28,883 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 145 transitions. [2022-07-13 02:15:28,884 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:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2022-07-13 02:15:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:28,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:28,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:28,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:15:28,886 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:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash -476805235, now seen corresponding path program 1 times [2022-07-13 02:15:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:28,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059805192] [2022-07-13 02:15:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,964 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:28,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:28,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059805192] [2022-07-13 02:15:28,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059805192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:28,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:28,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:28,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961055975] [2022-07-13 02:15:28,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:28,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:28,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:28,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:28,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:28,967 INFO L87 Difference]: Start difference. First operand 112 states and 145 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:29,078 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2022-07-13 02:15:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:29,078 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:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:29,082 INFO L225 Difference]: With dead ends: 283 [2022-07-13 02:15:29,082 INFO L226 Difference]: Without dead ends: 174 [2022-07-13 02:15:29,082 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:29,083 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 106 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 385 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:29,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 385 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:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-13 02:15:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2022-07-13 02:15:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 132 states have (on average 1.5681818181818181) internal successors, (207), 150 states have internal predecessors, (207), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2022-07-13 02:15:29,097 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 9 [2022-07-13 02:15:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:29,097 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2022-07-13 02:15:29,097 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:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2022-07-13 02:15:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 02:15:29,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:29,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:29,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:15:29,099 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:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1876350822, now seen corresponding path program 1 times [2022-07-13 02:15:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:29,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780122828] [2022-07-13 02:15:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,128 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:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780122828] [2022-07-13 02:15:29,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780122828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:29,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:29,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348045193] [2022-07-13 02:15:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:29,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:29,131 INFO L87 Difference]: Start difference. First operand 161 states and 220 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:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:29,243 INFO L93 Difference]: Finished difference Result 196 states and 259 transitions. [2022-07-13 02:15:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:29,243 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:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:29,246 INFO L225 Difference]: With dead ends: 196 [2022-07-13 02:15:29,246 INFO L226 Difference]: Without dead ends: 193 [2022-07-13 02:15:29,247 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:29,252 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 161 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 515 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:29,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 515 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:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-13 02:15:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2022-07-13 02:15:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 139 states have (on average 1.5683453237410072) internal successors, (218), 157 states have internal predecessors, (218), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 231 transitions. [2022-07-13 02:15:29,266 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 231 transitions. Word has length 13 [2022-07-13 02:15:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:29,266 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 231 transitions. [2022-07-13 02:15:29,267 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:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 231 transitions. [2022-07-13 02:15:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 02:15:29,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:29,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:29,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 02:15:29,268 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:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1962666541, now seen corresponding path program 1 times [2022-07-13 02:15:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:29,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108611526] [2022-07-13 02:15:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,305 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:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:29,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108611526] [2022-07-13 02:15:29,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108611526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:29,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:29,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132579362] [2022-07-13 02:15:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:29,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:29,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:29,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:29,308 INFO L87 Difference]: Start difference. First operand 168 states and 231 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:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:29,437 INFO L93 Difference]: Finished difference Result 316 states and 420 transitions. [2022-07-13 02:15:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:29,439 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:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:29,440 INFO L225 Difference]: With dead ends: 316 [2022-07-13 02:15:29,440 INFO L226 Difference]: Without dead ends: 203 [2022-07-13 02:15:29,441 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:29,442 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 165 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:29,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 525 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-13 02:15:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 172. [2022-07-13 02:15:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 161 states have internal predecessors, (221), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 234 transitions. [2022-07-13 02:15:29,457 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 234 transitions. Word has length 14 [2022-07-13 02:15:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:29,457 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 234 transitions. [2022-07-13 02:15:29,457 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:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2022-07-13 02:15:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:15:29,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:29,458 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:29,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 02:15:29,458 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:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2026818261, now seen corresponding path program 1 times [2022-07-13 02:15:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:29,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18353576] [2022-07-13 02:15:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,524 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:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:29,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18353576] [2022-07-13 02:15:29,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18353576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:29,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331522694] [2022-07-13 02:15:29,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:29,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:29,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:29,544 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:29,549 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:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:29,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:29,639 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:29,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:29,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331522694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:29,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:29,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898567246] [2022-07-13 02:15:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:29,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:29,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:29,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:29,641 INFO L87 Difference]: Start difference. First operand 172 states and 234 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:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:29,730 INFO L93 Difference]: Finished difference Result 242 states and 331 transitions. [2022-07-13 02:15:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:29,731 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:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:29,732 INFO L225 Difference]: With dead ends: 242 [2022-07-13 02:15:29,732 INFO L226 Difference]: Without dead ends: 238 [2022-07-13 02:15:29,732 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:29,733 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 481 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:29,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 481 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:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-13 02:15:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 208. [2022-07-13 02:15:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 196 states have internal predecessors, (281), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 294 transitions. [2022-07-13 02:15:29,742 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 294 transitions. Word has length 16 [2022-07-13 02:15:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:29,743 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 294 transitions. [2022-07-13 02:15:29,743 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:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 294 transitions. [2022-07-13 02:15:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 02:15:29,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:29,744 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:29,763 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:29,963 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:29,963 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:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1963115407, now seen corresponding path program 1 times [2022-07-13 02:15:29,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616809488] [2022-07-13 02:15:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:29,990 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:29,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:29,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616809488] [2022-07-13 02:15:29,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616809488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:29,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58568352] [2022-07-13 02:15:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:29,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:29,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:29,992 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:29,994 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:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:30,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:15:30,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:30,044 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:30,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:30,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58568352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:30,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:30,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 02:15:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25109434] [2022-07-13 02:15:30,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:30,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:30,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:30,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:30,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:30,046 INFO L87 Difference]: Start difference. First operand 208 states and 294 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:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:30,088 INFO L93 Difference]: Finished difference Result 260 states and 365 transitions. [2022-07-13 02:15:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:30,088 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:30,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:30,090 INFO L225 Difference]: With dead ends: 260 [2022-07-13 02:15:30,090 INFO L226 Difference]: Without dead ends: 258 [2022-07-13 02:15:30,090 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:30,091 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 28 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:30,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 294 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-13 02:15:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 201. [2022-07-13 02:15:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 172 states have (on average 1.5465116279069768) internal successors, (266), 189 states have internal predecessors, (266), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 279 transitions. [2022-07-13 02:15:30,099 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 279 transitions. Word has length 15 [2022-07-13 02:15:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:30,099 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 279 transitions. [2022-07-13 02:15:30,100 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:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 279 transitions. [2022-07-13 02:15:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 02:15:30,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:30,100 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:30,121 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:30,321 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:30,321 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:30,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1593143292, now seen corresponding path program 1 times [2022-07-13 02:15:30,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:30,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50410801] [2022-07-13 02:15:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:30,352 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:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:30,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50410801] [2022-07-13 02:15:30,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50410801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:30,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255665355] [2022-07-13 02:15:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:30,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:30,355 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:30,356 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:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:30,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 02:15:30,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:30,395 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:30,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:30,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255665355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:30,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:30,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-13 02:15:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895874014] [2022-07-13 02:15:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:30,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:15:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:15:30,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:30,397 INFO L87 Difference]: Start difference. First operand 201 states and 279 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:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:30,432 INFO L93 Difference]: Finished difference Result 210 states and 288 transitions. [2022-07-13 02:15:30,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:15:30,433 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:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:30,434 INFO L225 Difference]: With dead ends: 210 [2022-07-13 02:15:30,434 INFO L226 Difference]: Without dead ends: 209 [2022-07-13 02:15:30,434 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:30,435 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 264 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:30,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 264 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:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-13 02:15:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2022-07-13 02:15:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.535294117647059) internal successors, (261), 186 states have internal predecessors, (261), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 274 transitions. [2022-07-13 02:15:30,442 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 274 transitions. Word has length 17 [2022-07-13 02:15:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:30,442 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 274 transitions. [2022-07-13 02:15:30,442 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:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 274 transitions. [2022-07-13 02:15:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:15:30,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:30,451 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:30,477 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:30,670 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:30,672 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:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:30,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1255353667, now seen corresponding path program 1 times [2022-07-13 02:15:30,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:30,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553246329] [2022-07-13 02:15:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:30,715 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:30,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:30,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553246329] [2022-07-13 02:15:30,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553246329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:30,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154763983] [2022-07-13 02:15:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:30,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:30,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:30,721 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:30,747 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:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:30,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:30,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:30,778 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:30,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:30,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154763983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:30,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:30,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097555424] [2022-07-13 02:15:30,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:30,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:30,780 INFO L87 Difference]: Start difference. First operand 198 states and 274 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:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:30,852 INFO L93 Difference]: Finished difference Result 241 states and 328 transitions. [2022-07-13 02:15:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:30,853 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:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:30,854 INFO L225 Difference]: With dead ends: 241 [2022-07-13 02:15:30,854 INFO L226 Difference]: Without dead ends: 238 [2022-07-13 02:15:30,854 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:30,855 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 107 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 482 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:30,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 482 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:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-13 02:15:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2022-07-13 02:15:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 194 states have internal predecessors, (272), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 285 transitions. [2022-07-13 02:15:30,862 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 285 transitions. Word has length 18 [2022-07-13 02:15:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:30,863 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 285 transitions. [2022-07-13 02:15:30,863 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:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 285 transitions. [2022-07-13 02:15:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:15:30,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:30,864 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:30,891 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:31,079 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:31,079 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:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1571854273, now seen corresponding path program 1 times [2022-07-13 02:15:31,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:31,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663174652] [2022-07-13 02:15:31,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:31,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,098 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:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:31,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663174652] [2022-07-13 02:15:31,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663174652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:31,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:31,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130544291] [2022-07-13 02:15:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:31,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:31,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:31,100 INFO L87 Difference]: Start difference. First operand 206 states and 285 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:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:31,149 INFO L93 Difference]: Finished difference Result 261 states and 361 transitions. [2022-07-13 02:15:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:31,150 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:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:31,151 INFO L225 Difference]: With dead ends: 261 [2022-07-13 02:15:31,151 INFO L226 Difference]: Without dead ends: 259 [2022-07-13 02:15:31,151 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:31,152 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 24 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 401 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:31,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 401 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:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-13 02:15:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2022-07-13 02:15:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 194 states have internal predecessors, (270), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2022-07-13 02:15:31,158 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 19 [2022-07-13 02:15:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:31,159 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2022-07-13 02:15:31,159 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:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2022-07-13 02:15:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 02:15:31,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:31,160 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:31,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 02:15:31,160 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:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash -159419185, now seen corresponding path program 1 times [2022-07-13 02:15:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:31,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074290598] [2022-07-13 02:15:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:31,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,207 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:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:31,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074290598] [2022-07-13 02:15:31,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074290598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281811618] [2022-07-13 02:15:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:31,228 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:31,229 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:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:31,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:31,288 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:31,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:31,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281811618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:31,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:31,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532696937] [2022-07-13 02:15:31,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:31,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:31,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:31,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:31,290 INFO L87 Difference]: Start difference. First operand 206 states and 283 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:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:31,376 INFO L93 Difference]: Finished difference Result 236 states and 324 transitions. [2022-07-13 02:15:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:31,376 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:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:31,377 INFO L225 Difference]: With dead ends: 236 [2022-07-13 02:15:31,377 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 02:15:31,377 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:31,378 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 112 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 479 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:31,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 479 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 02:15:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2022-07-13 02:15:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 169 states have (on average 1.4792899408284024) internal successors, (250), 182 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2022-07-13 02:15:31,385 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 23 [2022-07-13 02:15:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:31,386 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2022-07-13 02:15:31,386 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:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2022-07-13 02:15:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 02:15:31,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:31,387 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:31,416 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:31,596 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:31,597 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:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:31,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1990531529, now seen corresponding path program 1 times [2022-07-13 02:15:31,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:31,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840458275] [2022-07-13 02:15:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,645 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:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840458275] [2022-07-13 02:15:31,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840458275] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296922626] [2022-07-13 02:15:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:31,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:31,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:31,647 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:31,648 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:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:31,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:31,715 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:31,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:31,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296922626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:31,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:31,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136434710] [2022-07-13 02:15:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:31,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:31,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:31,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:31,719 INFO L87 Difference]: Start difference. First operand 194 states and 263 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:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:31,775 INFO L93 Difference]: Finished difference Result 224 states and 303 transitions. [2022-07-13 02:15:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:31,776 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:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:31,777 INFO L225 Difference]: With dead ends: 224 [2022-07-13 02:15:31,777 INFO L226 Difference]: Without dead ends: 221 [2022-07-13 02:15:31,777 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:31,778 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 96 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 485 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:31,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 485 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:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-13 02:15:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 183. [2022-07-13 02:15:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 161 states have (on average 1.4596273291925466) internal successors, (235), 171 states have internal predecessors, (235), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 02:15:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 248 transitions. [2022-07-13 02:15:31,786 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 248 transitions. Word has length 25 [2022-07-13 02:15:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:31,786 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 248 transitions. [2022-07-13 02:15:31,786 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:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 248 transitions. [2022-07-13 02:15:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 02:15:31,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:31,787 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] [2022-07-13 02:15:31,806 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:32,001 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:32,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash 962021647, now seen corresponding path program 1 times [2022-07-13 02:15:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:32,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191543765] [2022-07-13 02:15:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:32,103 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:32,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:32,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191543765] [2022-07-13 02:15:32,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191543765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:32,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557750787] [2022-07-13 02:15:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:32,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:32,120 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:32,121 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:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:32,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 02:15:32,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:32,217 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:32,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:32,337 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:32,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557750787] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:32,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:32,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 19 [2022-07-13 02:15:32,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580722313] [2022-07-13 02:15:32,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:32,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:15:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:15:32,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:32,339 INFO L87 Difference]: Start difference. First operand 183 states and 248 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:33,394 INFO L93 Difference]: Finished difference Result 601 states and 801 transitions. [2022-07-13 02:15:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 02:15:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-07-13 02:15:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:33,396 INFO L225 Difference]: With dead ends: 601 [2022-07-13 02:15:33,397 INFO L226 Difference]: Without dead ends: 423 [2022-07-13 02:15:33,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 02:15:33,398 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 638 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:33,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 636 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 02:15:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-13 02:15:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 155. [2022-07-13 02:15:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 129 states have (on average 1.426356589147287) internal successors, (184), 140 states have internal predecessors, (184), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-13 02:15:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 202 transitions. [2022-07-13 02:15:33,408 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 202 transitions. Word has length 30 [2022-07-13 02:15:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:33,408 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 202 transitions. [2022-07-13 02:15:33,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2022-07-13 02:15:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 02:15:33,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:33,409 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] [2022-07-13 02:15:33,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 02:15:33,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:33,626 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:33,627 INFO L85 PathProgramCache]: Analyzing trace with hash 217587920, now seen corresponding path program 1 times [2022-07-13 02:15:33,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:33,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685259414] [2022-07-13 02:15:33,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,698 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:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:33,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685259414] [2022-07-13 02:15:33,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685259414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:33,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:33,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 02:15:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427950039] [2022-07-13 02:15:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:33,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:15:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:15:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:15:33,700 INFO L87 Difference]: Start difference. First operand 155 states and 202 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:34,110 INFO L93 Difference]: Finished difference Result 404 states and 517 transitions. [2022-07-13 02:15:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:15:34,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-13 02:15:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:34,111 INFO L225 Difference]: With dead ends: 404 [2022-07-13 02:15:34,111 INFO L226 Difference]: Without dead ends: 330 [2022-07-13 02:15:34,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-13 02:15:34,112 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 486 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:34,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 501 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 02:15:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-13 02:15:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 166. [2022-07-13 02:15:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 149 states have internal predecessors, (192), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-13 02:15:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2022-07-13 02:15:34,122 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 37 [2022-07-13 02:15:34,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:34,122 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2022-07-13 02:15:34,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2022-07-13 02:15:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 02:15:34,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:34,124 INFO L195 NwaCegarLoop]: trace histogram [3, 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:34,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 02:15:34,125 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:34,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:34,125 INFO L85 PathProgramCache]: Analyzing trace with hash -394807024, now seen corresponding path program 1 times [2022-07-13 02:15:34,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:34,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431768155] [2022-07-13 02:15:34,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:34,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 02:15:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:34,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431768155] [2022-07-13 02:15:34,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431768155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:34,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092512459] [2022-07-13 02:15:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:34,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:34,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:34,202 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:34,203 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:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:34,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:34,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:34,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092512459] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:34,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:34,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-07-13 02:15:34,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392537762] [2022-07-13 02:15:34,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:34,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:15:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:34,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:15:34,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:34,399 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:15:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:36,358 INFO L93 Difference]: Finished difference Result 793 states and 1009 transitions. [2022-07-13 02:15:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 02:15:36,360 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2022-07-13 02:15:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:36,362 INFO L225 Difference]: With dead ends: 793 [2022-07-13 02:15:36,362 INFO L226 Difference]: Without dead ends: 704 [2022-07-13 02:15:36,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 02:15:36,363 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 1236 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4343 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 4473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 4343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:36,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 407 Invalid, 4473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 4343 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 02:15:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-07-13 02:15:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 153. [2022-07-13 02:15:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.40625) internal successors, (180), 139 states have internal predecessors, (180), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-13 02:15:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 196 transitions. [2022-07-13 02:15:36,378 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 196 transitions. Word has length 41 [2022-07-13 02:15:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:36,378 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 196 transitions. [2022-07-13 02:15:36,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:15:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 196 transitions. [2022-07-13 02:15:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 02:15:36,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:36,379 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] [2022-07-13 02:15:36,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 02:15:36,596 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:36,596 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash -264308223, now seen corresponding path program 2 times [2022-07-13 02:15:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:36,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471636457] [2022-07-13 02:15:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:36,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:36,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:36,704 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:36,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:36,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471636457] [2022-07-13 02:15:36,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471636457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:36,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:36,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 02:15:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331344544] [2022-07-13 02:15:36,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:36,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 02:15:36,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:36,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 02:15:36,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:36,707 INFO L87 Difference]: Start difference. First operand 153 states and 196 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:37,444 INFO L93 Difference]: Finished difference Result 480 states and 614 transitions. [2022-07-13 02:15:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:15:37,444 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-07-13 02:15:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:37,446 INFO L225 Difference]: With dead ends: 480 [2022-07-13 02:15:37,446 INFO L226 Difference]: Without dead ends: 410 [2022-07-13 02:15:37,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-13 02:15:37,447 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 641 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:37,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 707 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 02:15:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-13 02:15:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 227. [2022-07-13 02:15:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 209 states have internal predecessors, (277), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-13 02:15:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 300 transitions. [2022-07-13 02:15:37,458 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 300 transitions. Word has length 41 [2022-07-13 02:15:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:37,458 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 300 transitions. [2022-07-13 02:15:37,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 300 transitions. [2022-07-13 02:15:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 02:15:37,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:37,459 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] [2022-07-13 02:15:37,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 02:15:37,460 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1073654849, now seen corresponding path program 1 times [2022-07-13 02:15:37,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:37,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861644701] [2022-07-13 02:15:37,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:37,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:37,547 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:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:37,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861644701] [2022-07-13 02:15:37,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861644701] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:37,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266113285] [2022-07-13 02:15:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:37,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:37,555 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:37,557 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:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:37,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 02:15:37,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:37,649 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:37,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:37,794 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:37,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266113285] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:37,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:37,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-07-13 02:15:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595492470] [2022-07-13 02:15:37,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:37,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 02:15:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 02:15:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-07-13 02:15:37,795 INFO L87 Difference]: Start difference. First operand 227 states and 300 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:15:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:38,511 INFO L93 Difference]: Finished difference Result 624 states and 834 transitions. [2022-07-13 02:15:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 02:15:38,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-07-13 02:15:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:38,514 INFO L225 Difference]: With dead ends: 624 [2022-07-13 02:15:38,514 INFO L226 Difference]: Without dead ends: 492 [2022-07-13 02:15:38,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-07-13 02:15:38,515 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 607 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:38,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 625 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 02:15:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-07-13 02:15:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 338. [2022-07-13 02:15:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 298 states have (on average 1.4026845637583893) internal successors, (418), 311 states have internal predecessors, (418), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2022-07-13 02:15:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 458 transitions. [2022-07-13 02:15:38,529 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 458 transitions. Word has length 41 [2022-07-13 02:15:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:38,529 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 458 transitions. [2022-07-13 02:15:38,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:15:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 458 transitions. [2022-07-13 02:15:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 02:15:38,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:38,530 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:38,549 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:38,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 02:15:38,743 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1708184769, now seen corresponding path program 1 times [2022-07-13 02:15:38,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:38,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410821060] [2022-07-13 02:15:38,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:38,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:38,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:38,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410821060] [2022-07-13 02:15:38,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410821060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:38,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052775340] [2022-07-13 02:15:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:38,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:38,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:38,833 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:38,834 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:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:38,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 02:15:38,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 02:15:38,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:39,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052775340] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:39,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 02:15:39,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 20 [2022-07-13 02:15:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629848810] [2022-07-13 02:15:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:39,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 02:15:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 02:15:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:15:39,056 INFO L87 Difference]: Start difference. First operand 338 states and 458 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 02:15:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:39,223 INFO L93 Difference]: Finished difference Result 695 states and 947 transitions. [2022-07-13 02:15:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 02:15:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-07-13 02:15:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:39,226 INFO L225 Difference]: With dead ends: 695 [2022-07-13 02:15:39,226 INFO L226 Difference]: Without dead ends: 607 [2022-07-13 02:15:39,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-07-13 02:15:39,227 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 166 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:39,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1813 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-07-13 02:15:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 327. [2022-07-13 02:15:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 290 states have (on average 1.4068965517241379) internal successors, (408), 302 states have internal predecessors, (408), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-13 02:15:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 444 transitions. [2022-07-13 02:15:39,250 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 444 transitions. Word has length 45 [2022-07-13 02:15:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:39,250 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 444 transitions. [2022-07-13 02:15:39,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 02:15:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 444 transitions. [2022-07-13 02:15:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 02:15:39,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:39,251 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] [2022-07-13 02:15:39,281 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:39,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 02:15:39,467 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1609884674, now seen corresponding path program 1 times [2022-07-13 02:15:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:39,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119811950] [2022-07-13 02:15:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 02:15:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,503 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:39,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:39,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119811950] [2022-07-13 02:15:39,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119811950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:39,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79499544] [2022-07-13 02:15:39,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:39,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:39,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:39,516 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:39,517 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:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 02:15:39,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:39,568 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:39,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:39,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79499544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:39,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:39,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-07-13 02:15:39,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076110283] [2022-07-13 02:15:39,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:39,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:15:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:39,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:15:39,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:39,570 INFO L87 Difference]: Start difference. First operand 327 states and 444 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:39,603 INFO L93 Difference]: Finished difference Result 586 states and 797 transitions. [2022-07-13 02:15:39,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:15:39,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-07-13 02:15:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:39,604 INFO L225 Difference]: With dead ends: 586 [2022-07-13 02:15:39,604 INFO L226 Difference]: Without dead ends: 351 [2022-07-13 02:15:39,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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:39,605 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 244 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:39,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 244 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:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-13 02:15:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 337. [2022-07-13 02:15:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 300 states have (on average 1.3933333333333333) internal successors, (418), 312 states have internal predecessors, (418), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-07-13 02:15:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 454 transitions. [2022-07-13 02:15:39,619 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 454 transitions. Word has length 47 [2022-07-13 02:15:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:39,619 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 454 transitions. [2022-07-13 02:15:39,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 454 transitions. [2022-07-13 02:15:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 02:15:39,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:39,620 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] [2022-07-13 02:15:39,638 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:39,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 02:15:39,835 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1216283857, now seen corresponding path program 1 times [2022-07-13 02:15:39,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687187290] [2022-07-13 02:15:39,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:39,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,905 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:39,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687187290] [2022-07-13 02:15:39,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687187290] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420741232] [2022-07-13 02:15:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:39,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:39,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:39,907 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:39,908 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:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:39,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 02:15:39,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:39,987 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:39,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:40,052 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:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420741232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:40,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:40,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-13 02:15:40,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13831042] [2022-07-13 02:15:40,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:40,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 02:15:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:40,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 02:15:40,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:40,054 INFO L87 Difference]: Start difference. First operand 337 states and 454 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:41,142 INFO L93 Difference]: Finished difference Result 1032 states and 1398 transitions. [2022-07-13 02:15:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 02:15:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-13 02:15:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:41,145 INFO L225 Difference]: With dead ends: 1032 [2022-07-13 02:15:41,145 INFO L226 Difference]: Without dead ends: 919 [2022-07-13 02:15:41,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2022-07-13 02:15:41,146 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 370 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:41,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 838 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 02:15:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-07-13 02:15:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 475. [2022-07-13 02:15:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 428 states have (on average 1.4042056074766356) internal successors, (601), 441 states have internal predecessors, (601), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-07-13 02:15:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 653 transitions. [2022-07-13 02:15:41,166 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 653 transitions. Word has length 48 [2022-07-13 02:15:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:41,166 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 653 transitions. [2022-07-13 02:15:41,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 653 transitions. [2022-07-13 02:15:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 02:15:41,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:41,167 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] [2022-07-13 02:15:41,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:41,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:41,387 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1216281935, now seen corresponding path program 1 times [2022-07-13 02:15:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:41,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342056071] [2022-07-13 02:15:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:41,449 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:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:41,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342056071] [2022-07-13 02:15:41,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342056071] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:41,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526708371] [2022-07-13 02:15:41,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:41,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:41,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:41,451 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:41,452 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:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:41,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 02:15:41,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:41,587 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:41,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:41,733 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:41,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526708371] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:41,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:41,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-13 02:15:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103924660] [2022-07-13 02:15:41,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:41,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:15:41,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:15:41,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:41,735 INFO L87 Difference]: Start difference. First operand 475 states and 653 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:42,766 INFO L93 Difference]: Finished difference Result 1166 states and 1605 transitions. [2022-07-13 02:15:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 02:15:42,767 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-07-13 02:15:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:42,770 INFO L225 Difference]: With dead ends: 1166 [2022-07-13 02:15:42,770 INFO L226 Difference]: Without dead ends: 959 [2022-07-13 02:15:42,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 02:15:42,771 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 621 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:42,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 457 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 02:15:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-13 02:15:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 605. [2022-07-13 02:15:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 548 states have (on average 1.4105839416058394) internal successors, (773), 562 states have internal predecessors, (773), 31 states have call successors, (31), 12 states have call predecessors, (31), 16 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2022-07-13 02:15:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 841 transitions. [2022-07-13 02:15:42,824 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 841 transitions. Word has length 48 [2022-07-13 02:15:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:42,824 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 841 transitions. [2022-07-13 02:15:42,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 841 transitions. [2022-07-13 02:15:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 02:15:42,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:42,825 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] [2022-07-13 02:15:42,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:43,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-13 02:15:43,042 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1743227838, now seen corresponding path program 1 times [2022-07-13 02:15:43,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:43,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231264479] [2022-07-13 02:15:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:43,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,094 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:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:43,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231264479] [2022-07-13 02:15:43,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231264479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:43,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222722042] [2022-07-13 02:15:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:43,096 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:43,097 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:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:43,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:43,165 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:43,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:43,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222722042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:43,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:43,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-13 02:15:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652484647] [2022-07-13 02:15:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:43,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:43,167 INFO L87 Difference]: Start difference. First operand 605 states and 841 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:43,230 INFO L93 Difference]: Finished difference Result 1197 states and 1683 transitions. [2022-07-13 02:15:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-13 02:15:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:43,232 INFO L225 Difference]: With dead ends: 1197 [2022-07-13 02:15:43,232 INFO L226 Difference]: Without dead ends: 681 [2022-07-13 02:15:43,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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:43,235 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 50 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 257 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:43,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 257 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:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-07-13 02:15:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 631. [2022-07-13 02:15:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 574 states have (on average 1.4024390243902438) internal successors, (805), 588 states have internal predecessors, (805), 31 states have call successors, (31), 12 states have call predecessors, (31), 16 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2022-07-13 02:15:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 873 transitions. [2022-07-13 02:15:43,265 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 873 transitions. Word has length 48 [2022-07-13 02:15:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:43,265 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 873 transitions. [2022-07-13 02:15:43,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 873 transitions. [2022-07-13 02:15:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 02:15:43,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:43,267 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] [2022-07-13 02:15:43,287 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:43,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:43,483 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1386457629, now seen corresponding path program 1 times [2022-07-13 02:15:43,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:43,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246864483] [2022-07-13 02:15:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 02:15:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,527 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:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:43,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246864483] [2022-07-13 02:15:43,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246864483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:43,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074007577] [2022-07-13 02:15:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:43,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:43,536 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:43,538 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:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:43,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 02:15:43,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:43,590 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:43,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:43,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074007577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:43,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:43,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-13 02:15:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347292828] [2022-07-13 02:15:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:43,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:43,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:43,592 INFO L87 Difference]: Start difference. First operand 631 states and 873 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:43,651 INFO L93 Difference]: Finished difference Result 1025 states and 1427 transitions. [2022-07-13 02:15:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:15:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-07-13 02:15:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:43,653 INFO L225 Difference]: With dead ends: 1025 [2022-07-13 02:15:43,653 INFO L226 Difference]: Without dead ends: 653 [2022-07-13 02:15:43,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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:43,656 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 15 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 375 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:43,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 375 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:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-07-13 02:15:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 633. [2022-07-13 02:15:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 576 states have (on average 1.4045138888888888) internal successors, (809), 590 states have internal predecessors, (809), 31 states have call successors, (31), 12 states have call predecessors, (31), 16 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2022-07-13 02:15:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 877 transitions. [2022-07-13 02:15:43,682 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 877 transitions. Word has length 49 [2022-07-13 02:15:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:43,682 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 877 transitions. [2022-07-13 02:15:43,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 877 transitions. [2022-07-13 02:15:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 02:15:43,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:43,683 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] [2022-07-13 02:15:43,700 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:43,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:43,900 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1853774476, now seen corresponding path program 1 times [2022-07-13 02:15:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:43,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729969594] [2022-07-13 02:15:43,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:44,075 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:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729969594] [2022-07-13 02:15:44,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729969594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:44,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:44,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 02:15:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377757768] [2022-07-13 02:15:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 02:15:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 02:15:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:15:44,076 INFO L87 Difference]: Start difference. First operand 633 states and 877 transitions. Second operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:45,034 INFO L93 Difference]: Finished difference Result 1068 states and 1482 transitions. [2022-07-13 02:15:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:15:45,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-13 02:15:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:45,038 INFO L225 Difference]: With dead ends: 1068 [2022-07-13 02:15:45,038 INFO L226 Difference]: Without dead ends: 1067 [2022-07-13 02:15:45,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:45,039 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 742 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:45,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 525 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 02:15:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-07-13 02:15:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 629. [2022-07-13 02:15:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 572 states have (on average 1.4038461538461537) internal successors, (803), 586 states have internal predecessors, (803), 31 states have call successors, (31), 12 states have call predecessors, (31), 16 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2022-07-13 02:15:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 871 transitions. [2022-07-13 02:15:45,069 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 871 transitions. Word has length 50 [2022-07-13 02:15:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:45,070 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 871 transitions. [2022-07-13 02:15:45,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 871 transitions. [2022-07-13 02:15:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 02:15:45,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:45,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:45,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 02:15:45,071 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash -80005234, now seen corresponding path program 1 times [2022-07-13 02:15:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:45,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189051708] [2022-07-13 02:15:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:45,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:45,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 02:15:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:45,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189051708] [2022-07-13 02:15:45,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189051708] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:45,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18776713] [2022-07-13 02:15:45,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:45,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:45,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:45,200 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:45,201 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:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:45,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:15:45,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:15:45,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:15:45,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18776713] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:45,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:45,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-13 02:15:45,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533908163] [2022-07-13 02:15:45,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:45,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:15:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:15:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:45,398 INFO L87 Difference]: Start difference. First operand 629 states and 871 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 02:15:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:50,380 INFO L93 Difference]: Finished difference Result 3384 states and 4841 transitions. [2022-07-13 02:15:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-13 02:15:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2022-07-13 02:15:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:50,396 INFO L225 Difference]: With dead ends: 3384 [2022-07-13 02:15:50,396 INFO L226 Difference]: Without dead ends: 2998 [2022-07-13 02:15:50,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=512, Invalid=2794, Unknown=0, NotChecked=0, Total=3306 [2022-07-13 02:15:50,399 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 2252 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 8794 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 9074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 8794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:50,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2252 Valid, 736 Invalid, 9074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 8794 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-13 02:15:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-07-13 02:15:50,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 685. [2022-07-13 02:15:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 625 states have (on average 1.3952) internal successors, (872), 638 states have internal predecessors, (872), 34 states have call successors, (34), 13 states have call predecessors, (34), 16 states have return successors, (39), 33 states have call predecessors, (39), 32 states have call successors, (39) [2022-07-13 02:15:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 945 transitions. [2022-07-13 02:15:50,444 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 945 transitions. Word has length 56 [2022-07-13 02:15:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:50,444 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 945 transitions. [2022-07-13 02:15:50,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 02:15:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 945 transitions. [2022-07-13 02:15:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 02:15:50,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:50,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:50,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:50,662 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,SelfDestructingSolverStorable23 [2022-07-13 02:15:50,663 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 39567138, now seen corresponding path program 1 times [2022-07-13 02:15:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:50,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277346780] [2022-07-13 02:15:50,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:50,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:50,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 02:15:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:50,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:50,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277346780] [2022-07-13 02:15:50,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277346780] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:50,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220801469] [2022-07-13 02:15:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:50,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:50,756 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:50,781 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:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:50,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 02:15:50,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:50,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:50,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220801469] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:50,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:50,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 13 [2022-07-13 02:15:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954683066] [2022-07-13 02:15:50,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:50,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 02:15:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 02:15:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:15:50,901 INFO L87 Difference]: Start difference. First operand 685 states and 945 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 02:15:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:53,177 INFO L93 Difference]: Finished difference Result 2890 states and 4114 transitions. [2022-07-13 02:15:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 02:15:53,178 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-07-13 02:15:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:53,186 INFO L225 Difference]: With dead ends: 2890 [2022-07-13 02:15:53,186 INFO L226 Difference]: Without dead ends: 2755 [2022-07-13 02:15:53,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 02:15:53,188 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 754 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4988 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:53,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 695 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4988 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 02:15:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2022-07-13 02:15:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 708. [2022-07-13 02:15:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 647 states have (on average 1.3910355486862442) internal successors, (900), 659 states have internal predecessors, (900), 35 states have call successors, (35), 14 states have call predecessors, (35), 16 states have return successors, (39), 34 states have call predecessors, (39), 32 states have call successors, (39) [2022-07-13 02:15:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 974 transitions. [2022-07-13 02:15:53,233 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 974 transitions. Word has length 56 [2022-07-13 02:15:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:53,233 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 974 transitions. [2022-07-13 02:15:53,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 02:15:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 974 transitions. [2022-07-13 02:15:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 02:15:53,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:53,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:53,269 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:53,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:53,442 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 39569060, now seen corresponding path program 1 times [2022-07-13 02:15:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:53,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779098447] [2022-07-13 02:15:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 02:15:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:53,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779098447] [2022-07-13 02:15:53,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779098447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:53,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571111741] [2022-07-13 02:15:53,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:53,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:53,516 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:53,517 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:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:53,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 02:15:53,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:53,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:53,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571111741] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:53,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:53,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2022-07-13 02:15:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676551342] [2022-07-13 02:15:53,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:53,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 02:15:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:53,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 02:15:53,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-13 02:15:53,811 INFO L87 Difference]: Start difference. First operand 708 states and 974 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 17 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:15:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:56,529 INFO L93 Difference]: Finished difference Result 2445 states and 3394 transitions. [2022-07-13 02:15:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 02:15:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 17 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2022-07-13 02:15:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:56,548 INFO L225 Difference]: With dead ends: 2445 [2022-07-13 02:15:56,548 INFO L226 Difference]: Without dead ends: 2314 [2022-07-13 02:15:56,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=2459, Unknown=0, NotChecked=0, Total=2862 [2022-07-13 02:15:56,551 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 1392 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5507 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 5704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 5507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:56,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 448 Invalid, 5704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 5507 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 02:15:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2022-07-13 02:15:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 724. [2022-07-13 02:15:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 662 states have (on average 1.3882175226586102) internal successors, (919), 673 states have internal predecessors, (919), 36 states have call successors, (36), 15 states have call predecessors, (36), 16 states have return successors, (39), 35 states have call predecessors, (39), 32 states have call successors, (39) [2022-07-13 02:15:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 994 transitions. [2022-07-13 02:15:56,592 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 994 transitions. Word has length 56 [2022-07-13 02:15:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:56,593 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 994 transitions. [2022-07-13 02:15:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 17 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:15:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 994 transitions. [2022-07-13 02:15:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 02:15:56,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:56,594 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:56,628 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:56,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:56,811 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash -769779488, now seen corresponding path program 2 times [2022-07-13 02:15:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:56,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773980401] [2022-07-13 02:15:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:56,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 02:15:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:56,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773980401] [2022-07-13 02:15:56,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773980401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:56,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548163155] [2022-07-13 02:15:56,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:56,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:56,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:56,920 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:56,924 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:56,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:15:56,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:56,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:15:56,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:15:57,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:15:57,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548163155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:57,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:57,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2022-07-13 02:15:57,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885194843] [2022-07-13 02:15:57,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:57,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:15:57,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:15:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:57,162 INFO L87 Difference]: Start difference. First operand 724 states and 994 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 02:16:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:00,726 INFO L93 Difference]: Finished difference Result 2693 states and 3735 transitions. [2022-07-13 02:16:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 02:16:00,727 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-07-13 02:16:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:00,740 INFO L225 Difference]: With dead ends: 2693 [2022-07-13 02:16:00,741 INFO L226 Difference]: Without dead ends: 2323 [2022-07-13 02:16:00,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=332, Invalid=1738, Unknown=0, NotChecked=0, Total=2070 [2022-07-13 02:16:00,745 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 1862 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6511 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 6762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 6511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:00,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 561 Invalid, 6762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 6511 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-13 02:16:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2022-07-13 02:16:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 736. [2022-07-13 02:16:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 671 states have (on average 1.3740685543964233) internal successors, (922), 679 states have internal predecessors, (922), 39 states have call successors, (39), 18 states have call predecessors, (39), 16 states have return successors, (39), 38 states have call predecessors, (39), 32 states have call successors, (39) [2022-07-13 02:16:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1000 transitions. [2022-07-13 02:16:00,791 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1000 transitions. Word has length 56 [2022-07-13 02:16:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:00,791 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1000 transitions. [2022-07-13 02:16:00,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 02:16:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1000 transitions. [2022-07-13 02:16:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 02:16:00,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:00,793 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:16:00,812 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:16:01,010 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:16:01,010 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:16:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1350874477, now seen corresponding path program 1 times [2022-07-13 02:16:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849537205] [2022-07-13 02:16:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:16:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:16:01,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:01,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849537205] [2022-07-13 02:16:01,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849537205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:01,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:16:01,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:16:01,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112041432] [2022-07-13 02:16:01,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:01,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:16:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:01,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:16:01,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:16:01,035 INFO L87 Difference]: Start difference. First operand 736 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:01,150 INFO L93 Difference]: Finished difference Result 1121 states and 1511 transitions. [2022-07-13 02:16:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:16:01,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-07-13 02:16:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:01,153 INFO L225 Difference]: With dead ends: 1121 [2022-07-13 02:16:01,153 INFO L226 Difference]: Without dead ends: 866 [2022-07-13 02:16:01,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:16:01,155 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 148 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:01,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 209 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:16:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-07-13 02:16:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 766. [2022-07-13 02:16:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 701 states have (on average 1.3823109843081312) internal successors, (969), 709 states have internal predecessors, (969), 39 states have call successors, (39), 18 states have call predecessors, (39), 16 states have return successors, (39), 38 states have call predecessors, (39), 32 states have call successors, (39) [2022-07-13 02:16:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1047 transitions. [2022-07-13 02:16:01,196 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1047 transitions. Word has length 55 [2022-07-13 02:16:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:01,196 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1047 transitions. [2022-07-13 02:16:01,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1047 transitions. [2022-07-13 02:16:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 02:16:01,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:01,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:01,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 02:16:01,198 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:16:01,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1823799633, now seen corresponding path program 1 times [2022-07-13 02:16:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:01,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096521732] [2022-07-13 02:16:01,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:16:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,261 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:16:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:01,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096521732] [2022-07-13 02:16:01,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096521732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:01,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:16:01,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 02:16:01,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759731717] [2022-07-13 02:16:01,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:01,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 02:16:01,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:01,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 02:16:01,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:16:01,264 INFO L87 Difference]: Start difference. First operand 766 states and 1047 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:02,343 INFO L93 Difference]: Finished difference Result 2285 states and 3286 transitions. [2022-07-13 02:16:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 02:16:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 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:16:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:02,348 INFO L225 Difference]: With dead ends: 2285 [2022-07-13 02:16:02,349 INFO L226 Difference]: Without dead ends: 2053 [2022-07-13 02:16:02,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-07-13 02:16:02,350 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 496 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:02,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 798 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 02:16:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2022-07-13 02:16:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 951. [2022-07-13 02:16:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 873 states have (on average 1.399770904925544) internal successors, (1222), 882 states have internal predecessors, (1222), 48 states have call successors, (48), 21 states have call predecessors, (48), 20 states have return successors, (52), 47 states have call predecessors, (52), 41 states have call successors, (52) [2022-07-13 02:16:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1322 transitions. [2022-07-13 02:16:02,398 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1322 transitions. Word has length 55 [2022-07-13 02:16:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:02,398 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1322 transitions. [2022-07-13 02:16:02,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1322 transitions. [2022-07-13 02:16:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 02:16:02,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:02,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:02,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 02:16:02,400 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:16:02,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1823797711, now seen corresponding path program 1 times [2022-07-13 02:16:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716409914] [2022-07-13 02:16:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:02,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:02,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:02,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:16:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:02,457 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:16:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:02,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716409914] [2022-07-13 02:16:02,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716409914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:02,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:16:02,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 02:16:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443624118] [2022-07-13 02:16:02,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:02,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 02:16:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:02,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 02:16:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:16:02,459 INFO L87 Difference]: Start difference. First operand 951 states and 1322 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:03,143 INFO L93 Difference]: Finished difference Result 2622 states and 3793 transitions. [2022-07-13 02:16:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 02:16:03,144 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 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:16:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:03,150 INFO L225 Difference]: With dead ends: 2622 [2022-07-13 02:16:03,150 INFO L226 Difference]: Without dead ends: 2158 [2022-07-13 02:16:03,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-07-13 02:16:03,152 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 912 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:03,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 545 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 02:16:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2022-07-13 02:16:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1146. [2022-07-13 02:16:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1055 states have (on average 1.4075829383886256) internal successors, (1485), 1065 states have internal predecessors, (1485), 57 states have call successors, (57), 24 states have call predecessors, (57), 24 states have return successors, (64), 56 states have call predecessors, (64), 50 states have call successors, (64) [2022-07-13 02:16:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1606 transitions. [2022-07-13 02:16:03,211 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1606 transitions. Word has length 55 [2022-07-13 02:16:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:03,211 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1606 transitions. [2022-07-13 02:16:03,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1606 transitions. [2022-07-13 02:16:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 02:16:03,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:03,213 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] [2022-07-13 02:16:03,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 02:16:03,213 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:16:03,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:03,213 INFO L85 PathProgramCache]: Analyzing trace with hash 601890762, now seen corresponding path program 1 times [2022-07-13 02:16:03,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:03,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834478070] [2022-07-13 02:16:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:16:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 02:16:03,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:03,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834478070] [2022-07-13 02:16:03,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834478070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:16:03,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131557988] [2022-07-13 02:16:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:03,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:16:03,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:16:03,302 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:16:03,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 02:16:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:03,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:16:03,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:16:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 02:16:03,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:16:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 02:16:03,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131557988] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:16:03,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:16:03,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 22 [2022-07-13 02:16:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749705749] [2022-07-13 02:16:03,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:16:03,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 02:16:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 02:16:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-07-13 02:16:03,600 INFO L87 Difference]: Start difference. First operand 1146 states and 1606 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:16:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:04,516 INFO L93 Difference]: Finished difference Result 1353 states and 1857 transitions. [2022-07-13 02:16:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 02:16:04,516 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2022-07-13 02:16:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:04,525 INFO L225 Difference]: With dead ends: 1353 [2022-07-13 02:16:04,526 INFO L226 Difference]: Without dead ends: 1096 [2022-07-13 02:16:04,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 02:16:04,529 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 249 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:04,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 711 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 02:16:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-07-13 02:16:04,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 959. [2022-07-13 02:16:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 883 states have (on average 1.3963759909399773) internal successors, (1233), 893 states have internal predecessors, (1233), 46 states have call successors, (46), 20 states have call predecessors, (46), 20 states have return successors, (51), 45 states have call predecessors, (51), 40 states have call successors, (51) [2022-07-13 02:16:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1330 transitions. [2022-07-13 02:16:04,583 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1330 transitions. Word has length 57 [2022-07-13 02:16:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:04,583 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 1330 transitions. [2022-07-13 02:16:04,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:16:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1330 transitions. [2022-07-13 02:16:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 02:16:04,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:04,586 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] [2022-07-13 02:16:04,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-13 02:16:04,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-13 02:16:04,795 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:16:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:04,796 INFO L85 PathProgramCache]: Analyzing trace with hash -796225912, now seen corresponding path program 1 times [2022-07-13 02:16:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:04,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302428936] [2022-07-13 02:16:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:04,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:04,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:16:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:04,891 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:16:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:04,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302428936] [2022-07-13 02:16:04,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302428936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:04,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:16:04,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 02:16:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408191651] [2022-07-13 02:16:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:04,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:16:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:04,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:16:04,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:16:04,893 INFO L87 Difference]: Start difference. First operand 959 states and 1330 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:05,351 INFO L93 Difference]: Finished difference Result 1256 states and 1715 transitions. [2022-07-13 02:16:05,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 02:16:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-07-13 02:16:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:05,354 INFO L225 Difference]: With dead ends: 1256 [2022-07-13 02:16:05,354 INFO L226 Difference]: Without dead ends: 914 [2022-07-13 02:16:05,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:16:05,355 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 160 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:05,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 561 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 02:16:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2022-07-13 02:16:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 835. [2022-07-13 02:16:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 768 states have (on average 1.38671875) internal successors, (1065), 777 states have internal predecessors, (1065), 40 states have call successors, (40), 18 states have call predecessors, (40), 17 states have return successors, (42), 39 states have call predecessors, (42), 34 states have call successors, (42) [2022-07-13 02:16:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1147 transitions. [2022-07-13 02:16:05,395 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1147 transitions. Word has length 57 [2022-07-13 02:16:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:05,395 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1147 transitions. [2022-07-13 02:16:05,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:16:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1147 transitions. [2022-07-13 02:16:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 02:16:05,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:05,399 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] [2022-07-13 02:16:05,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 02:16:05,400 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:16:05,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:05,400 INFO L85 PathProgramCache]: Analyzing trace with hash 650785573, now seen corresponding path program 1 times [2022-07-13 02:16:05,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:05,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882293330] [2022-07-13 02:16:05,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:05,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:16:05,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 02:16:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:16:05,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 02:16:05,468 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 02:16:05,469 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2022-07-13 02:16:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2022-07-13 02:16:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2022-07-13 02:16:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2022-07-13 02:16:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2022-07-13 02:16:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2022-07-13 02:16:05,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2022-07-13 02:16:05,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2022-07-13 02:16:05,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2022-07-13 02:16:05,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2022-07-13 02:16:05,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 02:16:05,475 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:05,477 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 02:16:05,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:16:05 BoogieIcfgContainer [2022-07-13 02:16:05,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 02:16:05,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 02:16:05,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 02:16:05,514 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 02:16:05,514 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:28" (3/4) ... [2022-07-13 02:16:05,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 02:16:05,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 02:16:05,517 INFO L158 Benchmark]: Toolchain (without parser) took 37698.96ms. Allocated memory was 92.3MB in the beginning and 243.3MB in the end (delta: 151.0MB). Free memory was 63.4MB in the beginning and 80.4MB in the end (delta: -17.0MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. [2022-07-13 02:16:05,517 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:16:05,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.38ms. Allocated memory was 92.3MB in the beginning and 132.1MB in the end (delta: 39.8MB). Free memory was 63.2MB in the beginning and 104.8MB in the end (delta: -41.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-13 02:16:05,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.16ms. Allocated memory is still 132.1MB. Free memory was 104.8MB in the beginning and 103.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:16:05,518 INFO L158 Benchmark]: Boogie Preprocessor took 20.90ms. Allocated memory is still 132.1MB. Free memory was 103.5MB in the beginning and 101.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:16:05,518 INFO L158 Benchmark]: RCFGBuilder took 425.83ms. Allocated memory is still 132.1MB. Free memory was 101.5MB in the beginning and 82.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 02:16:05,518 INFO L158 Benchmark]: TraceAbstraction took 36961.50ms. Allocated memory was 132.1MB in the beginning and 243.3MB in the end (delta: 111.1MB). Free memory was 82.2MB in the beginning and 81.5MB in the end (delta: 788.3kB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2022-07-13 02:16:05,518 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 243.3MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:16:05,519 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.38ms. Allocated memory was 92.3MB in the beginning and 132.1MB in the end (delta: 39.8MB). Free memory was 63.2MB in the beginning and 104.8MB in the end (delta: -41.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.16ms. Allocated memory is still 132.1MB. Free memory was 104.8MB in the beginning and 103.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.90ms. Allocated memory is still 132.1MB. Free memory was 103.5MB in the beginning and 101.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.83ms. Allocated memory is still 132.1MB. Free memory was 101.5MB in the beginning and 82.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 36961.50ms. Allocated memory was 132.1MB in the beginning and 243.3MB in the end (delta: 111.1MB). Free memory was 82.2MB in the beginning and 81.5MB in the end (delta: 788.3kB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 243.3MB. Free memory is still 80.4MB. 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_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=-126, eb=-127] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=0, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L81] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L242] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L30] COND FALSE !(! m) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L58] COND TRUE 1 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L78] EXPR e + 128 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L78] EXPR e + 128 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=36028799149670403] [L78] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, e=-126, m=0, m = m & ~ (1U << 24U)=36028799149670402, res=2130706431, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L79] __retres4 = res VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, __retres4=2130706431, e=-126, m=0, m = m & ~ (1U << 24U)=36028799149670402, res=2130706431, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L81] return (__retres4); VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799149670403, \result=2130706431, __retres4=2130706431, e=-126, m=0, m = m & ~ (1U << 24U)=36028799149670402, res=2130706431, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L243] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=2130706431, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799149670402, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=33554432, zero=0] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L58] COND TRUE 1 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L78] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L78] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799149670402, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L78] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799149670402, res=2130706432, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L79] __retres4 = res VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, __retres4=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799149670402, res=2130706432, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L81] return (__retres4); VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799149670402, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, \result=36028799149670400, __retres4=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799149670402, res=2130706432, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L244] RET, EXPR base2flt(mb, eb) VAL [a=2130706431, base2flt(mb, eb)=36028799149670400, ea=-126, eb=-127, m = m & ~ (1U << 24U)=36028799149670402, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=16777216, zero=0] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=2130706431, \old(b)=2130706432, \old(ma = a & ((1U << 24U) - 1U))=36028799149670404, \old(ma = ma & ((1U << 24U) - 1U))=36028799149670407, \old(ma = ma | (1U << 24U))=36028799149670401, \old(mb = b & ((1U << 24U) - 1U))=36028799149670408, \old(mb = mb | (1U << 24U))=36028799149670406, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799149670405, m = m & ~ (1U << 24U)=36028799149670402, ma = a & ((1U << 24U) - 1U)=36028799149670404, ma = ma & ((1U << 24U) - 1U)=36028799149670407, ma = ma | (1U << 24U)=36028799149670401, mb = b & ((1U << 24U) - 1U)=36028799149670408, mb = mb | (1U << 24U)=36028799149670406, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799149670405] [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)=2130706431, \old(b)=2130706432, \old(ma = a & ((1U << 24U) - 1U))=36028799149670404, \old(ma = ma & ((1U << 24U) - 1U))=36028799149670407, \old(ma = ma | (1U << 24U))=36028799149670401, \old(mb = b & ((1U << 24U) - 1U))=36028799149670408, \old(mb = mb | (1U << 24U))=36028799149670406, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799149670405, a=2130706431, b=2130706432, m = m & ~ (1U << 24U)=36028799149670402, ma = a & ((1U << 24U) - 1U)=36028799149670404, ma = ma & ((1U << 24U) - 1U)=36028799149670407, ma = ma | (1U << 24U)=36028799149670401, mb = b & ((1U << 24U) - 1U)=36028799149670408, mb = mb | (1U << 24U)=36028799149670406, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799149670405] [L95] COND TRUE a < b [L96] tmp = a [L97] a = b [L98] b = tmp VAL [\old(a)=2130706431, \old(b)=2130706432, \old(ma = a & ((1U << 24U) - 1U))=36028799149670404, \old(ma = ma & ((1U << 24U) - 1U))=36028799149670407, \old(ma = ma | (1U << 24U))=36028799149670401, \old(mb = b & ((1U << 24U) - 1U))=36028799149670408, \old(mb = mb | (1U << 24U))=36028799149670406, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799149670405, a=2130706432, b=2130706431, m = m & ~ (1U << 24U)=36028799149670402, ma = a & ((1U << 24U) - 1U)=36028799149670404, ma = ma & ((1U << 24U) - 1U)=36028799149670407, ma = ma | (1U << 24U)=36028799149670401, mb = b & ((1U << 24U) - 1U)=36028799149670408, mb = mb | (1U << 24U)=36028799149670406, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799149670405, tmp=2130706431] [L102] COND FALSE !(! b) VAL [\old(a)=2130706431, \old(b)=2130706432, \old(ma = a & ((1U << 24U) - 1U))=36028799149670404, \old(ma = ma & ((1U << 24U) - 1U))=36028799149670407, \old(ma = ma | (1U << 24U))=36028799149670401, \old(mb = b & ((1U << 24U) - 1U))=36028799149670408, \old(mb = mb | (1U << 24U))=36028799149670406, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799149670405, a=2130706432, b=2130706431, m = m & ~ (1U << 24U)=36028799149670402, ma = a & ((1U << 24U) - 1U)=36028799149670404, ma = ma & ((1U << 24U) - 1U)=36028799149670407, ma = ma | (1U << 24U)=36028799149670401, mb = b & ((1U << 24U) - 1U)=36028799149670408, mb = mb | (1U << 24U)=36028799149670406, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799149670405, tmp=2130706431] [L109] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=2130706431, \old(b)=2130706432, \old(ma = a & ((1U << 24U) - 1U))=36028799149670404, \old(ma = ma & ((1U << 24U) - 1U))=36028799149670407, \old(ma = ma | (1U << 24U))=36028799149670401, \old(mb = b & ((1U << 24U) - 1U))=36028799149670408, \old(mb = mb | (1U << 24U))=36028799149670406, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799149670405, a=2130706432, b=2130706431, m = m & ~ (1U << 24U)=36028799149670402, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=36028799149670407, ma = ma | (1U << 24U)=36028799149670401, mb = b & ((1U << 24U) - 1U)=36028799149670408, mb = mb | (1U << 24U)=36028799149670406, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799149670405, tmp=2130706431] [L110] (int )(a >> 24U) - 128 VAL [\old(a)=2130706431, \old(b)=2130706432, \old(ma = a & ((1U << 24U) - 1U))=36028799149670404, \old(ma = ma & ((1U << 24U) - 1U))=36028799149670407, \old(ma = ma | (1U << 24U))=36028799149670401, \old(mb = b & ((1U << 24U) - 1U))=36028799149670408, \old(mb = mb | (1U << 24U))=36028799149670406, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799149670405, a=2130706432, b=2130706431, m = m & ~ (1U << 24U)=36028799149670402, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=36028799149670407, ma = ma | (1U << 24U)=36028799149670401, mb = b & ((1U << 24U) - 1U)=36028799149670408, mb = mb | (1U << 24U)=36028799149670406, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799149670405, tmp=2130706431] - 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 4 procedures, 124 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 36.9s, OverallIterations: 33, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14828 SdHoareTripleChecker+Valid, 19.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14731 mSDsluCounter, 17118 SdHoareTripleChecker+Invalid, 16.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10431 mSDsCounter, 1651 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47935 IncrementalHoareTripleChecker+Invalid, 49586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1651 mSolverCounterUnsat, 6687 mSDtfsCounter, 47935 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2055 GetRequests, 1470 SyntacticMatches, 15 SemanticMatches, 570 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1146occurred in iteration=30, InterpolantAutomatonStates: 450, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 13216 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2057 NumberOfCodeBlocks, 2057 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2469 ConstructedInterpolants, 0 QuantifiedInterpolants, 6645 SizeOfPredicates, 61 NumberOfNonLiveVariables, 3176 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 63 InterpolantComputations, 22 PerfectInterpolantSequences, 809/961 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:16:05,534 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