./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 00:46:22,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 00:46:22,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 00:46:22,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 00:46:22,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 00:46:22,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 00:46:22,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 00:46:22,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 00:46:22,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 00:46:22,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 00:46:22,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 00:46:22,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 00:46:22,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 00:46:22,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 00:46:22,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 00:46:22,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 00:46:22,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 00:46:22,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 00:46:22,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 00:46:22,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 00:46:22,669 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 00:46:22,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 00:46:22,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 00:46:22,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 00:46:22,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 00:46:22,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 00:46:22,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 00:46:22,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 00:46:22,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 00:46:22,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 00:46:22,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 00:46:22,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 00:46:22,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 00:46:22,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 00:46:22,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 00:46:22,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 00:46:22,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 00:46:22,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 00:46:22,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 00:46:22,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 00:46:22,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 00:46:22,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 00:46:22,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-22 00:46:22,715 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 00:46:22,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 00:46:22,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 00:46:22,716 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 00:46:22,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 00:46:22,717 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 00:46:22,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 00:46:22,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 00:46:22,718 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 00:46:22,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 00:46:22,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 00:46:22,729 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 00:46:22,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 00:46:22,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 00:46:22,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 00:46:22,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 00:46:22,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 00:46:22,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 00:46:22,730 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-22 00:46:22,730 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 00:46:22,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 00:46:22,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 00:46:22,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 00:46:22,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 00:46:22,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 00:46:22,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 00:46:22,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:22,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 00:46:22,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 00:46:22,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 00:46:22,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 00:46:22,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 00:46:22,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 00:46:22,734 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-07-22 00:46:23,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 00:46:23,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 00:46:23,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 00:46:23,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 00:46:23,050 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 00:46:23,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-22 00:46:23,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2c5be0e/4392ba4cea1f462ea3e7da74657db785/FLAGb01fb40d3 [2022-07-22 00:46:23,554 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 00:46:23,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-22 00:46:23,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2c5be0e/4392ba4cea1f462ea3e7da74657db785/FLAGb01fb40d3 [2022-07-22 00:46:24,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d2c5be0e/4392ba4cea1f462ea3e7da74657db785 [2022-07-22 00:46:24,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 00:46:24,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 00:46:24,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:24,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 00:46:24,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 00:46:24,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a15196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24, skipping insertion in model container [2022-07-22 00:46:24,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 00:46:24,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 00:46:24,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-22 00:46:24,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:24,302 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 00:46:24,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-22 00:46:24,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:24,354 INFO L208 MainTranslator]: Completed translation [2022-07-22 00:46:24,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24 WrapperNode [2022-07-22 00:46:24,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:24,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:24,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 00:46:24,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 00:46:24,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,413 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 225 [2022-07-22 00:46:24,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:24,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 00:46:24,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 00:46:24,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 00:46:24,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 00:46:24,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 00:46:24,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 00:46:24,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 00:46:24,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (1/1) ... [2022-07-22 00:46:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:24,492 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-22 00:46:24,515 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-22 00:46:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 00:46:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 00:46:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-22 00:46:24,534 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-22 00:46:24,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 00:46:24,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 00:46:24,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 00:46:24,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 00:46:24,637 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 00:46:24,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 00:46:25,122 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 00:46:25,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 00:46:25,129 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 00:46:25,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:25 BoogieIcfgContainer [2022-07-22 00:46:25,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 00:46:25,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 00:46:25,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 00:46:25,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 00:46:25,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 12:46:24" (1/3) ... [2022-07-22 00:46:25,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfaefd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:25, skipping insertion in model container [2022-07-22 00:46:25,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:24" (2/3) ... [2022-07-22 00:46:25,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfaefd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:25, skipping insertion in model container [2022-07-22 00:46:25,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:25" (3/3) ... [2022-07-22 00:46:25,138 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-07-22 00:46:25,150 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 00:46:25,150 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-22 00:46:25,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 00:46:25,224 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@40d74e2b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19ebef87 [2022-07-22 00:46:25,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-22 00:46:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 110 states have (on average 1.7818181818181817) internal successors, (196), 132 states have internal predecessors, (196), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-22 00:46:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 00:46:25,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:25,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:25,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1345103503, now seen corresponding path program 1 times [2022-07-22 00:46:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:25,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548775573] [2022-07-22 00:46:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,391 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-22 00:46:25,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548775573] [2022-07-22 00:46:25,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548775573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:25,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:25,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:46:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224728560] [2022-07-22 00:46:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:25,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 00:46:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:25,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 00:46:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 00:46:25,440 INFO L87 Difference]: Start difference. First operand has 142 states, 110 states have (on average 1.7818181818181817) internal successors, (196), 132 states have internal predecessors, (196), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 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-22 00:46:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:25,486 INFO L93 Difference]: Finished difference Result 279 states and 433 transitions. [2022-07-22 00:46:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 00:46:25,488 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-22 00:46:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:25,495 INFO L225 Difference]: With dead ends: 279 [2022-07-22 00:46:25,497 INFO L226 Difference]: Without dead ends: 107 [2022-07-22 00:46:25,500 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-22 00:46:25,504 INFO L413 NwaCegarLoop]: 194 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, 194 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-22 00:46:25,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-22 00:46:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-22 00:46:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 98 states have internal predecessors, (125), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 137 transitions. [2022-07-22 00:46:25,556 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 137 transitions. Word has length 9 [2022-07-22 00:46:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:25,557 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 137 transitions. [2022-07-22 00:46:25,558 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-22 00:46:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2022-07-22 00:46:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 00:46:25,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:25,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:25,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 00:46:25,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1344162155, now seen corresponding path program 1 times [2022-07-22 00:46:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:25,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371448404] [2022-07-22 00:46:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,620 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-22 00:46:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371448404] [2022-07-22 00:46:25,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371448404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:25,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:25,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883371658] [2022-07-22 00:46:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:25,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:25,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:25,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:25,624 INFO L87 Difference]: Start difference. First operand 107 states and 137 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-22 00:46:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:25,759 INFO L93 Difference]: Finished difference Result 273 states and 365 transitions. [2022-07-22 00:46:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:25,760 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-22 00:46:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:25,763 INFO L225 Difference]: With dead ends: 273 [2022-07-22 00:46:25,763 INFO L226 Difference]: Without dead ends: 169 [2022-07-22 00:46:25,764 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-22 00:46:25,765 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 106 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 361 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-22 00:46:25,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 361 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-22 00:46:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2022-07-22 00:46:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 129 states have (on average 1.550387596899225) internal successors, (200), 146 states have internal predecessors, (200), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 212 transitions. [2022-07-22 00:46:25,780 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 212 transitions. Word has length 9 [2022-07-22 00:46:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:25,780 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 212 transitions. [2022-07-22 00:46:25,780 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-22 00:46:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 212 transitions. [2022-07-22 00:46:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 00:46:25,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:25,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:25,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 00:46:25,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash 466647620, now seen corresponding path program 1 times [2022-07-22 00:46:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:25,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926325422] [2022-07-22 00:46:25,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:25,849 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-22 00:46:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:25,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926325422] [2022-07-22 00:46:25,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926325422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:25,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:25,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 00:46:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698426493] [2022-07-22 00:46:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:25,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:25,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:25,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:25,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 00:46:25,854 INFO L87 Difference]: Start difference. First operand 156 states and 212 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-22 00:46:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:26,017 INFO L93 Difference]: Finished difference Result 191 states and 251 transitions. [2022-07-22 00:46:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:26,017 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-22 00:46:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:26,021 INFO L225 Difference]: With dead ends: 191 [2022-07-22 00:46:26,022 INFO L226 Difference]: Without dead ends: 188 [2022-07-22 00:46:26,023 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-22 00:46:26,026 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 161 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 483 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-22 00:46:26,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 483 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-22 00:46:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2022-07-22 00:46:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 153 states have internal predecessors, (211), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2022-07-22 00:46:26,048 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 223 transitions. Word has length 13 [2022-07-22 00:46:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:26,049 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 223 transitions. [2022-07-22 00:46:26,049 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-22 00:46:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 223 transitions. [2022-07-22 00:46:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 00:46:26,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:26,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:26,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 00:46:26,050 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1581174453, now seen corresponding path program 1 times [2022-07-22 00:46:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:26,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751053241] [2022-07-22 00:46:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:26,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:26,123 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-22 00:46:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:26,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751053241] [2022-07-22 00:46:26,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751053241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:26,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:26,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 00:46:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342511179] [2022-07-22 00:46:26,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:26,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:26,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:26,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 00:46:26,126 INFO L87 Difference]: Start difference. First operand 163 states and 223 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-22 00:46:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:26,246 INFO L93 Difference]: Finished difference Result 306 states and 404 transitions. [2022-07-22 00:46:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:26,247 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-22 00:46:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:26,248 INFO L225 Difference]: With dead ends: 306 [2022-07-22 00:46:26,248 INFO L226 Difference]: Without dead ends: 198 [2022-07-22 00:46:26,249 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-22 00:46:26,250 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 190 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:26,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 399 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-22 00:46:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2022-07-22 00:46:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 157 states have internal predecessors, (214), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 226 transitions. [2022-07-22 00:46:26,263 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 226 transitions. Word has length 14 [2022-07-22 00:46:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:26,264 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 226 transitions. [2022-07-22 00:46:26,264 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-22 00:46:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 226 transitions. [2022-07-22 00:46:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 00:46:26,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:26,265 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:26,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 00:46:26,265 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1172920179, now seen corresponding path program 1 times [2022-07-22 00:46:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:26,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750890644] [2022-07-22 00:46:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:26,317 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-22 00:46:26,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:26,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750890644] [2022-07-22 00:46:26,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750890644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:26,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743799259] [2022-07-22 00:46:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:26,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:26,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:26,320 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-22 00:46:26,337 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-22 00:46:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:26,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:26,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:26,433 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-22 00:46:26,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:26,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743799259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:26,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:26,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36648889] [2022-07-22 00:46:26,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:26,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:26,435 INFO L87 Difference]: Start difference. First operand 167 states and 226 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-22 00:46:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:26,540 INFO L93 Difference]: Finished difference Result 237 states and 323 transitions. [2022-07-22 00:46:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:26,541 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-22 00:46:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:26,544 INFO L225 Difference]: With dead ends: 237 [2022-07-22 00:46:26,545 INFO L226 Difference]: Without dead ends: 233 [2022-07-22 00:46:26,545 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-22 00:46:26,547 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 188 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 381 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-22 00:46:26,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 381 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-22 00:46:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 203. [2022-07-22 00:46:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 192 states have internal predecessors, (274), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2022-07-22 00:46:26,570 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 16 [2022-07-22 00:46:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:26,570 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2022-07-22 00:46:26,570 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-22 00:46:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2022-07-22 00:46:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 00:46:26,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:26,571 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:26,592 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-22 00:46:26,783 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-22 00:46:26,785 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash 153036525, now seen corresponding path program 1 times [2022-07-22 00:46:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:26,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809753020] [2022-07-22 00:46:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:26,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:26,827 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-22 00:46:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:26,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809753020] [2022-07-22 00:46:26,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809753020] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:26,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833478106] [2022-07-22 00:46:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:26,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:26,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:26,830 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-22 00:46:26,858 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-22 00:46:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:26,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 00:46:26,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:26,910 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-22 00:46:26,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:26,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833478106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:26,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:26,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-22 00:46:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102662400] [2022-07-22 00:46:26,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:26,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:26,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:26,913 INFO L87 Difference]: Start difference. First operand 203 states and 286 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-22 00:46:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:26,964 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2022-07-22 00:46:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:26,964 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-22 00:46:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:26,966 INFO L225 Difference]: With dead ends: 255 [2022-07-22 00:46:26,966 INFO L226 Difference]: Without dead ends: 253 [2022-07-22 00:46:26,966 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-22 00:46:26,970 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 28 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:26,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 278 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-22 00:46:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 196. [2022-07-22 00:46:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 169 states have (on average 1.532544378698225) internal successors, (259), 185 states have internal predecessors, (259), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 271 transitions. [2022-07-22 00:46:26,980 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 271 transitions. Word has length 15 [2022-07-22 00:46:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:26,980 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 271 transitions. [2022-07-22 00:46:26,980 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-22 00:46:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 271 transitions. [2022-07-22 00:46:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 00:46:26,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:26,982 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:27,012 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-22 00:46:27,207 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-22 00:46:27,208 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:27,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2000787238, now seen corresponding path program 1 times [2022-07-22 00:46:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:27,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623831603] [2022-07-22 00:46:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:27,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:27,237 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-22 00:46:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:27,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623831603] [2022-07-22 00:46:27,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623831603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131427572] [2022-07-22 00:46:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:27,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:27,239 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-22 00:46:27,270 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-22 00:46:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:27,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 00:46:27,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:27,304 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-22 00:46:27,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131427572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:27,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:27,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-22 00:46:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836482418] [2022-07-22 00:46:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:27,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:27,306 INFO L87 Difference]: Start difference. First operand 196 states and 271 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-22 00:46:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:27,340 INFO L93 Difference]: Finished difference Result 205 states and 280 transitions. [2022-07-22 00:46:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:27,345 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-22 00:46:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:27,347 INFO L225 Difference]: With dead ends: 205 [2022-07-22 00:46:27,347 INFO L226 Difference]: Without dead ends: 204 [2022-07-22 00:46:27,347 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-22 00:46:27,348 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 248 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-22 00:46:27,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 248 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-22 00:46:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2022-07-22 00:46:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 182 states have internal predecessors, (254), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 266 transitions. [2022-07-22 00:46:27,362 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 266 transitions. Word has length 17 [2022-07-22 00:46:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:27,363 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 266 transitions. [2022-07-22 00:46:27,363 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-22 00:46:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 266 transitions. [2022-07-22 00:46:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 00:46:27,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:27,368 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:27,398 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-22 00:46:27,595 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-22 00:46:27,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:27,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1512656933, now seen corresponding path program 1 times [2022-07-22 00:46:27,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:27,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740671564] [2022-07-22 00:46:27,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:27,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:27,655 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-22 00:46:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:27,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740671564] [2022-07-22 00:46:27,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740671564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:27,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318842922] [2022-07-22 00:46:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:27,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:27,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:27,658 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-22 00:46:27,680 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-22 00:46:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:27,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:27,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:27,730 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-22 00:46:27,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:27,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318842922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:27,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:27,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19831201] [2022-07-22 00:46:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:27,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:27,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:27,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:27,735 INFO L87 Difference]: Start difference. First operand 193 states and 266 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-22 00:46:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:27,814 INFO L93 Difference]: Finished difference Result 236 states and 320 transitions. [2022-07-22 00:46:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:27,815 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-22 00:46:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:27,818 INFO L225 Difference]: With dead ends: 236 [2022-07-22 00:46:27,818 INFO L226 Difference]: Without dead ends: 233 [2022-07-22 00:46:27,818 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-22 00:46:27,819 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 173 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:27,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 382 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-22 00:46:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 201. [2022-07-22 00:46:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.5142857142857142) internal successors, (265), 190 states have internal predecessors, (265), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 277 transitions. [2022-07-22 00:46:27,828 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 277 transitions. Word has length 18 [2022-07-22 00:46:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:27,828 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 277 transitions. [2022-07-22 00:46:27,829 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-22 00:46:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 277 transitions. [2022-07-22 00:46:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 00:46:27,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:27,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:27,853 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-22 00:46:28,043 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-22 00:46:28,044 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1085205661, now seen corresponding path program 1 times [2022-07-22 00:46:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:28,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539458016] [2022-07-22 00:46:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,072 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-22 00:46:28,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:28,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539458016] [2022-07-22 00:46:28,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539458016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:28,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:28,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085595572] [2022-07-22 00:46:28,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:28,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:28,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:28,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:28,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:28,074 INFO L87 Difference]: Start difference. First operand 201 states and 277 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-22 00:46:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:28,139 INFO L93 Difference]: Finished difference Result 256 states and 353 transitions. [2022-07-22 00:46:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:28,140 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-22 00:46:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:28,141 INFO L225 Difference]: With dead ends: 256 [2022-07-22 00:46:28,141 INFO L226 Difference]: Without dead ends: 254 [2022-07-22 00:46:28,142 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-22 00:46:28,142 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 24 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:28,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 377 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-22 00:46:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2022-07-22 00:46:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.502857142857143) internal successors, (263), 190 states have internal predecessors, (263), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 275 transitions. [2022-07-22 00:46:28,151 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 275 transitions. Word has length 19 [2022-07-22 00:46:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:28,151 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 275 transitions. [2022-07-22 00:46:28,151 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-22 00:46:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 275 transitions. [2022-07-22 00:46:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 00:46:28,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:28,152 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-22 00:46:28,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 00:46:28,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash 928226989, now seen corresponding path program 1 times [2022-07-22 00:46:28,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:28,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295927847] [2022-07-22 00:46:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,208 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-22 00:46:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:28,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295927847] [2022-07-22 00:46:28,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295927847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:28,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462634108] [2022-07-22 00:46:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:28,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:28,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:28,216 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-22 00:46:28,217 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-22 00:46:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:28,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:28,296 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-22 00:46:28,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:28,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462634108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:28,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:28,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358517346] [2022-07-22 00:46:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:28,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:28,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:28,298 INFO L87 Difference]: Start difference. First operand 201 states and 275 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-22 00:46:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:28,369 INFO L93 Difference]: Finished difference Result 231 states and 316 transitions. [2022-07-22 00:46:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:28,370 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-22 00:46:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:28,371 INFO L225 Difference]: With dead ends: 231 [2022-07-22 00:46:28,371 INFO L226 Difference]: Without dead ends: 228 [2022-07-22 00:46:28,372 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-22 00:46:28,372 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 178 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:28,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 379 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-22 00:46:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 189. [2022-07-22 00:46:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.463855421686747) internal successors, (243), 178 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 255 transitions. [2022-07-22 00:46:28,381 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 255 transitions. Word has length 23 [2022-07-22 00:46:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:28,381 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 255 transitions. [2022-07-22 00:46:28,381 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-22 00:46:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 255 transitions. [2022-07-22 00:46:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 00:46:28,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:28,382 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-22 00:46:28,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:28,603 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-22 00:46:28,604 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash -439611243, now seen corresponding path program 1 times [2022-07-22 00:46:28,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:28,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922892665] [2022-07-22 00:46:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,655 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-22 00:46:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922892665] [2022-07-22 00:46:28,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922892665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550382442] [2022-07-22 00:46:28,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:28,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:28,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:28,657 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-22 00:46:28,658 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-22 00:46:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:28,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:28,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:28,744 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-22 00:46:28,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:28,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550382442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:28,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:28,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147800108] [2022-07-22 00:46:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:28,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:28,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:28,746 INFO L87 Difference]: Start difference. First operand 189 states and 255 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-22 00:46:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:28,820 INFO L93 Difference]: Finished difference Result 219 states and 295 transitions. [2022-07-22 00:46:28,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:28,820 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-22 00:46:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:28,821 INFO L225 Difference]: With dead ends: 219 [2022-07-22 00:46:28,821 INFO L226 Difference]: Without dead ends: 216 [2022-07-22 00:46:28,822 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-22 00:46:28,822 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 162 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 385 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:28,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 385 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-22 00:46:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2022-07-22 00:46:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 167 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 240 transitions. [2022-07-22 00:46:28,831 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 240 transitions. Word has length 25 [2022-07-22 00:46:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:28,831 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 240 transitions. [2022-07-22 00:46:28,831 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-22 00:46:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 240 transitions. [2022-07-22 00:46:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 00:46:28,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:28,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:28,860 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-22 00:46:29,055 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-22 00:46:29,056 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash -853587819, now seen corresponding path program 1 times [2022-07-22 00:46:29,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:29,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38121648] [2022-07-22 00:46:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 00:46:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,167 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-22 00:46:29,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:29,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38121648] [2022-07-22 00:46:29,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38121648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:29,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:29,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 00:46:29,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505454010] [2022-07-22 00:46:29,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:29,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 00:46:29,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:29,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 00:46:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 00:46:29,169 INFO L87 Difference]: Start difference. First operand 178 states and 240 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:29,323 INFO L93 Difference]: Finished difference Result 330 states and 425 transitions. [2022-07-22 00:46:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 00:46:29,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-22 00:46:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:29,325 INFO L225 Difference]: With dead ends: 330 [2022-07-22 00:46:29,326 INFO L226 Difference]: Without dead ends: 260 [2022-07-22 00:46:29,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-22 00:46:29,327 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 88 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:29,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 759 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-22 00:46:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 180. [2022-07-22 00:46:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.425) internal successors, (228), 169 states have internal predecessors, (228), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2022-07-22 00:46:29,339 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 31 [2022-07-22 00:46:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:29,339 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2022-07-22 00:46:29,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2022-07-22 00:46:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 00:46:29,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:29,342 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 00:46:29,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1244113542, now seen corresponding path program 1 times [2022-07-22 00:46:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:29,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548841174] [2022-07-22 00:46:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 00:46:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 00:46:29,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:29,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548841174] [2022-07-22 00:46:29,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548841174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:29,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868195100] [2022-07-22 00:46:29,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:29,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:29,452 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-22 00:46:29,453 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-22 00:46:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 00:46:29,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 00:46:29,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 00:46:29,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868195100] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:29,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 00:46:29,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 13 [2022-07-22 00:46:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239725] [2022-07-22 00:46:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:29,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:46:29,672 INFO L87 Difference]: Start difference. First operand 180 states and 240 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:29,695 INFO L93 Difference]: Finished difference Result 232 states and 299 transitions. [2022-07-22 00:46:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:29,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-07-22 00:46:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:29,698 INFO L225 Difference]: With dead ends: 232 [2022-07-22 00:46:29,698 INFO L226 Difference]: Without dead ends: 181 [2022-07-22 00:46:29,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:46:29,699 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 105 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:29,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 191 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-22 00:46:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2022-07-22 00:46:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.41875) internal successors, (227), 169 states have internal predecessors, (227), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 239 transitions. [2022-07-22 00:46:29,708 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 239 transitions. Word has length 35 [2022-07-22 00:46:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:29,708 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 239 transitions. [2022-07-22 00:46:29,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2022-07-22 00:46:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 00:46:29,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:29,710 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:29,739 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-22 00:46:29,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:29,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2136066482, now seen corresponding path program 1 times [2022-07-22 00:46:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:29,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463009544] [2022-07-22 00:46:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 00:46:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,005 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-22 00:46:30,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:30,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463009544] [2022-07-22 00:46:30,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463009544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:30,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000619828] [2022-07-22 00:46:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:30,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:30,007 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-22 00:46:30,009 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-22 00:46:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 00:46:30,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:30,148 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-22 00:46:30,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:30,214 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-22 00:46:30,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000619828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:30,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:30,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-22 00:46:30,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871618040] [2022-07-22 00:46:30,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:30,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 00:46:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 00:46:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-22 00:46:30,215 INFO L87 Difference]: Start difference. First operand 180 states and 239 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 00:46:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:30,467 INFO L93 Difference]: Finished difference Result 450 states and 564 transitions. [2022-07-22 00:46:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 00:46:30,467 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-07-22 00:46:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:30,469 INFO L225 Difference]: With dead ends: 450 [2022-07-22 00:46:30,469 INFO L226 Difference]: Without dead ends: 386 [2022-07-22 00:46:30,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-22 00:46:30,470 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 307 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:30,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1307 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:46:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-22 00:46:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 194. [2022-07-22 00:46:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 172 states have (on average 1.4069767441860466) internal successors, (242), 181 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-22 00:46:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-07-22 00:46:30,484 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 38 [2022-07-22 00:46:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:30,484 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-07-22 00:46:30,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 00:46:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-07-22 00:46:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 00:46:30,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:30,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:30,507 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-22 00:46:30,703 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-22 00:46:30,703 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1326719856, now seen corresponding path program 1 times [2022-07-22 00:46:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:30,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922926341] [2022-07-22 00:46:30,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 00:46:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,779 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-22 00:46:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922926341] [2022-07-22 00:46:30,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922926341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424017690] [2022-07-22 00:46:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:30,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:30,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:30,782 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:46:30,783 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-22 00:46:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 00:46:30,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:30,895 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-22 00:46:30,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:31,024 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-22 00:46:31,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424017690] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:31,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:31,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-07-22 00:46:31,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050914213] [2022-07-22 00:46:31,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:31,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 00:46:31,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 00:46:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-22 00:46:31,025 INFO L87 Difference]: Start difference. First operand 194 states and 257 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:46:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:31,609 INFO L93 Difference]: Finished difference Result 490 states and 643 transitions. [2022-07-22 00:46:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 00:46:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2022-07-22 00:46:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:31,611 INFO L225 Difference]: With dead ends: 490 [2022-07-22 00:46:31,611 INFO L226 Difference]: Without dead ends: 280 [2022-07-22 00:46:31,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-07-22 00:46:31,613 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 198 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:31,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1325 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:46:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-22 00:46:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 135. [2022-07-22 00:46:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.391304347826087) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2022-07-22 00:46:31,622 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 38 [2022-07-22 00:46:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:31,622 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2022-07-22 00:46:31,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:46:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2022-07-22 00:46:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 00:46:31,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:31,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:31,649 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-22 00:46:31,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 00:46:31,847 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:31,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1749175167, now seen corresponding path program 2 times [2022-07-22 00:46:31,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:31,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542199151] [2022-07-22 00:46:31,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 00:46:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 00:46:31,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:31,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542199151] [2022-07-22 00:46:31,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542199151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:31,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339967624] [2022-07-22 00:46:31,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 00:46:31,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:31,954 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-22 00:46:31,977 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-22 00:46:32,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 00:46:32,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 00:46:32,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 00:46:32,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:32,052 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-22 00:46:32,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:32,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339967624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:32,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:32,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-22 00:46:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937807207] [2022-07-22 00:46:32,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:32,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 00:46:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:32,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 00:46:32,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 00:46:32,054 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:32,100 INFO L93 Difference]: Finished difference Result 260 states and 320 transitions. [2022-07-22 00:46:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:32,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-07-22 00:46:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:32,103 INFO L225 Difference]: With dead ends: 260 [2022-07-22 00:46:32,103 INFO L226 Difference]: Without dead ends: 202 [2022-07-22 00:46:32,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-22 00:46:32,104 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 66 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:32,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 614 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-22 00:46:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 143. [2022-07-22 00:46:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 131 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-22 00:46:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 182 transitions. [2022-07-22 00:46:32,113 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 182 transitions. Word has length 42 [2022-07-22 00:46:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:32,114 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 182 transitions. [2022-07-22 00:46:32,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 182 transitions. [2022-07-22 00:46:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 00:46:32,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:32,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:32,139 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-22 00:46:32,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 00:46:32,327 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1287754489, now seen corresponding path program 1 times [2022-07-22 00:46:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:32,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421622699] [2022-07-22 00:46:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 00:46:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 00:46:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:32,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421622699] [2022-07-22 00:46:32,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421622699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:32,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105913937] [2022-07-22 00:46:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:32,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:32,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:32,423 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-22 00:46:32,424 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-22 00:46:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 00:46:32,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 00:46:32,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 00:46:32,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105913937] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:32,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:32,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-07-22 00:46:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400898548] [2022-07-22 00:46:32,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:32,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 00:46:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 00:46:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-22 00:46:32,628 INFO L87 Difference]: Start difference. First operand 143 states and 182 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 00:46:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:32,992 INFO L93 Difference]: Finished difference Result 306 states and 392 transitions. [2022-07-22 00:46:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 00:46:32,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-07-22 00:46:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:32,994 INFO L225 Difference]: With dead ends: 306 [2022-07-22 00:46:32,994 INFO L226 Difference]: Without dead ends: 244 [2022-07-22 00:46:32,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-07-22 00:46:32,995 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 313 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:32,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 768 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:46:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-22 00:46:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 135. [2022-07-22 00:46:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.373913043478261) internal successors, (158), 124 states have internal predecessors, (158), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2022-07-22 00:46:33,004 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 44 [2022-07-22 00:46:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:33,005 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2022-07-22 00:46:33,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 00:46:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2022-07-22 00:46:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 00:46:33,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:33,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:33,030 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-22 00:46:33,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 00:46:33,223 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1203752287, now seen corresponding path program 1 times [2022-07-22 00:46:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:33,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381726173] [2022-07-22 00:46:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 00:46:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,351 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-22 00:46:33,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:33,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381726173] [2022-07-22 00:46:33,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381726173] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:33,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001817252] [2022-07-22 00:46:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:33,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:33,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:33,354 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-22 00:46:33,355 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-22 00:46:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 00:46:33,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:33,558 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-22 00:46:33,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:33,725 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-22 00:46:33,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001817252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:33,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:33,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2022-07-22 00:46:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858505885] [2022-07-22 00:46:33,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:33,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 00:46:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:33,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 00:46:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-22 00:46:33,726 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 00:46:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:33,974 INFO L93 Difference]: Finished difference Result 283 states and 350 transitions. [2022-07-22 00:46:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 00:46:33,975 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-07-22 00:46:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:33,976 INFO L225 Difference]: With dead ends: 283 [2022-07-22 00:46:33,976 INFO L226 Difference]: Without dead ends: 227 [2022-07-22 00:46:33,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-07-22 00:46:33,977 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 334 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:33,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1163 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:46:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-22 00:46:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-07-22 00:46:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.335820895522388) internal successors, (179), 143 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-22 00:46:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2022-07-22 00:46:33,987 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 46 [2022-07-22 00:46:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:33,987 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2022-07-22 00:46:33,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 00:46:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2022-07-22 00:46:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-22 00:46:33,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:33,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:34,013 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-22 00:46:34,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 00:46:34,206 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -760986112, now seen corresponding path program 1 times [2022-07-22 00:46:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:34,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802643053] [2022-07-22 00:46:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 00:46:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,249 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-22 00:46:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:34,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802643053] [2022-07-22 00:46:34,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802643053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:34,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639148494] [2022-07-22 00:46:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:34,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:34,251 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-22 00:46:34,275 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-22 00:46:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 00:46:34,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:34,326 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-22 00:46:34,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:34,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639148494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:34,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:34,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-07-22 00:46:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034400127] [2022-07-22 00:46:34,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:34,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:34,328 INFO L87 Difference]: Start difference. First operand 156 states and 194 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 00:46:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:34,361 INFO L93 Difference]: Finished difference Result 296 states and 370 transitions. [2022-07-22 00:46:34,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:34,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-07-22 00:46:34,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:34,363 INFO L225 Difference]: With dead ends: 296 [2022-07-22 00:46:34,363 INFO L226 Difference]: Without dead ends: 180 [2022-07-22 00:46:34,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:34,364 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 222 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-22 00:46:34,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 222 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-22 00:46:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2022-07-22 00:46:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.3125) internal successors, (189), 153 states have internal predecessors, (189), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-22 00:46:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 204 transitions. [2022-07-22 00:46:34,373 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 204 transitions. Word has length 52 [2022-07-22 00:46:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:34,373 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 204 transitions. [2022-07-22 00:46:34,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 00:46:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2022-07-22 00:46:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 00:46:34,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:34,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:34,398 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-22 00:46:34,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:34,595 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1055930893, now seen corresponding path program 1 times [2022-07-22 00:46:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:34,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891246915] [2022-07-22 00:46:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 00:46:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,668 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-22 00:46:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891246915] [2022-07-22 00:46:34,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891246915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317443453] [2022-07-22 00:46:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:34,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:34,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:34,670 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-22 00:46:34,697 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-22 00:46:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 00:46:34,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:34,781 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-22 00:46:34,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:34,847 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-22 00:46:34,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317443453] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:34,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:34,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-07-22 00:46:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776714332] [2022-07-22 00:46:34,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:34,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 00:46:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 00:46:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:46:34,849 INFO L87 Difference]: Start difference. First operand 166 states and 204 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 00:46:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:35,054 INFO L93 Difference]: Finished difference Result 419 states and 508 transitions. [2022-07-22 00:46:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 00:46:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-07-22 00:46:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:35,056 INFO L225 Difference]: With dead ends: 419 [2022-07-22 00:46:35,056 INFO L226 Difference]: Without dead ends: 368 [2022-07-22 00:46:35,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-22 00:46:35,057 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 337 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:35,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1452 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-22 00:46:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 186. [2022-07-22 00:46:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 171 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-22 00:46:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 228 transitions. [2022-07-22 00:46:35,070 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 228 transitions. Word has length 53 [2022-07-22 00:46:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:35,070 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 228 transitions. [2022-07-22 00:46:35,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 00:46:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 228 transitions. [2022-07-22 00:46:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 00:46:35,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:35,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:35,095 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-22 00:46:35,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:35,295 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1055928971, now seen corresponding path program 1 times [2022-07-22 00:46:35,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:35,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246963062] [2022-07-22 00:46:35,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 00:46:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,373 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-22 00:46:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:35,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246963062] [2022-07-22 00:46:35,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246963062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:35,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486244731] [2022-07-22 00:46:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:35,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:35,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:35,375 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-22 00:46:35,396 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-22 00:46:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 00:46:35,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:35,564 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-22 00:46:35,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:35,741 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-22 00:46:35,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486244731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:35,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:35,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-07-22 00:46:35,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980606306] [2022-07-22 00:46:35,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:35,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 00:46:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 00:46:35,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-22 00:46:35,742 INFO L87 Difference]: Start difference. First operand 186 states and 228 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:46:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:36,519 INFO L93 Difference]: Finished difference Result 544 states and 679 transitions. [2022-07-22 00:46:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 00:46:36,522 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-07-22 00:46:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:36,524 INFO L225 Difference]: With dead ends: 544 [2022-07-22 00:46:36,524 INFO L226 Difference]: Without dead ends: 488 [2022-07-22 00:46:36,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-07-22 00:46:36,526 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 562 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:36,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1242 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:46:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-07-22 00:46:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 201. [2022-07-22 00:46:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 184 states have internal predecessors, (225), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-22 00:46:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2022-07-22 00:46:36,547 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 53 [2022-07-22 00:46:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:36,547 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2022-07-22 00:46:36,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:46:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2022-07-22 00:46:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 00:46:36,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:36,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:36,571 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-22 00:46:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:36,767 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash -246584267, now seen corresponding path program 1 times [2022-07-22 00:46:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:36,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173740386] [2022-07-22 00:46:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 00:46:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,856 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-22 00:46:36,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:36,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173740386] [2022-07-22 00:46:36,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173740386] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:36,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327596538] [2022-07-22 00:46:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:36,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:36,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:36,857 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-22 00:46:36,859 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-22 00:46:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 00:46:36,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 00:46:37,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:37,210 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-22 00:46:37,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327596538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:37,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:37,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 20 [2022-07-22 00:46:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057921746] [2022-07-22 00:46:37,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:37,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 00:46:37,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 00:46:37,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-22 00:46:37,212 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:46:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:37,966 INFO L93 Difference]: Finished difference Result 436 states and 552 transitions. [2022-07-22 00:46:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 00:46:37,969 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-07-22 00:46:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:37,970 INFO L225 Difference]: With dead ends: 436 [2022-07-22 00:46:37,970 INFO L226 Difference]: Without dead ends: 346 [2022-07-22 00:46:37,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2022-07-22 00:46:37,972 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 175 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:37,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1756 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:46:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-22 00:46:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 186. [2022-07-22 00:46:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 171 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-22 00:46:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2022-07-22 00:46:37,985 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 53 [2022-07-22 00:46:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:37,985 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2022-07-22 00:46:37,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:46:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-07-22 00:46:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 00:46:37,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:37,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:38,012 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-22 00:46:38,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-22 00:46:38,209 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:38,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash 239613636, now seen corresponding path program 1 times [2022-07-22 00:46:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:38,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399890029] [2022-07-22 00:46:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 00:46:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,267 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-22 00:46:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399890029] [2022-07-22 00:46:38,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399890029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723752120] [2022-07-22 00:46:38,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:38,270 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-22 00:46:38,298 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-22 00:46:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:38,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:38,355 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-22 00:46:38,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:38,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723752120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:38,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:38,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-22 00:46:38,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078443194] [2022-07-22 00:46:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:38,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:38,358 INFO L87 Difference]: Start difference. First operand 186 states and 227 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 00:46:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:38,428 INFO L93 Difference]: Finished difference Result 411 states and 523 transitions. [2022-07-22 00:46:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:38,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-07-22 00:46:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:38,430 INFO L225 Difference]: With dead ends: 411 [2022-07-22 00:46:38,430 INFO L226 Difference]: Without dead ends: 262 [2022-07-22 00:46:38,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:38,431 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 50 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:38,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 235 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-22 00:46:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 212. [2022-07-22 00:46:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 188 states have (on average 1.2819148936170213) internal successors, (241), 197 states have internal predecessors, (241), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-22 00:46:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 259 transitions. [2022-07-22 00:46:38,444 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 259 transitions. Word has length 53 [2022-07-22 00:46:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:38,452 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 259 transitions. [2022-07-22 00:46:38,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 00:46:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 259 transitions. [2022-07-22 00:46:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-22 00:46:38,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:38,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:38,483 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-22 00:46:38,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:38,683 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:38,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:38,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1225098171, now seen corresponding path program 1 times [2022-07-22 00:46:38,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:38,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987291346] [2022-07-22 00:46:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 00:46:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,728 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-22 00:46:38,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:38,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987291346] [2022-07-22 00:46:38,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987291346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:38,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054972471] [2022-07-22 00:46:38,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:38,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:38,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:38,730 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-22 00:46:38,763 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-22 00:46:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 00:46:38,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:38,815 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-22 00:46:38,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:38,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054972471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:38,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:38,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-22 00:46:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137104853] [2022-07-22 00:46:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:38,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:38,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:38,816 INFO L87 Difference]: Start difference. First operand 212 states and 259 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 00:46:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:38,880 INFO L93 Difference]: Finished difference Result 385 states and 477 transitions. [2022-07-22 00:46:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 00:46:38,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-07-22 00:46:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:38,882 INFO L225 Difference]: With dead ends: 385 [2022-07-22 00:46:38,882 INFO L226 Difference]: Without dead ends: 237 [2022-07-22 00:46:38,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:38,883 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 18 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 337 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-22 00:46:38,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 337 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-22 00:46:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 208. [2022-07-22 00:46:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 193 states have internal predecessors, (238), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-22 00:46:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 256 transitions. [2022-07-22 00:46:38,896 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 256 transitions. Word has length 54 [2022-07-22 00:46:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:38,896 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 256 transitions. [2022-07-22 00:46:38,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 00:46:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 256 transitions. [2022-07-22 00:46:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 00:46:38,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:38,898 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-22 00:46:38,924 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-22 00:46:39,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:39,111 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1756937806, now seen corresponding path program 1 times [2022-07-22 00:46:39,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:39,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579995745] [2022-07-22 00:46:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 00:46:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,302 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-22 00:46:39,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:39,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579995745] [2022-07-22 00:46:39,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579995745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:39,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:39,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 00:46:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824386435] [2022-07-22 00:46:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:39,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 00:46:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:39,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 00:46:39,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-22 00:46:39,304 INFO L87 Difference]: Start difference. First operand 208 states and 256 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:39,655 INFO L93 Difference]: Finished difference Result 390 states and 475 transitions. [2022-07-22 00:46:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 00:46:39,655 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-07-22 00:46:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:39,657 INFO L225 Difference]: With dead ends: 390 [2022-07-22 00:46:39,657 INFO L226 Difference]: Without dead ends: 389 [2022-07-22 00:46:39,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-22 00:46:39,657 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 257 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:39,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1020 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:46:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-22 00:46:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 234. [2022-07-22 00:46:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 209 states have (on average 1.291866028708134) internal successors, (270), 217 states have internal predecessors, (270), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-22 00:46:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-07-22 00:46:39,679 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 55 [2022-07-22 00:46:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:39,679 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-07-22 00:46:39,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-07-22 00:46:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 00:46:39,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:39,684 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-22 00:46:39,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 00:46:39,684 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:39,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1728682864, now seen corresponding path program 1 times [2022-07-22 00:46:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:39,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136208512] [2022-07-22 00:46:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 00:46:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,807 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-22 00:46:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136208512] [2022-07-22 00:46:39,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136208512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:39,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:39,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 00:46:39,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225797939] [2022-07-22 00:46:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:39,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 00:46:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 00:46:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:46:39,809 INFO L87 Difference]: Start difference. First operand 234 states and 291 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:40,045 INFO L93 Difference]: Finished difference Result 429 states and 523 transitions. [2022-07-22 00:46:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 00:46:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-07-22 00:46:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:40,048 INFO L225 Difference]: With dead ends: 429 [2022-07-22 00:46:40,048 INFO L226 Difference]: Without dead ends: 378 [2022-07-22 00:46:40,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-22 00:46:40,048 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 249 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:40,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1232 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:46:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-07-22 00:46:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 258. [2022-07-22 00:46:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 240 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-22 00:46:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 318 transitions. [2022-07-22 00:46:40,064 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 318 transitions. Word has length 55 [2022-07-22 00:46:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:40,064 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 318 transitions. [2022-07-22 00:46:40,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 318 transitions. [2022-07-22 00:46:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 00:46:40,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:40,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:40,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 00:46:40,066 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash -129424594, now seen corresponding path program 1 times [2022-07-22 00:46:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:40,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608502029] [2022-07-22 00:46:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:40,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 00:46:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 00:46:40,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:40,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608502029] [2022-07-22 00:46:40,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608502029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:40,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174454689] [2022-07-22 00:46:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:40,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:40,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:40,189 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-22 00:46:40,217 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-22 00:46:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:40,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 00:46:40,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 00:46:40,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:40,505 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-22 00:46:40,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174454689] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:40,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 00:46:40,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 21 [2022-07-22 00:46:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513862189] [2022-07-22 00:46:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:40,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 00:46:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:40,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 00:46:40,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-07-22 00:46:40,507 INFO L87 Difference]: Start difference. First operand 258 states and 318 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:40,639 INFO L93 Difference]: Finished difference Result 402 states and 487 transitions. [2022-07-22 00:46:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 00:46:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-07-22 00:46:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:40,640 INFO L225 Difference]: With dead ends: 402 [2022-07-22 00:46:40,640 INFO L226 Difference]: Without dead ends: 291 [2022-07-22 00:46:40,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-07-22 00:46:40,641 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 41 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:40,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1095 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-22 00:46:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2022-07-22 00:46:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 234 states have internal predecessors, (289), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-22 00:46:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2022-07-22 00:46:40,668 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 62 [2022-07-22 00:46:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:40,668 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2022-07-22 00:46:40,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 00:46:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2022-07-22 00:46:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 00:46:40,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:40,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:40,700 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-22 00:46:40,879 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-22 00:46:40,879 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-22 00:46:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1579288781, now seen corresponding path program 1 times [2022-07-22 00:46:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:40,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988089621] [2022-07-22 00:46:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 00:46:40,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 00:46:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 00:46:40,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 00:46:40,955 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 00:46:40,956 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2022-07-22 00:46:40,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2022-07-22 00:46:40,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2022-07-22 00:46:40,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2022-07-22 00:46:40,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2022-07-22 00:46:40,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2022-07-22 00:46:40,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2022-07-22 00:46:40,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2022-07-22 00:46:40,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2022-07-22 00:46:40,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2022-07-22 00:46:40,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2022-07-22 00:46:40,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2022-07-22 00:46:40,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 00:46:40,963 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:40,966 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 00:46:41,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 12:46:41 BoogieIcfgContainer [2022-07-22 00:46:41,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 00:46:41,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 00:46:41,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 00:46:41,033 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 00:46:41,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:25" (3/4) ... [2022-07-22 00:46:41,035 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 00:46:41,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 00:46:41,036 INFO L158 Benchmark]: Toolchain (without parser) took 16956.23ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 47.4MB in the beginning and 55.0MB in the end (delta: -7.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2022-07-22 00:46:41,036 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 67.1MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:46:41,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.43ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 47.5MB in the end (delta: -308.8kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 00:46:41,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.43ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 45.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 00:46:41,036 INFO L158 Benchmark]: Boogie Preprocessor took 45.02ms. Allocated memory is still 67.1MB. Free memory was 45.0MB in the beginning and 43.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 00:46:41,037 INFO L158 Benchmark]: RCFGBuilder took 670.96ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.2MB in the beginning and 52.5MB in the end (delta: -9.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 00:46:41,037 INFO L158 Benchmark]: TraceAbstraction took 15899.47ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 52.2MB in the beginning and 55.0MB in the end (delta: -2.9MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-07-22 00:46:41,037 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 119.5MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:46:41,038 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 67.1MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.43ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 47.5MB in the end (delta: -308.8kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.43ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 45.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.02ms. Allocated memory is still 67.1MB. Free memory was 45.0MB in the beginning and 43.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 670.96ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.2MB in the beginning and 52.5MB in the end (delta: -9.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15899.47ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 52.2MB in the beginning and 55.0MB in the end (delta: -2.9MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 119.5MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-126, eb=-1] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L29] COND FALSE !(! m) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L57] COND TRUE 1 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] EXPR e + 128 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] EXPR e + 128 VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L78] __retres4 = res VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, __retres4=2147483647, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L80] return (__retres4); VAL [\old(e)=-126, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, \result=36028799166447615, __retres4=2147483647, e=-126, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=36028799166447615, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=33554432, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [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))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [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))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [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))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [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))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [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))=33554432, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [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))=33554432, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [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))=33554432, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [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))=33554432, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=33554432] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L78] __retres4 = res VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, __retres4=2147483647, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L80] return (__retres4); VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=33554432, \result=2147483647, __retres4=2147483647, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L253] RET, EXPR base2flt(mb, eb) VAL [a=2147483647, base2flt(mb, eb)=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, tmp=1, zero=0] [L263] sa = tmp VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=2147483647, b=2147483647, ea=-126, eb=-1, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [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)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L94] COND FALSE !(a < b) VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L101] COND FALSE !(! b) VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L109] (int )(a >> 24U) - 128 VAL [\old(a)=2147483647, \old(b)=2147483647, a=2147483647, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] - UnprovableResult [Line: 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 3 procedures, 142 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4403 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4323 mSDsluCounter, 18585 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15009 mSDsCounter, 476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5048 IncrementalHoareTripleChecker+Invalid, 5524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 476 mSolverCounterUnsat, 3576 mSDtfsCounter, 5048 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1522 GetRequests, 1207 SyntacticMatches, 11 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=26, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 2022 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1725 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2046 ConstructedInterpolants, 0 QuantifiedInterpolants, 5555 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2433 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 55 InterpolantComputations, 20 PerfectInterpolantSequences, 594/743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 00:46:41,055 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