./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f4b24e32 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-3a.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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:56:45,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:56:45,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:56:45,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:56:45,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:56:45,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:56:45,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:56:45,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:56:45,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:56:45,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:56:45,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:56:45,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:56:45,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:56:45,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:56:45,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:56:45,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:56:45,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:56:45,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:56:45,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:56:45,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:56:45,500 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:56:45,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:56:45,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:56:45,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:56:45,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:56:45,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:56:45,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:56:45,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:56:45,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:56:45,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:56:45,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:56:45,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:56:45,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:56:45,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:56:45,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:56:45,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:56:45,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:56:45,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:56:45,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:56:45,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:56:45,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:56:45,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:56:45,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-14 13:56:45,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:56:45,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:56:45,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:56:45,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:56:45,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:56:45,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:56:45,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:56:45,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:56:45,544 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:56:45,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:56:45,544 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:56:45,544 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:56:45,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:56:45,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:56:45,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:56:45,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:56:45,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:56:45,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:56:45,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:56:45,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:56:45,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:56:45,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:56:45,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:56:45,546 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2022-07-14 13:56:45,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:56:45,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:56:45,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:56:45,788 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:56:45,788 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:56:45,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-14 13:56:45,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b6fcbaf/d34254f2974c45ed8bdf39abf0c2864a/FLAG26004c5a8 [2022-07-14 13:56:46,199 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:56:46,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-14 13:56:46,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b6fcbaf/d34254f2974c45ed8bdf39abf0c2864a/FLAG26004c5a8 [2022-07-14 13:56:46,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b6fcbaf/d34254f2974c45ed8bdf39abf0c2864a [2022-07-14 13:56:46,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:56:46,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:56:46,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:56:46,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:56:46,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:56:46,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de74211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46, skipping insertion in model container [2022-07-14 13:56:46,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:56:46,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:56:46,355 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-3a.c.cil.c[730,743] [2022-07-14 13:56:46,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:56:46,403 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:56:46,412 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-3a.c.cil.c[730,743] [2022-07-14 13:56:46,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:56:46,454 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:56:46,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46 WrapperNode [2022-07-14 13:56:46,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:56:46,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:56:46,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:56:46,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:56:46,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,486 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-14 13:56:46,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:56:46,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:56:46,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:56:46,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:56:46,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:56:46,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:56:46,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:56:46,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:56:46,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (1/1) ... [2022-07-14 13:56:46,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:56:46,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:46,540 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-14 13:56:46,544 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-14 13:56:46,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:56:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 13:56:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-14 13:56:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-14 13:56:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:56:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:56:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-14 13:56:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-14 13:56:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 13:56:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 13:56:46,651 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:56:46,652 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:56:46,976 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:56:46,985 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:56:46,985 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 13:56:46,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:46 BoogieIcfgContainer [2022-07-14 13:56:46,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:56:46,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:56:46,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:56:46,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:56:46,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:56:46" (1/3) ... [2022-07-14 13:56:46,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1915da50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:56:46, skipping insertion in model container [2022-07-14 13:56:46,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:46" (2/3) ... [2022-07-14 13:56:46,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1915da50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:56:46, skipping insertion in model container [2022-07-14 13:56:46,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:46" (3/3) ... [2022-07-14 13:56:46,994 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-14 13:56:47,004 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:56:47,004 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-14 13:56:47,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:56:47,062 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@2317f6e8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2dd86b59 [2022-07-14 13:56:47,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-14 13:56:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 91 states have (on average 1.7692307692307692) internal successors, (161), 111 states have internal predecessors, (161), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-14 13:56:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 13:56:47,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:47,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:47,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash -618414996, now seen corresponding path program 1 times [2022-07-14 13:56:47,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:47,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634087653] [2022-07-14 13:56:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:47,193 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-14 13:56:47,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:47,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634087653] [2022-07-14 13:56:47,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634087653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:47,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:47,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:56:47,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290913018] [2022-07-14 13:56:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:47,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 13:56:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:47,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 13:56:47,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 13:56:47,228 INFO L87 Difference]: Start difference. First operand has 124 states, 91 states have (on average 1.7692307692307692) internal successors, (161), 111 states have internal predecessors, (161), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-14 13:56:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:47,279 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2022-07-14 13:56:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 13:56:47,280 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-14 13:56:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:47,287 INFO L225 Difference]: With dead ends: 243 [2022-07-14 13:56:47,288 INFO L226 Difference]: Without dead ends: 112 [2022-07-14 13:56:47,295 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-14 13:56:47,297 INFO L413 NwaCegarLoop]: 159 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, 159 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-14 13:56:47,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-14 13:56:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-14 13:56:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 101 states have internal predecessors, (131), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 146 transitions. [2022-07-14 13:56:47,345 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 146 transitions. Word has length 9 [2022-07-14 13:56:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:47,345 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 146 transitions. [2022-07-14 13:56:47,346 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-14 13:56:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2022-07-14 13:56:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 13:56:47,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:47,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:47,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:56:47,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -619356344, now seen corresponding path program 1 times [2022-07-14 13:56:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448010793] [2022-07-14 13:56:47,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:47,422 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-14 13:56:47,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:47,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448010793] [2022-07-14 13:56:47,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448010793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:47,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:47,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661548671] [2022-07-14 13:56:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:47,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:56:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:47,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:56:47,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:56:47,428 INFO L87 Difference]: Start difference. First operand 112 states and 146 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-14 13:56:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:47,512 INFO L93 Difference]: Finished difference Result 283 states and 383 transitions. [2022-07-14 13:56:47,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:56:47,513 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-14 13:56:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:47,515 INFO L225 Difference]: With dead ends: 283 [2022-07-14 13:56:47,515 INFO L226 Difference]: Without dead ends: 174 [2022-07-14 13:56:47,516 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-14 13:56:47,517 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 106 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 388 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-14 13:56:47,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 388 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-14 13:56:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2022-07-14 13:56:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 149 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 221 transitions. [2022-07-14 13:56:47,533 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 221 transitions. Word has length 9 [2022-07-14 13:56:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:47,534 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 221 transitions. [2022-07-14 13:56:47,534 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-14 13:56:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 221 transitions. [2022-07-14 13:56:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 13:56:47,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:47,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:47,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 13:56:47,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2023794271, now seen corresponding path program 1 times [2022-07-14 13:56:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:47,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179876064] [2022-07-14 13:56:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:47,578 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-14 13:56:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:47,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179876064] [2022-07-14 13:56:47,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179876064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:47,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:47,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:56:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235870067] [2022-07-14 13:56:47,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:47,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:47,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:47,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:47,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:56:47,580 INFO L87 Difference]: Start difference. First operand 161 states and 221 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-14 13:56:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:47,702 INFO L93 Difference]: Finished difference Result 196 states and 260 transitions. [2022-07-14 13:56:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:47,702 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-14 13:56:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:47,705 INFO L225 Difference]: With dead ends: 196 [2022-07-14 13:56:47,705 INFO L226 Difference]: Without dead ends: 193 [2022-07-14 13:56:47,705 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-14 13:56:47,706 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 161 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 519 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-14 13:56:47,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 519 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-14 13:56:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2022-07-14 13:56:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 232 transitions. [2022-07-14 13:56:47,726 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 232 transitions. Word has length 13 [2022-07-14 13:56:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:47,726 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 232 transitions. [2022-07-14 13:56:47,726 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-14 13:56:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 232 transitions. [2022-07-14 13:56:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 13:56:47,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:47,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:47,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 13:56:47,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:47,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1686887160, now seen corresponding path program 1 times [2022-07-14 13:56:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:47,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140162896] [2022-07-14 13:56:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:47,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:47,772 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-14 13:56:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:47,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140162896] [2022-07-14 13:56:47,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140162896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:47,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:47,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:56:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317001241] [2022-07-14 13:56:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:47,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:47,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:47,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:47,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:56:47,775 INFO L87 Difference]: Start difference. First operand 168 states and 232 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-14 13:56:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:47,886 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2022-07-14 13:56:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:47,887 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-14 13:56:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:47,889 INFO L225 Difference]: With dead ends: 316 [2022-07-14 13:56:47,889 INFO L226 Difference]: Without dead ends: 203 [2022-07-14 13:56:47,890 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-14 13:56:47,899 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 165 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 529 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-14 13:56:47,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 529 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-14 13:56:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 172. [2022-07-14 13:56:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 142 states have (on average 1.5492957746478873) internal successors, (220), 160 states have internal predecessors, (220), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 235 transitions. [2022-07-14 13:56:47,933 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 235 transitions. Word has length 14 [2022-07-14 13:56:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:47,933 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 235 transitions. [2022-07-14 13:56:47,933 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-14 13:56:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 235 transitions. [2022-07-14 13:56:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 13:56:47,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:47,934 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:47,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 13:56:47,934 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:47,935 INFO L85 PathProgramCache]: Analyzing trace with hash 564430704, now seen corresponding path program 1 times [2022-07-14 13:56:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:47,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678849756] [2022-07-14 13:56:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:47,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:47,977 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-14 13:56:47,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:47,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678849756] [2022-07-14 13:56:47,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678849756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:47,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424165759] [2022-07-14 13:56:47,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:47,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:47,990 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-14 13:56:48,016 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-14 13:56:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:48,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:56:48,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:48,114 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-14 13:56:48,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:48,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424165759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:48,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:48,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-14 13:56:48,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140296684] [2022-07-14 13:56:48,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:48,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:48,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:48,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:48,121 INFO L87 Difference]: Start difference. First operand 172 states and 235 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-14 13:56:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:48,207 INFO L93 Difference]: Finished difference Result 242 states and 332 transitions. [2022-07-14 13:56:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:48,208 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-14 13:56:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:48,210 INFO L225 Difference]: With dead ends: 242 [2022-07-14 13:56:48,210 INFO L226 Difference]: Without dead ends: 238 [2022-07-14 13:56:48,216 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-14 13:56:48,217 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 122 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 485 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-14 13:56:48,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 485 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-14 13:56:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 208. [2022-07-14 13:56:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 195 states have internal predecessors, (280), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 295 transitions. [2022-07-14 13:56:48,240 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 295 transitions. Word has length 16 [2022-07-14 13:56:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:48,241 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 295 transitions. [2022-07-14 13:56:48,241 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-14 13:56:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 295 transitions. [2022-07-14 13:56:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 13:56:48,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:48,243 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:48,263 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-14 13:56:48,459 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-14 13:56:48,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash -864836854, now seen corresponding path program 1 times [2022-07-14 13:56:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:48,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380096502] [2022-07-14 13:56:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:48,490 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-14 13:56:48,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:48,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380096502] [2022-07-14 13:56:48,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380096502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:48,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806528836] [2022-07-14 13:56:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:48,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:48,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:48,492 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-14 13:56:48,493 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-14 13:56:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:48,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:56:48,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:48,564 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-14 13:56:48,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:48,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806528836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:48,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:48,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-14 13:56:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321853521] [2022-07-14 13:56:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:48,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:56:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:56:48,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:56:48,566 INFO L87 Difference]: Start difference. First operand 208 states and 295 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-14 13:56:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:48,620 INFO L93 Difference]: Finished difference Result 260 states and 366 transitions. [2022-07-14 13:56:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:56:48,620 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-14 13:56:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:48,621 INFO L225 Difference]: With dead ends: 260 [2022-07-14 13:56:48,622 INFO L226 Difference]: Without dead ends: 258 [2022-07-14 13:56:48,622 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-14 13:56:48,622 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 26 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:48,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 417 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-14 13:56:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 201. [2022-07-14 13:56:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 171 states have (on average 1.5497076023391814) internal successors, (265), 188 states have internal predecessors, (265), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 280 transitions. [2022-07-14 13:56:48,631 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 280 transitions. Word has length 15 [2022-07-14 13:56:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:48,631 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 280 transitions. [2022-07-14 13:56:48,631 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-14 13:56:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 280 transitions. [2022-07-14 13:56:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 13:56:48,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:48,632 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:48,651 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-14 13:56:48,849 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-14 13:56:48,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash 317482697, now seen corresponding path program 1 times [2022-07-14 13:56:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:48,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670957390] [2022-07-14 13:56:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:48,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:48,893 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-14 13:56:48,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:48,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670957390] [2022-07-14 13:56:48,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670957390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:48,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543518358] [2022-07-14 13:56:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:48,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:48,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:48,895 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-14 13:56:48,898 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-14 13:56:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:48,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 13:56:48,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:48,949 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-14 13:56:48,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:48,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543518358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:48,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:48,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-14 13:56:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112003772] [2022-07-14 13:56:48,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:48,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:48,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:56:48,951 INFO L87 Difference]: Start difference. First operand 201 states and 280 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-14 13:56:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:48,981 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions. [2022-07-14 13:56:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:48,981 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-14 13:56:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:48,982 INFO L225 Difference]: With dead ends: 210 [2022-07-14 13:56:48,983 INFO L226 Difference]: Without dead ends: 209 [2022-07-14 13:56:48,983 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-14 13:56:48,983 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 266 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-14 13:56:48,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 266 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-14 13:56:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2022-07-14 13:56:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 185 states have internal predecessors, (260), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 275 transitions. [2022-07-14 13:56:48,993 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 275 transitions. Word has length 17 [2022-07-14 13:56:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:48,993 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 275 transitions. [2022-07-14 13:56:48,994 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-14 13:56:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 275 transitions. [2022-07-14 13:56:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 13:56:48,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:48,997 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:49,016 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-14 13:56:49,207 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-14 13:56:49,208 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:49,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2139477144, now seen corresponding path program 1 times [2022-07-14 13:56:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:49,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104383730] [2022-07-14 13:56:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,256 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-14 13:56:49,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:49,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104383730] [2022-07-14 13:56:49,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104383730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:49,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861408698] [2022-07-14 13:56:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:49,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:49,264 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-14 13:56:49,265 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-14 13:56:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:56:49,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:49,327 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-14 13:56:49,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:49,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861408698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:49,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:49,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-14 13:56:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113261628] [2022-07-14 13:56:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:49,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:49,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:49,330 INFO L87 Difference]: Start difference. First operand 198 states and 275 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-14 13:56:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:49,394 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2022-07-14 13:56:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:49,394 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-14 13:56:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:49,395 INFO L225 Difference]: With dead ends: 241 [2022-07-14 13:56:49,396 INFO L226 Difference]: Without dead ends: 238 [2022-07-14 13:56:49,396 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-14 13:56:49,396 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 107 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 486 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:49,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 486 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-14 13:56:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2022-07-14 13:56:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 177 states have (on average 1.5310734463276836) internal successors, (271), 193 states have internal predecessors, (271), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 286 transitions. [2022-07-14 13:56:49,407 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 286 transitions. Word has length 18 [2022-07-14 13:56:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:49,407 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 286 transitions. [2022-07-14 13:56:49,407 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-14 13:56:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 286 transitions. [2022-07-14 13:56:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 13:56:49,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:49,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:49,426 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-14 13:56:49,615 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-14 13:56:49,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash 251531834, now seen corresponding path program 1 times [2022-07-14 13:56:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:49,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188552157] [2022-07-14 13:56:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,652 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-14 13:56:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:49,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188552157] [2022-07-14 13:56:49,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188552157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:49,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:49,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440914189] [2022-07-14 13:56:49,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:49,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:56:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:56:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:56:49,655 INFO L87 Difference]: Start difference. First operand 206 states and 286 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-14 13:56:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:49,705 INFO L93 Difference]: Finished difference Result 261 states and 362 transitions. [2022-07-14 13:56:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:56:49,705 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-14 13:56:49,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:49,706 INFO L225 Difference]: With dead ends: 261 [2022-07-14 13:56:49,706 INFO L226 Difference]: Without dead ends: 259 [2022-07-14 13:56:49,707 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-14 13:56:49,709 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 27 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:49,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 287 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-14 13:56:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2022-07-14 13:56:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 193 states have internal predecessors, (269), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 284 transitions. [2022-07-14 13:56:49,723 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 284 transitions. Word has length 19 [2022-07-14 13:56:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:49,724 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 284 transitions. [2022-07-14 13:56:49,724 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-14 13:56:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 284 transitions. [2022-07-14 13:56:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 13:56:49,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:49,724 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-14 13:56:49,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 13:56:49,724 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash -125890422, now seen corresponding path program 1 times [2022-07-14 13:56:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:49,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134426742] [2022-07-14 13:56:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,757 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-14 13:56:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:49,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134426742] [2022-07-14 13:56:49,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134426742] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:49,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797736523] [2022-07-14 13:56:49,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:49,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:49,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:49,758 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-14 13:56:49,759 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-14 13:56:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:49,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:56:49,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:49,823 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-14 13:56:49,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:49,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797736523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:49,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:49,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-14 13:56:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060979145] [2022-07-14 13:56:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:49,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:49,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:49,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:49,825 INFO L87 Difference]: Start difference. First operand 206 states and 284 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-14 13:56:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:49,888 INFO L93 Difference]: Finished difference Result 236 states and 325 transitions. [2022-07-14 13:56:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:49,889 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-14 13:56:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:49,890 INFO L225 Difference]: With dead ends: 236 [2022-07-14 13:56:49,890 INFO L226 Difference]: Without dead ends: 233 [2022-07-14 13:56:49,891 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-14 13:56:49,891 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 112 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:49,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 483 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-14 13:56:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2022-07-14 13:56:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 168 states have (on average 1.4821428571428572) internal successors, (249), 181 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2022-07-14 13:56:49,899 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 23 [2022-07-14 13:56:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:49,899 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2022-07-14 13:56:49,899 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-14 13:56:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2022-07-14 13:56:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 13:56:49,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:49,900 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-14 13:56:49,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-14 13:56:50,119 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-14 13:56:50,120 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:50,120 INFO L85 PathProgramCache]: Analyzing trace with hash 165838642, now seen corresponding path program 1 times [2022-07-14 13:56:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:50,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066412868] [2022-07-14 13:56:50,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,182 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-14 13:56:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:50,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066412868] [2022-07-14 13:56:50,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066412868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:50,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810324182] [2022-07-14 13:56:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:50,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:50,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:50,185 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-14 13:56:50,186 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-14 13:56:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:56:50,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:50,246 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-14 13:56:50,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:50,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810324182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:50,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:50,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-14 13:56:50,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386671406] [2022-07-14 13:56:50,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:50,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:56:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:56:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:50,249 INFO L87 Difference]: Start difference. First operand 194 states and 264 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-14 13:56:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:50,308 INFO L93 Difference]: Finished difference Result 224 states and 304 transitions. [2022-07-14 13:56:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:56:50,308 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-14 13:56:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:50,309 INFO L225 Difference]: With dead ends: 224 [2022-07-14 13:56:50,309 INFO L226 Difference]: Without dead ends: 221 [2022-07-14 13:56:50,309 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-14 13:56:50,310 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 96 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 489 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-14 13:56:50,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 489 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-14 13:56:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 183. [2022-07-14 13:56:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 160 states have (on average 1.4625) internal successors, (234), 170 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-14 13:56:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 249 transitions. [2022-07-14 13:56:50,320 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 249 transitions. Word has length 25 [2022-07-14 13:56:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:50,321 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 249 transitions. [2022-07-14 13:56:50,321 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-14 13:56:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 249 transitions. [2022-07-14 13:56:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 13:56:50,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:50,321 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-14 13:56:50,345 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-14 13:56:50,535 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-14 13:56:50,535 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:50,536 INFO L85 PathProgramCache]: Analyzing trace with hash 340378026, now seen corresponding path program 1 times [2022-07-14 13:56:50,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:50,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073551894] [2022-07-14 13:56:50,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:50,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 13:56:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,612 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-14 13:56:50,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:50,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073551894] [2022-07-14 13:56:50,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073551894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:50,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063399368] [2022-07-14 13:56:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:50,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:50,614 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-14 13:56:50,623 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-14 13:56:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:50,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 13:56:50,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:50,737 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-14 13:56:50,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:50,863 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-14 13:56:50,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063399368] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:50,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:50,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 19 [2022-07-14 13:56:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957873495] [2022-07-14 13:56:50,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:50,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 13:56:50,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 13:56:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-14 13:56:50,866 INFO L87 Difference]: Start difference. First operand 183 states and 249 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-14 13:56:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:51,987 INFO L93 Difference]: Finished difference Result 601 states and 806 transitions. [2022-07-14 13:56:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 13:56:51,988 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-14 13:56:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:51,989 INFO L225 Difference]: With dead ends: 601 [2022-07-14 13:56:51,989 INFO L226 Difference]: Without dead ends: 423 [2022-07-14 13:56:51,990 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-14 13:56:51,991 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 618 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:51,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 631 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 13:56:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-14 13:56:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 155. [2022-07-14 13:56:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4296875) internal successors, (183), 139 states have internal predecessors, (183), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-14 13:56:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2022-07-14 13:56:52,000 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 30 [2022-07-14 13:56:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:52,000 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2022-07-14 13:56:52,000 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-14 13:56:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2022-07-14 13:56:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 13:56:52,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:52,001 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-14 13:56:52,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 13:56:52,213 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-14 13:56:52,213 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -809815083, now seen corresponding path program 1 times [2022-07-14 13:56:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:52,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972351853] [2022-07-14 13:56:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 13:56:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,278 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-14 13:56:52,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:52,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972351853] [2022-07-14 13:56:52,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972351853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:52,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:52,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 13:56:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659426815] [2022-07-14 13:56:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:52,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 13:56:52,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:52,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 13:56:52,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:56:52,280 INFO L87 Difference]: Start difference. First operand 155 states and 203 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-14 13:56:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:52,735 INFO L93 Difference]: Finished difference Result 404 states and 522 transitions. [2022-07-14 13:56:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 13:56:52,735 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-14 13:56:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:52,736 INFO L225 Difference]: With dead ends: 404 [2022-07-14 13:56:52,736 INFO L226 Difference]: Without dead ends: 330 [2022-07-14 13:56:52,737 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-14 13:56:52,737 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 415 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:52,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 501 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 13:56:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-14 13:56:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 166. [2022-07-14 13:56:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 148 states have internal predecessors, (191), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-14 13:56:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2022-07-14 13:56:52,746 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 37 [2022-07-14 13:56:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:52,746 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2022-07-14 13:56:52,746 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-14 13:56:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2022-07-14 13:56:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 13:56:52,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:52,747 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-14 13:56:52,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 13:56:52,747 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:52,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 311287935, now seen corresponding path program 1 times [2022-07-14 13:56:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:52,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841122293] [2022-07-14 13:56:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 13:56:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 13:56:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,820 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-14 13:56:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:52,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841122293] [2022-07-14 13:56:52,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841122293] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:52,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064996327] [2022-07-14 13:56:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:52,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:52,821 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-14 13:56:52,822 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-14 13:56:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:52,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 13:56:52,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:52,975 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-14 13:56:52,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:53,029 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-14 13:56:53,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064996327] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:53,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:53,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-07-14 13:56:53,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682352388] [2022-07-14 13:56:53,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:53,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 13:56:53,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:53,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 13:56:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-14 13:56:53,031 INFO L87 Difference]: Start difference. First operand 166 states and 215 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-14 13:56:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:55,068 INFO L93 Difference]: Finished difference Result 793 states and 1023 transitions. [2022-07-14 13:56:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 13:56:55,069 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-14 13:56:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:55,071 INFO L225 Difference]: With dead ends: 793 [2022-07-14 13:56:55,071 INFO L226 Difference]: Without dead ends: 704 [2022-07-14 13:56:55,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2022-07-14 13:56:55,073 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 1733 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 3847 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 4044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 3847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:55,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 359 Invalid, 4044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 3847 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-14 13:56:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-07-14 13:56:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 153. [2022-07-14 13:56:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 138 states have internal predecessors, (179), 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-14 13:56:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2022-07-14 13:56:55,092 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 41 [2022-07-14 13:56:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:55,093 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2022-07-14 13:56:55,093 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-14 13:56:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-07-14 13:56:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 13:56:55,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:55,094 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-14 13:56:55,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 13:56:55,313 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-14 13:56:55,313 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1966221434, now seen corresponding path program 2 times [2022-07-14 13:56:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:55,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404985697] [2022-07-14 13:56:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:55,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:55,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:55,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 13:56:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:55,460 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-14 13:56:55,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:55,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404985697] [2022-07-14 13:56:55,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404985697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:55,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:55,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 13:56:55,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032311930] [2022-07-14 13:56:55,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:55,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 13:56:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:55,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 13:56:55,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:56:55,462 INFO L87 Difference]: Start difference. First operand 153 states and 197 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-14 13:56:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:56,194 INFO L93 Difference]: Finished difference Result 480 states and 620 transitions. [2022-07-14 13:56:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 13:56:56,195 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-14 13:56:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:56,196 INFO L225 Difference]: With dead ends: 480 [2022-07-14 13:56:56,196 INFO L226 Difference]: Without dead ends: 410 [2022-07-14 13:56:56,197 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-14 13:56:56,197 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 635 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:56,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 666 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 13:56:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-14 13:56:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 227. [2022-07-14 13:56:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.4102564102564104) internal successors, (275), 207 states have internal predecessors, (275), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-14 13:56:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 302 transitions. [2022-07-14 13:56:56,209 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 302 transitions. Word has length 41 [2022-07-14 13:56:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:56,210 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 302 transitions. [2022-07-14 13:56:56,210 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-14 13:56:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 302 transitions. [2022-07-14 13:56:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 13:56:56,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:56,211 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-14 13:56:56,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 13:56:56,211 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1519399236, now seen corresponding path program 1 times [2022-07-14 13:56:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:56,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512562613] [2022-07-14 13:56:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:56,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 13:56:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:56,314 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-14 13:56:56,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:56,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512562613] [2022-07-14 13:56:56,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512562613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:56,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433007724] [2022-07-14 13:56:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:56,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:56,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:56,316 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-14 13:56:56,317 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-14 13:56:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:56,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 13:56:56,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:56,412 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-14 13:56:56,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:56,549 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-14 13:56:56,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433007724] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:56,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:56,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-07-14 13:56:56,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601022277] [2022-07-14 13:56:56,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:56,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 13:56:56,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 13:56:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-07-14 13:56:56,551 INFO L87 Difference]: Start difference. First operand 227 states and 302 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-14 13:56:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:57,368 INFO L93 Difference]: Finished difference Result 624 states and 842 transitions. [2022-07-14 13:56:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 13:56:57,368 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-14 13:56:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:57,370 INFO L225 Difference]: With dead ends: 624 [2022-07-14 13:56:57,370 INFO L226 Difference]: Without dead ends: 492 [2022-07-14 13:56:57,370 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-14 13:56:57,371 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 526 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:57,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 677 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 13:56:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-07-14 13:56:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 338. [2022-07-14 13:56:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 294 states have (on average 1.4081632653061225) internal successors, (414), 307 states have internal predecessors, (414), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2022-07-14 13:56:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 462 transitions. [2022-07-14 13:56:57,387 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 462 transitions. Word has length 41 [2022-07-14 13:56:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:57,388 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 462 transitions. [2022-07-14 13:56:57,388 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-14 13:56:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 462 transitions. [2022-07-14 13:56:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 13:56:57,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:57,389 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-14 13:56:57,408 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-14 13:56:57,599 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-14 13:56:57,599 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash -440801234, now seen corresponding path program 1 times [2022-07-14 13:56:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:57,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671687605] [2022-07-14 13:56:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:57,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:57,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:57,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 13:56:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:56:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:57,689 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-14 13:56:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671687605] [2022-07-14 13:56:57,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671687605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478045644] [2022-07-14 13:56:57,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:57,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:57,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:57,692 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-14 13:56:57,720 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-14 13:56:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:57,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 13:56:57,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:57,806 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-14 13:56:57,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:57,928 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-14 13:56:57,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478045644] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:57,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:56:57,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 20 [2022-07-14 13:56:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530148727] [2022-07-14 13:56:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:57,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 13:56:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 13:56:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-14 13:56:57,930 INFO L87 Difference]: Start difference. First operand 338 states and 462 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-14 13:56:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:58,106 INFO L93 Difference]: Finished difference Result 695 states and 959 transitions. [2022-07-14 13:56:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 13:56:58,107 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-14 13:56:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:58,109 INFO L225 Difference]: With dead ends: 695 [2022-07-14 13:56:58,109 INFO L226 Difference]: Without dead ends: 607 [2022-07-14 13:56:58,110 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-14 13:56:58,110 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 174 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:58,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1769 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-07-14 13:56:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 327. [2022-07-14 13:56:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 286 states have (on average 1.4125874125874125) internal successors, (404), 298 states have internal predecessors, (404), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-07-14 13:56:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 448 transitions. [2022-07-14 13:56:58,134 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 448 transitions. Word has length 45 [2022-07-14 13:56:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:58,134 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 448 transitions. [2022-07-14 13:56:58,134 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-14 13:56:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 448 transitions. [2022-07-14 13:56:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 13:56:58,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:58,135 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-14 13:56:58,158 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-14 13:56:58,347 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-14 13:56:58,347 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:58,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1658343875, now seen corresponding path program 1 times [2022-07-14 13:56:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:58,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654860849] [2022-07-14 13:56:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 13:56:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,378 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-14 13:56:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:58,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654860849] [2022-07-14 13:56:58,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654860849] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:58,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443790352] [2022-07-14 13:56:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:58,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:58,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:58,380 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-14 13:56:58,381 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-14 13:56:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 13:56:58,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:58,434 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-14 13:56:58,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:56:58,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443790352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:58,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:56:58,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-07-14 13:56:58,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365356016] [2022-07-14 13:56:58,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:58,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:58,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:56:58,436 INFO L87 Difference]: Start difference. First operand 327 states and 448 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-14 13:56:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:58,474 INFO L93 Difference]: Finished difference Result 586 states and 804 transitions. [2022-07-14 13:56:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:58,474 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-14 13:56:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:58,476 INFO L225 Difference]: With dead ends: 586 [2022-07-14 13:56:58,476 INFO L226 Difference]: Without dead ends: 351 [2022-07-14 13:56:58,477 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-14 13:56:58,477 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 246 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-14 13:56:58,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 246 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-14 13:56:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 337. [2022-07-14 13:56:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 308 states have internal predecessors, (414), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-07-14 13:56:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 458 transitions. [2022-07-14 13:56:58,493 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 458 transitions. Word has length 47 [2022-07-14 13:56:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:58,493 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 458 transitions. [2022-07-14 13:56:58,493 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-14 13:56:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 458 transitions. [2022-07-14 13:56:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 13:56:58,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:58,494 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-14 13:56:58,513 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-14 13:56:58,708 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-14 13:56:58,709 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:56:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash -836152950, now seen corresponding path program 1 times [2022-07-14 13:56:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:58,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553248001] [2022-07-14 13:56:58,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:56:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:56:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:56:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,791 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-14 13:56:58,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:58,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553248001] [2022-07-14 13:56:58,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553248001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:58,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656755751] [2022-07-14 13:56:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:58,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:58,793 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-14 13:56:58,794 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-14 13:56:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:58,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 13:56:58,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:58,887 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-14 13:56:58,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:58,952 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-14 13:56:58,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656755751] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:58,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:58,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-14 13:56:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215223342] [2022-07-14 13:56:58,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:58,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 13:56:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:58,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 13:56:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:56:58,954 INFO L87 Difference]: Start difference. First operand 337 states and 458 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-14 13:57:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:00,005 INFO L93 Difference]: Finished difference Result 1032 states and 1414 transitions. [2022-07-14 13:57:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 13:57:00,006 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-14 13:57:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:00,009 INFO L225 Difference]: With dead ends: 1032 [2022-07-14 13:57:00,009 INFO L226 Difference]: Without dead ends: 919 [2022-07-14 13:57:00,010 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-14 13:57:00,010 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 395 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:00,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 805 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 13:57:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-07-14 13:57:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 475. [2022-07-14 13:57:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 422 states have (on average 1.4099526066350712) internal successors, (595), 435 states have internal predecessors, (595), 30 states have call successors, (30), 10 states have call predecessors, (30), 13 states have return successors, (34), 29 states have call predecessors, (34), 29 states have call successors, (34) [2022-07-14 13:57:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 659 transitions. [2022-07-14 13:57:00,039 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 659 transitions. Word has length 48 [2022-07-14 13:57:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:00,040 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 659 transitions. [2022-07-14 13:57:00,040 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-14 13:57:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 659 transitions. [2022-07-14 13:57:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 13:57:00,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:00,041 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-14 13:57:00,060 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-14 13:57:00,246 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-14 13:57:00,246 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash -836151028, now seen corresponding path program 1 times [2022-07-14 13:57:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:00,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286911899] [2022-07-14 13:57:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:00,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:00,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:00,318 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-14 13:57:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:00,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286911899] [2022-07-14 13:57:00,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286911899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:00,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100504623] [2022-07-14 13:57:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:00,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:00,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:00,320 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-14 13:57:00,322 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-14 13:57:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:00,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 13:57:00,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:00,458 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-14 13:57:00,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:00,592 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-14 13:57:00,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100504623] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:00,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:00,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-14 13:57:00,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95559509] [2022-07-14 13:57:00,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:00,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 13:57:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 13:57:00,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-14 13:57:00,594 INFO L87 Difference]: Start difference. First operand 475 states and 659 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-14 13:57:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:01,675 INFO L93 Difference]: Finished difference Result 1166 states and 1621 transitions. [2022-07-14 13:57:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 13:57:01,676 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-14 13:57:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:01,679 INFO L225 Difference]: With dead ends: 1166 [2022-07-14 13:57:01,679 INFO L226 Difference]: Without dead ends: 959 [2022-07-14 13:57:01,680 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-14 13:57:01,680 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 657 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:01,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 412 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 13:57:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-14 13:57:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 605. [2022-07-14 13:57:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 540 states have (on average 1.4166666666666667) internal successors, (765), 554 states have internal predecessors, (765), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-07-14 13:57:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 849 transitions. [2022-07-14 13:57:01,708 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 849 transitions. Word has length 48 [2022-07-14 13:57:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:01,708 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 849 transitions. [2022-07-14 13:57:01,709 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-14 13:57:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 849 transitions. [2022-07-14 13:57:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 13:57:01,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:01,710 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-14 13:57:01,728 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-14 13:57:01,911 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-14 13:57:01,912 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:01,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:01,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2123358745, now seen corresponding path program 1 times [2022-07-14 13:57:01,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:01,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146695931] [2022-07-14 13:57:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:01,985 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-14 13:57:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:01,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146695931] [2022-07-14 13:57:01,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146695931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:01,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444062275] [2022-07-14 13:57:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:01,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:01,987 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-14 13:57:01,988 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-14 13:57:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:57:02,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:02,056 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-14 13:57:02,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:57:02,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444062275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:02,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:57:02,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-14 13:57:02,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377664667] [2022-07-14 13:57:02,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:02,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:57:02,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:02,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:57:02,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:57:02,058 INFO L87 Difference]: Start difference. First operand 605 states and 849 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-14 13:57:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:02,130 INFO L93 Difference]: Finished difference Result 1197 states and 1698 transitions. [2022-07-14 13:57:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:57:02,131 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-14 13:57:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:02,133 INFO L225 Difference]: With dead ends: 1197 [2022-07-14 13:57:02,133 INFO L226 Difference]: Without dead ends: 681 [2022-07-14 13:57:02,134 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-14 13:57:02,135 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 50 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 259 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-14 13:57:02,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 259 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-07-14 13:57:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 631. [2022-07-14 13:57:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 566 states have (on average 1.4081272084805654) internal successors, (797), 580 states have internal predecessors, (797), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-07-14 13:57:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 881 transitions. [2022-07-14 13:57:02,161 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 881 transitions. Word has length 48 [2022-07-14 13:57:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:02,161 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 881 transitions. [2022-07-14 13:57:02,161 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-14 13:57:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 881 transitions. [2022-07-14 13:57:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 13:57:02,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:02,162 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-14 13:57:02,179 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-14 13:57:02,379 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-14 13:57:02,380 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash -343040408, now seen corresponding path program 1 times [2022-07-14 13:57:02,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:02,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363505332] [2022-07-14 13:57:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:02,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 13:57:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,414 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-14 13:57:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363505332] [2022-07-14 13:57:02,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363505332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204669502] [2022-07-14 13:57:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:02,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:02,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:02,416 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-14 13:57:02,417 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-14 13:57:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:57:02,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:02,472 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-14 13:57:02,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:57:02,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204669502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:02,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:57:02,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-14 13:57:02,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694177691] [2022-07-14 13:57:02,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:02,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:57:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:02,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:57:02,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:57:02,474 INFO L87 Difference]: Start difference. First operand 631 states and 881 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-14 13:57:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:02,533 INFO L93 Difference]: Finished difference Result 1025 states and 1440 transitions. [2022-07-14 13:57:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:57:02,533 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-14 13:57:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:02,535 INFO L225 Difference]: With dead ends: 1025 [2022-07-14 13:57:02,535 INFO L226 Difference]: Without dead ends: 653 [2022-07-14 13:57:02,536 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-14 13:57:02,537 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 15 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 378 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-14 13:57:02,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 378 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:02,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-07-14 13:57:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 633. [2022-07-14 13:57:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 568 states have (on average 1.4102112676056338) internal successors, (801), 582 states have internal predecessors, (801), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-07-14 13:57:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 885 transitions. [2022-07-14 13:57:02,574 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 885 transitions. Word has length 49 [2022-07-14 13:57:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:02,575 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 885 transitions. [2022-07-14 13:57:02,575 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-14 13:57:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 885 transitions. [2022-07-14 13:57:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 13:57:02,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:02,576 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-14 13:57:02,615 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-14 13:57:02,779 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-14 13:57:02,779 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:02,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1723318001, now seen corresponding path program 1 times [2022-07-14 13:57:02,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:02,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513970620] [2022-07-14 13:57:02,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:02,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 13:57:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:02,969 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-14 13:57:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:02,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513970620] [2022-07-14 13:57:02,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513970620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:02,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:02,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 13:57:02,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33944086] [2022-07-14 13:57:02,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:02,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 13:57:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 13:57:02,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-14 13:57:02,973 INFO L87 Difference]: Start difference. First operand 633 states and 885 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-14 13:57:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:04,053 INFO L93 Difference]: Finished difference Result 1068 states and 1499 transitions. [2022-07-14 13:57:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 13:57:04,053 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-14 13:57:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:04,056 INFO L225 Difference]: With dead ends: 1068 [2022-07-14 13:57:04,056 INFO L226 Difference]: Without dead ends: 1067 [2022-07-14 13:57:04,057 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-14 13:57:04,057 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 650 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:04,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 580 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 13:57:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-07-14 13:57:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 629. [2022-07-14 13:57:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 578 states have internal predecessors, (795), 39 states have call successors, (39), 12 states have call predecessors, (39), 16 states have return successors, (45), 38 states have call predecessors, (45), 38 states have call successors, (45) [2022-07-14 13:57:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 879 transitions. [2022-07-14 13:57:04,090 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 879 transitions. Word has length 50 [2022-07-14 13:57:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:04,090 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 879 transitions. [2022-07-14 13:57:04,090 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-14 13:57:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 879 transitions. [2022-07-14 13:57:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 13:57:04,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:04,091 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-14 13:57:04,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 13:57:04,092 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:04,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1460160345, now seen corresponding path program 1 times [2022-07-14 13:57:04,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:04,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424020091] [2022-07-14 13:57:04,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:04,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:04,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 13:57:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 13:57:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:04,216 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-14 13:57:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:04,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424020091] [2022-07-14 13:57:04,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424020091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:04,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103465196] [2022-07-14 13:57:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:04,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:04,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:04,218 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-14 13:57:04,256 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-14 13:57:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:04,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 13:57:04,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:04,370 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-14 13:57:04,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:04,435 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-14 13:57:04,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103465196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:04,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:04,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-14 13:57:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504462338] [2022-07-14 13:57:04,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:04,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 13:57:04,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 13:57:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-07-14 13:57:04,437 INFO L87 Difference]: Start difference. First operand 629 states and 879 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-14 13:57:09,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:09,279 INFO L93 Difference]: Finished difference Result 3384 states and 4915 transitions. [2022-07-14 13:57:09,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-14 13:57:09,287 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-14 13:57:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:09,295 INFO L225 Difference]: With dead ends: 3384 [2022-07-14 13:57:09,295 INFO L226 Difference]: Without dead ends: 2998 [2022-07-14 13:57:09,297 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-14 13:57:09,297 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 2472 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 8028 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 8455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 8028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:09,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2472 Valid, 675 Invalid, 8455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 8028 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-14 13:57:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-07-14 13:57:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 685. [2022-07-14 13:57:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 616 states have (on average 1.400974025974026) internal successors, (863), 629 states have internal predecessors, (863), 43 states have call successors, (43), 13 states have call predecessors, (43), 16 states have return successors, (48), 42 states have call predecessors, (48), 41 states have call successors, (48) [2022-07-14 13:57:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 954 transitions. [2022-07-14 13:57:09,343 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 954 transitions. Word has length 56 [2022-07-14 13:57:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:09,343 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 954 transitions. [2022-07-14 13:57:09,343 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-14 13:57:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 954 transitions. [2022-07-14 13:57:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 13:57:09,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:09,345 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-14 13:57:09,361 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-14 13:57:09,559 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-14 13:57:09,559 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1529476761, now seen corresponding path program 1 times [2022-07-14 13:57:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:09,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850218782] [2022-07-14 13:57:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:09,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 13:57:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:09,658 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-14 13:57:09,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:09,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850218782] [2022-07-14 13:57:09,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850218782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:09,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20619272] [2022-07-14 13:57:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:09,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:09,661 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-14 13:57:09,695 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-14 13:57:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:09,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 13:57:09,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:09,758 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-14 13:57:09,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:09,825 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-14 13:57:09,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20619272] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:09,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:09,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 13 [2022-07-14 13:57:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264286655] [2022-07-14 13:57:09,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:09,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 13:57:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 13:57:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-14 13:57:09,827 INFO L87 Difference]: Start difference. First operand 685 states and 954 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-14 13:57:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:12,235 INFO L93 Difference]: Finished difference Result 2890 states and 4178 transitions. [2022-07-14 13:57:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 13:57:12,235 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-14 13:57:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:12,243 INFO L225 Difference]: With dead ends: 2890 [2022-07-14 13:57:12,243 INFO L226 Difference]: Without dead ends: 2755 [2022-07-14 13:57:12,244 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-14 13:57:12,244 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 744 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4867 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 5042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 4867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:12,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 632 Invalid, 5042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 4867 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 13:57:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2022-07-14 13:57:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 708. [2022-07-14 13:57:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 638 states have (on average 1.396551724137931) internal successors, (891), 650 states have internal predecessors, (891), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 41 states have call successors, (48) [2022-07-14 13:57:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 983 transitions. [2022-07-14 13:57:12,290 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 983 transitions. Word has length 56 [2022-07-14 13:57:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:12,291 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 983 transitions. [2022-07-14 13:57:12,291 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-14 13:57:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 983 transitions. [2022-07-14 13:57:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 13:57:12,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:12,296 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-14 13:57:12,315 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-14 13:57:12,502 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-14 13:57:12,502 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1529474839, now seen corresponding path program 1 times [2022-07-14 13:57:12,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:12,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662729593] [2022-07-14 13:57:12,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:12,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:12,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 13:57:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:12,587 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-14 13:57:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:12,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662729593] [2022-07-14 13:57:12,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662729593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:12,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596850378] [2022-07-14 13:57:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:12,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:12,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:12,595 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:57:12,597 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-14 13:57:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:12,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 13:57:12,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:12,767 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-14 13:57:12,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:12,916 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-14 13:57:12,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596850378] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:12,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:12,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2022-07-14 13:57:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15719635] [2022-07-14 13:57:12,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:12,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 13:57:12,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:12,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 13:57:12,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-14 13:57:12,918 INFO L87 Difference]: Start difference. First operand 708 states and 983 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-14 13:57:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:15,488 INFO L93 Difference]: Finished difference Result 2445 states and 3441 transitions. [2022-07-14 13:57:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 13:57:15,489 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-14 13:57:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:15,495 INFO L225 Difference]: With dead ends: 2445 [2022-07-14 13:57:15,495 INFO L226 Difference]: Without dead ends: 2314 [2022-07-14 13:57:15,496 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-14 13:57:15,496 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 1310 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4800 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 5038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 4800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:15,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 435 Invalid, 5038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 4800 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 13:57:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2022-07-14 13:57:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 724. [2022-07-14 13:57:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 653 states have (on average 1.3935681470137826) internal successors, (910), 664 states have internal predecessors, (910), 45 states have call successors, (45), 15 states have call predecessors, (45), 16 states have return successors, (48), 44 states have call predecessors, (48), 41 states have call successors, (48) [2022-07-14 13:57:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1003 transitions. [2022-07-14 13:57:15,538 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1003 transitions. Word has length 56 [2022-07-14 13:57:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:15,539 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 1003 transitions. [2022-07-14 13:57:15,539 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-14 13:57:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1003 transitions. [2022-07-14 13:57:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 13:57:15,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:15,540 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-14 13:57:15,558 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-14 13:57:15,758 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-14 13:57:15,759 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:15,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1956143909, now seen corresponding path program 2 times [2022-07-14 13:57:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:15,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349234773] [2022-07-14 13:57:15,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:15,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:15,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 13:57:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:15,888 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-14 13:57:15,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:15,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349234773] [2022-07-14 13:57:15,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349234773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:15,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274197267] [2022-07-14 13:57:15,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:57:15,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:15,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:15,890 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-14 13:57:15,909 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-14 13:57:15,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:57:15,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:57:15,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 13:57:15,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:16,030 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-14 13:57:16,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:16,130 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-14 13:57:16,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274197267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:16,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2022-07-14 13:57:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267649771] [2022-07-14 13:57:16,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 13:57:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 13:57:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-14 13:57:16,132 INFO L87 Difference]: Start difference. First operand 724 states and 1003 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-14 13:57:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:20,157 INFO L93 Difference]: Finished difference Result 2693 states and 3787 transitions. [2022-07-14 13:57:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 13:57:20,157 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-14 13:57:20,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:20,169 INFO L225 Difference]: With dead ends: 2693 [2022-07-14 13:57:20,169 INFO L226 Difference]: Without dead ends: 2323 [2022-07-14 13:57:20,171 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-14 13:57:20,171 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 1539 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7593 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 7881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 7593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:20,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 660 Invalid, 7881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 7593 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 13:57:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2022-07-14 13:57:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 736. [2022-07-14 13:57:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 662 states have (on average 1.3791540785498488) internal successors, (913), 670 states have internal predecessors, (913), 48 states have call successors, (48), 18 states have call predecessors, (48), 16 states have return successors, (48), 47 states have call predecessors, (48), 41 states have call successors, (48) [2022-07-14 13:57:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1009 transitions. [2022-07-14 13:57:20,221 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1009 transitions. Word has length 56 [2022-07-14 13:57:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:20,222 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1009 transitions. [2022-07-14 13:57:20,222 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-14 13:57:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1009 transitions. [2022-07-14 13:57:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 13:57:20,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:20,223 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-14 13:57:20,249 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-14 13:57:20,435 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-14 13:57:20,435 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:20,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash -571398184, now seen corresponding path program 1 times [2022-07-14 13:57:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:20,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101280605] [2022-07-14 13:57:20,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:20,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:20,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:20,456 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-14 13:57:20,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:20,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101280605] [2022-07-14 13:57:20,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101280605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:20,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:20,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:57:20,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160534404] [2022-07-14 13:57:20,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:20,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:57:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:57:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:57:20,458 INFO L87 Difference]: Start difference. First operand 736 states and 1009 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-14 13:57:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:20,573 INFO L93 Difference]: Finished difference Result 1121 states and 1522 transitions. [2022-07-14 13:57:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:57:20,573 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-14 13:57:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:20,575 INFO L225 Difference]: With dead ends: 1121 [2022-07-14 13:57:20,575 INFO L226 Difference]: Without dead ends: 866 [2022-07-14 13:57:20,577 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-14 13:57:20,577 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 147 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:20,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 209 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:57:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-07-14 13:57:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 766. [2022-07-14 13:57:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 692 states have (on average 1.3872832369942196) internal successors, (960), 700 states have internal predecessors, (960), 48 states have call successors, (48), 18 states have call predecessors, (48), 16 states have return successors, (48), 47 states have call predecessors, (48), 41 states have call successors, (48) [2022-07-14 13:57:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1056 transitions. [2022-07-14 13:57:20,623 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1056 transitions. Word has length 55 [2022-07-14 13:57:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:20,624 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1056 transitions. [2022-07-14 13:57:20,624 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-14 13:57:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1056 transitions. [2022-07-14 13:57:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 13:57:20,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:20,625 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-14 13:57:20,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 13:57:20,625 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1837019720, now seen corresponding path program 1 times [2022-07-14 13:57:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021597630] [2022-07-14 13:57:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:20,687 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-14 13:57:20,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:20,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021597630] [2022-07-14 13:57:20,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021597630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:20,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:20,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 13:57:20,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862794262] [2022-07-14 13:57:20,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:20,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 13:57:20,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:20,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 13:57:20,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-14 13:57:20,689 INFO L87 Difference]: Start difference. First operand 766 states and 1056 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-14 13:57:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:21,961 INFO L93 Difference]: Finished difference Result 2285 states and 3327 transitions. [2022-07-14 13:57:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 13:57:21,961 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-14 13:57:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:21,967 INFO L225 Difference]: With dead ends: 2285 [2022-07-14 13:57:21,967 INFO L226 Difference]: Without dead ends: 2053 [2022-07-14 13:57:21,968 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-14 13:57:21,968 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 434 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:21,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 888 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-14 13:57:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2022-07-14 13:57:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 951. [2022-07-14 13:57:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 861 states have (on average 1.40534262485482) internal successors, (1210), 870 states have internal predecessors, (1210), 60 states have call successors, (60), 21 states have call predecessors, (60), 20 states have return successors, (64), 59 states have call predecessors, (64), 53 states have call successors, (64) [2022-07-14 13:57:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1334 transitions. [2022-07-14 13:57:22,049 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1334 transitions. Word has length 55 [2022-07-14 13:57:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:22,049 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1334 transitions. [2022-07-14 13:57:22,050 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-14 13:57:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1334 transitions. [2022-07-14 13:57:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 13:57:22,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:22,051 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-14 13:57:22,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 13:57:22,051 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1837021642, now seen corresponding path program 1 times [2022-07-14 13:57:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:22,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574618537] [2022-07-14 13:57:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:22,107 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-14 13:57:22,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:22,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574618537] [2022-07-14 13:57:22,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574618537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:22,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:22,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 13:57:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750268501] [2022-07-14 13:57:22,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:22,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 13:57:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 13:57:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:57:22,109 INFO L87 Difference]: Start difference. First operand 951 states and 1334 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-14 13:57:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:22,856 INFO L93 Difference]: Finished difference Result 2622 states and 3839 transitions. [2022-07-14 13:57:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 13:57:22,856 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-14 13:57:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:22,862 INFO L225 Difference]: With dead ends: 2622 [2022-07-14 13:57:22,862 INFO L226 Difference]: Without dead ends: 2158 [2022-07-14 13:57:22,863 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-14 13:57:22,864 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 886 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:22,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 545 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 13:57:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2022-07-14 13:57:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1146. [2022-07-14 13:57:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1040 states have (on average 1.4134615384615385) internal successors, (1470), 1050 states have internal predecessors, (1470), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (79), 71 states have call predecessors, (79), 65 states have call successors, (79) [2022-07-14 13:57:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1621 transitions. [2022-07-14 13:57:22,942 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1621 transitions. Word has length 55 [2022-07-14 13:57:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:22,942 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1621 transitions. [2022-07-14 13:57:22,942 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-14 13:57:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1621 transitions. [2022-07-14 13:57:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 13:57:22,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:22,943 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-14 13:57:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 13:57:22,944 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -474152029, now seen corresponding path program 1 times [2022-07-14 13:57:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:22,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120003043] [2022-07-14 13:57:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:23,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 13:57:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:23,036 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-14 13:57:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:23,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120003043] [2022-07-14 13:57:23,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120003043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:23,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526775945] [2022-07-14 13:57:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:23,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:23,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:23,038 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-14 13:57:23,049 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-14 13:57:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:23,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 13:57:23,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:23,170 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-14 13:57:23,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:23,318 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-14 13:57:23,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526775945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:23,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:23,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 22 [2022-07-14 13:57:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180958581] [2022-07-14 13:57:23,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:23,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 13:57:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:23,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 13:57:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-07-14 13:57:23,320 INFO L87 Difference]: Start difference. First operand 1146 states and 1621 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-14 13:57:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:24,327 INFO L93 Difference]: Finished difference Result 1353 states and 1874 transitions. [2022-07-14 13:57:24,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 13:57:24,328 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-14 13:57:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:24,340 INFO L225 Difference]: With dead ends: 1353 [2022-07-14 13:57:24,340 INFO L226 Difference]: Without dead ends: 1096 [2022-07-14 13:57:24,341 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-14 13:57:24,342 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 214 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:24,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 752 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 13:57:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-07-14 13:57:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 959. [2022-07-14 13:57:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 871 states have (on average 1.401836969001148) internal successors, (1221), 881 states have internal predecessors, (1221), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (63), 57 states have call predecessors, (63), 52 states have call successors, (63) [2022-07-14 13:57:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1342 transitions. [2022-07-14 13:57:24,395 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1342 transitions. Word has length 57 [2022-07-14 13:57:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:24,395 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 1342 transitions. [2022-07-14 13:57:24,395 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-14 13:57:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1342 transitions. [2022-07-14 13:57:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 13:57:24,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:24,397 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-14 13:57:24,416 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-14 13:57:24,607 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-14 13:57:24,607 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2059170591, now seen corresponding path program 1 times [2022-07-14 13:57:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:24,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692491507] [2022-07-14 13:57:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 13:57:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:24,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 13:57:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:24,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 13:57:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:24,704 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-14 13:57:24,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:24,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692491507] [2022-07-14 13:57:24,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692491507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:24,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:24,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 13:57:24,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442579957] [2022-07-14 13:57:24,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:24,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 13:57:24,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:24,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 13:57:24,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:57:24,706 INFO L87 Difference]: Start difference. First operand 959 states and 1342 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-14 13:57:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:25,204 INFO L93 Difference]: Finished difference Result 1256 states and 1731 transitions. [2022-07-14 13:57:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 13:57:25,204 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-14 13:57:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:25,207 INFO L225 Difference]: With dead ends: 1256 [2022-07-14 13:57:25,207 INFO L226 Difference]: Without dead ends: 914 [2022-07-14 13:57:25,208 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-14 13:57:25,208 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 158 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:25,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 561 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:57:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2022-07-14 13:57:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 835. [2022-07-14 13:57:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 758 states have (on average 1.391820580474934) internal successors, (1055), 767 states have internal predecessors, (1055), 50 states have call successors, (50), 18 states have call predecessors, (50), 17 states have return successors, (52), 49 states have call predecessors, (52), 44 states have call successors, (52) [2022-07-14 13:57:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1157 transitions. [2022-07-14 13:57:25,253 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1157 transitions. Word has length 57 [2022-07-14 13:57:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:25,253 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1157 transitions. [2022-07-14 13:57:25,253 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-14 13:57:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1157 transitions. [2022-07-14 13:57:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 13:57:25,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:25,254 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-14 13:57:25,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 13:57:25,255 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-14 13:57:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash 891468222, now seen corresponding path program 1 times [2022-07-14 13:57:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:25,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037140161] [2022-07-14 13:57:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 13:57:25,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 13:57:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 13:57:25,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 13:57:25,307 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 13:57:25,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2022-07-14 13:57:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2022-07-14 13:57:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2022-07-14 13:57:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2022-07-14 13:57:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2022-07-14 13:57:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2022-07-14 13:57:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2022-07-14 13:57:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2022-07-14 13:57:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2022-07-14 13:57:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2022-07-14 13:57:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2022-07-14 13:57:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2022-07-14 13:57:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2022-07-14 13:57:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2022-07-14 13:57:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2022-07-14 13:57:25,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2022-07-14 13:57:25,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2022-07-14 13:57:25,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2022-07-14 13:57:25,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2022-07-14 13:57:25,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2022-07-14 13:57:25,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-14 13:57:25,313 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-14 13:57:25,316 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 13:57:25,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 01:57:25 BoogieIcfgContainer [2022-07-14 13:57:25,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 13:57:25,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 13:57:25,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 13:57:25,374 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 13:57:25,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:46" (3/4) ... [2022-07-14 13:57:25,377 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 13:57:25,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 13:57:25,377 INFO L158 Benchmark]: Toolchain (without parser) took 39149.21ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 84.6MB in the beginning and 86.4MB in the end (delta: -1.8MB). Peak memory consumption was 127.7MB. Max. memory is 16.1GB. [2022-07-14 13:57:25,377 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 59.9MB in the beginning and 59.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:57:25,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.07ms. Allocated memory is still 104.9MB. Free memory was 84.4MB in the beginning and 73.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-07-14 13:57:25,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.65ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 71.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 13:57:25,380 INFO L158 Benchmark]: Boogie Preprocessor took 27.46ms. Allocated memory is still 104.9MB. Free memory was 71.4MB in the beginning and 69.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 13:57:25,383 INFO L158 Benchmark]: RCFGBuilder took 470.98ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 65.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 13:57:25,384 INFO L158 Benchmark]: TraceAbstraction took 38385.47ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 65.9MB in the beginning and 86.4MB in the end (delta: -20.5MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. [2022-07-14 13:57:25,384 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 234.9MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:57:25,386 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.15ms. Allocated memory is still 86.0MB. Free memory was 59.9MB in the beginning and 59.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.07ms. Allocated memory is still 104.9MB. Free memory was 84.4MB in the beginning and 73.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.65ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 71.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.46ms. Allocated memory is still 104.9MB. Free memory was 71.4MB in the beginning and 69.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.98ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 65.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38385.47ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 65.9MB in the beginning and 86.4MB in the end (delta: -20.5MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 234.9MB. Free memory is still 86.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: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-1, eb=-127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L29] COND FALSE !(! m) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L57] COND TRUE 1 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L77] EXPR e + 128 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L77] EXPR e + 128 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447618] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L78] __retres4 = res VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, __retres4=2147483646, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L80] return (__retres4); VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447618, \result=2147483646, __retres4=2147483646, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=2147483646, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L78] __retres4 = res VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, __retres4=2147483647, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, \result=36028799166447615, __retres4=2147483647, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L243] RET, EXPR base2flt(mb, eb) VAL [a=2147483646, base2flt(mb, eb)=36028799166447615, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=16777216, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=2147483646, \old(b)=2147483647, \old(ma = a & ((1U << 24U) - 1U))=36028799166447620, \old(ma = ma & ((1U << 24U) - 1U))=36028799166447621, \old(ma = ma | (1U << 24U))=36028799166447619, \old(mb = b & ((1U << 24U) - 1U))=36028799166447617, \old(mb = mb | (1U << 24U))=36028799166447623, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799166447622, m = m & ~ (1U << 24U)=36028799166447616, ma = a & ((1U << 24U) - 1U)=36028799166447620, ma = ma & ((1U << 24U) - 1U)=36028799166447621, ma = ma | (1U << 24U)=36028799166447619, mb = b & ((1U << 24U) - 1U)=36028799166447617, mb = mb | (1U << 24U)=36028799166447623, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799166447622] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=2147483646, \old(b)=2147483647, \old(ma = a & ((1U << 24U) - 1U))=36028799166447620, \old(ma = ma & ((1U << 24U) - 1U))=36028799166447621, \old(ma = ma | (1U << 24U))=36028799166447619, \old(mb = b & ((1U << 24U) - 1U))=36028799166447617, \old(mb = mb | (1U << 24U))=36028799166447623, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799166447622, a=2147483646, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, ma = a & ((1U << 24U) - 1U)=36028799166447620, ma = ma & ((1U << 24U) - 1U)=36028799166447621, ma = ma | (1U << 24U)=36028799166447619, mb = b & ((1U << 24U) - 1U)=36028799166447617, mb = mb | (1U << 24U)=36028799166447623, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799166447622] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=2147483646, \old(b)=2147483647, \old(ma = a & ((1U << 24U) - 1U))=36028799166447620, \old(ma = ma & ((1U << 24U) - 1U))=36028799166447621, \old(ma = ma | (1U << 24U))=36028799166447619, \old(mb = b & ((1U << 24U) - 1U))=36028799166447617, \old(mb = mb | (1U << 24U))=36028799166447623, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799166447622, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, ma = a & ((1U << 24U) - 1U)=36028799166447620, ma = ma & ((1U << 24U) - 1U)=36028799166447621, ma = ma | (1U << 24U)=36028799166447619, mb = b & ((1U << 24U) - 1U)=36028799166447617, mb = mb | (1U << 24U)=36028799166447623, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799166447622, tmp=2147483646] [L101] COND FALSE !(! b) VAL [\old(a)=2147483646, \old(b)=2147483647, \old(ma = a & ((1U << 24U) - 1U))=36028799166447620, \old(ma = ma & ((1U << 24U) - 1U))=36028799166447621, \old(ma = ma | (1U << 24U))=36028799166447619, \old(mb = b & ((1U << 24U) - 1U))=36028799166447617, \old(mb = mb | (1U << 24U))=36028799166447623, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799166447622, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, ma = a & ((1U << 24U) - 1U)=36028799166447620, ma = ma & ((1U << 24U) - 1U)=36028799166447621, ma = ma | (1U << 24U)=36028799166447619, mb = b & ((1U << 24U) - 1U)=36028799166447617, mb = mb | (1U << 24U)=36028799166447623, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799166447622, tmp=2147483646] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=2147483646, \old(b)=2147483647, \old(ma = a & ((1U << 24U) - 1U))=36028799166447620, \old(ma = ma & ((1U << 24U) - 1U))=36028799166447621, \old(ma = ma | (1U << 24U))=36028799166447619, \old(mb = b & ((1U << 24U) - 1U))=36028799166447617, \old(mb = mb | (1U << 24U))=36028799166447623, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799166447622, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=36028799166447621, ma = ma | (1U << 24U)=36028799166447619, mb = b & ((1U << 24U) - 1U)=36028799166447617, mb = mb | (1U << 24U)=36028799166447623, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799166447622, tmp=2147483646] [L109] (int )(a >> 24U) - 128 VAL [\old(a)=2147483646, \old(b)=2147483647, \old(ma = a & ((1U << 24U) - 1U))=36028799166447620, \old(ma = ma & ((1U << 24U) - 1U))=36028799166447621, \old(ma = ma | (1U << 24U))=36028799166447619, \old(mb = b & ((1U << 24U) - 1U))=36028799166447617, \old(mb = mb | (1U << 24U))=36028799166447623, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=36028799166447622, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=36028799166447621, ma = ma | (1U << 24U)=36028799166447619, mb = b & ((1U << 24U) - 1U)=36028799166447617, mb = mb | (1U << 24U)=36028799166447623, res = m | ((unsigned int )(e + 128) << 24U)=16777216, res = ma | ((unsigned int )(ea + 128) << 24U)=36028799166447622, tmp=2147483646] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: 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: 38.3s, OverallIterations: 33, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14820 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14707 mSDsluCounter, 17148 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10627 mSDsCounter, 2100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47419 IncrementalHoareTripleChecker+Invalid, 49519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2100 mSolverCounterUnsat, 6521 mSDtfsCounter, 47419 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.7s 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.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 13216 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s 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-14 13:57:25,407 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