./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-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-?-6c24879 [2022-07-13 02:15:12,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:15:12,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:15:12,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:15:12,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:15:12,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:15:12,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:15:12,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:15:12,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:15:12,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:15:12,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:15:12,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:15:12,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:15:12,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:15:12,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:15:12,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:15:12,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:15:12,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:15:12,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:15:12,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:15:12,331 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:15:12,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:15:12,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:15:12,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:15:12,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:15:12,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:15:12,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:15:12,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:15:12,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:15:12,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:15:12,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:15:12,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:15:12,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:15:12,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:15:12,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:15:12,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:15:12,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:15:12,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:15:12,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:15:12,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:15:12,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:15:12,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:15:12,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-13 02:15:12,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:15:12,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:15:12,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:15:12,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:15:12,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:15:12,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:15:12,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:15:12,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:15:12,376 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:15:12,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:15:12,376 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:15:12,376 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:15:12,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:15:12,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:15:12,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:15:12,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:15:12,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:15:12,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:15:12,377 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:15:12,377 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:15:12,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:15:12,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:15:12,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:15:12,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:15:12,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:15:12,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:15:12,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:12,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:15:12,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:15:12,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:15:12,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:15:12,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:15:12,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:15:12,379 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-13 02:15:12,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:15:12,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:15:12,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:15:12,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:15:12,585 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:15:12,586 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-13 02:15:12,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3f08e4a/f0fb0c4a410441e5875ac2c9cf1c20fb/FLAG1a9794dfc [2022-07-13 02:15:12,992 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:15:12,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-13 02:15:13,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3f08e4a/f0fb0c4a410441e5875ac2c9cf1c20fb/FLAG1a9794dfc [2022-07-13 02:15:13,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3f08e4a/f0fb0c4a410441e5875ac2c9cf1c20fb [2022-07-13 02:15:13,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:15:13,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:15:13,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:13,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:15:13,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:15:13,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771c54c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13, skipping insertion in model container [2022-07-13 02:15:13,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:15:13,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:15:13,574 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-13 02:15:13,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:13,628 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:15:13,638 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-13 02:15:13,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:13,675 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:15:13,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13 WrapperNode [2022-07-13 02:15:13,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:13,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:13,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:15:13,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:15:13,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,732 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 225 [2022-07-13 02:15:13,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:13,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:15:13,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:15:13,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:15:13,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:15:13,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:15:13,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:15:13,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:15:13,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (1/1) ... [2022-07-13 02:15:13,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:13,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 02:15:13,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 02:15:13,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:15:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 02:15:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 02:15:13,877 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 02:15:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:15:13,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:15:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 02:15:13,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 02:15:13,949 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:15:13,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:15:14,265 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:15:14,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:15:14,270 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 02:15:14,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:14 BoogieIcfgContainer [2022-07-13 02:15:14,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:15:14,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:15:14,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:15:14,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:15:14,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:15:13" (1/3) ... [2022-07-13 02:15:14,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfeaa7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:14, skipping insertion in model container [2022-07-13 02:15:14,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:13" (2/3) ... [2022-07-13 02:15:14,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfeaa7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:14, skipping insertion in model container [2022-07-13 02:15:14,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:14" (3/3) ... [2022-07-13 02:15:14,284 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-07-13 02:15:14,297 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:15:14,297 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-13 02:15:14,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:15:14,354 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@7f13f0bb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@181b17e4 [2022-07-13 02:15:14,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-13 02:15:14,360 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-13 02:15:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:14,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:14,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:14,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1345103503, now seen corresponding path program 1 times [2022-07-13 02:15:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:14,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250791752] [2022-07-13 02:15:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:14,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250791752] [2022-07-13 02:15:14,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250791752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:14,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:14,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:15:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759925607] [2022-07-13 02:15:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 02:15:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 02:15:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:14,510 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-13 02:15:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:14,562 INFO L93 Difference]: Finished difference Result 279 states and 433 transitions. [2022-07-13 02:15:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 02:15:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 02:15:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:14,571 INFO L225 Difference]: With dead ends: 279 [2022-07-13 02:15:14,572 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 02:15:14,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:14,577 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-13 02:15:14,579 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-13 02:15:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 02:15:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-13 02:15:14,612 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-13 02:15:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 137 transitions. [2022-07-13 02:15:14,614 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 137 transitions. Word has length 9 [2022-07-13 02:15:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:14,615 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 137 transitions. [2022-07-13 02:15:14,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2022-07-13 02:15:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:14,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:14,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:14,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:15:14,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1344162155, now seen corresponding path program 1 times [2022-07-13 02:15:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:14,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085833294] [2022-07-13 02:15:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:14,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:14,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085833294] [2022-07-13 02:15:14,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085833294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:14,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:14,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723383479] [2022-07-13 02:15:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:14,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:14,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:14,670 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-13 02:15:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:14,750 INFO L93 Difference]: Finished difference Result 273 states and 365 transitions. [2022-07-13 02:15:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:14,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 02:15:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:14,753 INFO L225 Difference]: With dead ends: 273 [2022-07-13 02:15:14,753 INFO L226 Difference]: Without dead ends: 169 [2022-07-13 02:15:14,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:14,754 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 106 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 02:15:14,755 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-13 02:15:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-13 02:15:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2022-07-13 02:15:14,765 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-13 02:15:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 212 transitions. [2022-07-13 02:15:14,766 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 212 transitions. Word has length 9 [2022-07-13 02:15:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:14,766 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 212 transitions. [2022-07-13 02:15:14,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 212 transitions. [2022-07-13 02:15:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 02:15:14,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:14,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:14,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:15:14,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 466647620, now seen corresponding path program 1 times [2022-07-13 02:15:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:14,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949936296] [2022-07-13 02:15:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:14,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949936296] [2022-07-13 02:15:14,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949936296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:14,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:14,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580171735] [2022-07-13 02:15:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:14,808 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-13 02:15:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:14,938 INFO L93 Difference]: Finished difference Result 191 states and 251 transitions. [2022-07-13 02:15:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 02:15:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:14,943 INFO L225 Difference]: With dead ends: 191 [2022-07-13 02:15:14,943 INFO L226 Difference]: Without dead ends: 188 [2022-07-13 02:15:14,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:14,951 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-13 02:15:14,953 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-13 02:15:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-13 02:15:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2022-07-13 02:15:14,968 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-13 02:15:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2022-07-13 02:15:14,969 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 223 transitions. Word has length 13 [2022-07-13 02:15:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:14,969 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 223 transitions. [2022-07-13 02:15:14,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 223 transitions. [2022-07-13 02:15:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 02:15:14,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:14,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:14,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 02:15:14,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:14,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:14,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1581174453, now seen corresponding path program 1 times [2022-07-13 02:15:14,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:14,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586333635] [2022-07-13 02:15:14,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:14,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:15,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586333635] [2022-07-13 02:15:15,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586333635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:15,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:15,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956835594] [2022-07-13 02:15:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:15,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:15,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:15,019 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-13 02:15:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:15,132 INFO L93 Difference]: Finished difference Result 306 states and 404 transitions. [2022-07-13 02:15:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:15,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-13 02:15:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:15,134 INFO L225 Difference]: With dead ends: 306 [2022-07-13 02:15:15,134 INFO L226 Difference]: Without dead ends: 198 [2022-07-13 02:15:15,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:15,137 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-13 02:15:15,137 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-13 02:15:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-13 02:15:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2022-07-13 02:15:15,151 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-13 02:15:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 226 transitions. [2022-07-13 02:15:15,152 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 226 transitions. Word has length 14 [2022-07-13 02:15:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:15,152 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 226 transitions. [2022-07-13 02:15:15,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 226 transitions. [2022-07-13 02:15:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:15:15,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:15,153 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:15,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 02:15:15,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1172920179, now seen corresponding path program 1 times [2022-07-13 02:15:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:15,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435559532] [2022-07-13 02:15:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:15,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435559532] [2022-07-13 02:15:15,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435559532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107309773] [2022-07-13 02:15:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:15,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:15,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 02:15:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:15,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:15,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:15,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107309773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:15,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:15,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431756233] [2022-07-13 02:15:15,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:15,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:15,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:15,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:15,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:15,312 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-13 02:15:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:15,390 INFO L93 Difference]: Finished difference Result 237 states and 323 transitions. [2022-07-13 02:15:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-13 02:15:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:15,392 INFO L225 Difference]: With dead ends: 237 [2022-07-13 02:15:15,392 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 02:15:15,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:15,393 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 188 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 02:15:15,393 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-13 02:15:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 02:15:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 203. [2022-07-13 02:15:15,400 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-13 02:15:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2022-07-13 02:15:15,401 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 16 [2022-07-13 02:15:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:15,402 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2022-07-13 02:15:15,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2022-07-13 02:15:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 02:15:15,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:15,403 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:15,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:15,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:15,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:15,613 INFO L85 PathProgramCache]: Analyzing trace with hash 153036525, now seen corresponding path program 1 times [2022-07-13 02:15:15,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:15,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486595231] [2022-07-13 02:15:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:15,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486595231] [2022-07-13 02:15:15,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486595231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:15,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357054593] [2022-07-13 02:15:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:15,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:15,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 02:15:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:15:15,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:15,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:15,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357054593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:15,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:15,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 02:15:15,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789526038] [2022-07-13 02:15:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:15,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:15,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:15,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:15,701 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-13 02:15:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:15,742 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2022-07-13 02:15:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-13 02:15:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:15,744 INFO L225 Difference]: With dead ends: 255 [2022-07-13 02:15:15,744 INFO L226 Difference]: Without dead ends: 253 [2022-07-13 02:15:15,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:15,745 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-13 02:15:15,745 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-13 02:15:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-13 02:15:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 196. [2022-07-13 02:15:15,751 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-13 02:15:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 271 transitions. [2022-07-13 02:15:15,752 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 271 transitions. Word has length 15 [2022-07-13 02:15:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:15,752 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 271 transitions. [2022-07-13 02:15:15,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 271 transitions. [2022-07-13 02:15:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 02:15:15,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:15,753 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:15,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:15,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 02:15:15,970 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:15,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2000787238, now seen corresponding path program 1 times [2022-07-13 02:15:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:15,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295238111] [2022-07-13 02:15:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:15:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:16,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295238111] [2022-07-13 02:15:16,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295238111] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:16,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708185997] [2022-07-13 02:15:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:16,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:16,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:16,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 02:15:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 02:15:16,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 02:15:16,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:16,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708185997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:16,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:16,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-13 02:15:16,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20071310] [2022-07-13 02:15:16,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:16,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:15:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:16,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:15:16,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:16,048 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-13 02:15:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:16,075 INFO L93 Difference]: Finished difference Result 205 states and 280 transitions. [2022-07-13 02:15:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:15:16,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-13 02:15:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:16,076 INFO L225 Difference]: With dead ends: 205 [2022-07-13 02:15:16,076 INFO L226 Difference]: Without dead ends: 204 [2022-07-13 02:15:16,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:16,077 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-13 02:15:16,077 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-13 02:15:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-13 02:15:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2022-07-13 02:15:16,083 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-13 02:15:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 266 transitions. [2022-07-13 02:15:16,084 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 266 transitions. Word has length 17 [2022-07-13 02:15:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:16,084 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 266 transitions. [2022-07-13 02:15:16,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 266 transitions. [2022-07-13 02:15:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:15:16,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:16,089 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:16,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:16,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:16,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1512656933, now seen corresponding path program 1 times [2022-07-13 02:15:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:16,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012429899] [2022-07-13 02:15:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:16,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012429899] [2022-07-13 02:15:16,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012429899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:16,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034102374] [2022-07-13 02:15:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:16,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:16,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 02:15:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:16,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:16,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:16,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034102374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:16,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:16,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269616347] [2022-07-13 02:15:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:16,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:16,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:16,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:16,424 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-13 02:15:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:16,487 INFO L93 Difference]: Finished difference Result 236 states and 320 transitions. [2022-07-13 02:15:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:16,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-13 02:15:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:16,489 INFO L225 Difference]: With dead ends: 236 [2022-07-13 02:15:16,489 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 02:15:16,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:16,490 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:16,490 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.0s Time] [2022-07-13 02:15:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 02:15:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 201. [2022-07-13 02:15:16,497 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-13 02:15:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 277 transitions. [2022-07-13 02:15:16,498 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 277 transitions. Word has length 18 [2022-07-13 02:15:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:16,498 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 277 transitions. [2022-07-13 02:15:16,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 02:15:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 277 transitions. [2022-07-13 02:15:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:15:16,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:16,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:16,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:16,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:16,715 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1085205661, now seen corresponding path program 1 times [2022-07-13 02:15:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:16,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511362482] [2022-07-13 02:15:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 02:15:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:16,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511362482] [2022-07-13 02:15:16,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511362482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:16,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:16,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830892472] [2022-07-13 02:15:16,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:16,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:16,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:16,743 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-13 02:15:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:16,798 INFO L93 Difference]: Finished difference Result 256 states and 353 transitions. [2022-07-13 02:15:16,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:16,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 02:15:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:16,800 INFO L225 Difference]: With dead ends: 256 [2022-07-13 02:15:16,800 INFO L226 Difference]: Without dead ends: 254 [2022-07-13 02:15:16,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:16,801 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-13 02:15:16,801 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-13 02:15:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-13 02:15:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2022-07-13 02:15:16,808 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-13 02:15:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 275 transitions. [2022-07-13 02:15:16,809 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 275 transitions. Word has length 19 [2022-07-13 02:15:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:16,810 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 275 transitions. [2022-07-13 02:15:16,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 275 transitions. [2022-07-13 02:15:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 02:15:16,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:16,811 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:16,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 02:15:16,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:16,812 INFO L85 PathProgramCache]: Analyzing trace with hash 928226989, now seen corresponding path program 1 times [2022-07-13 02:15:16,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:16,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578000793] [2022-07-13 02:15:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:16,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578000793] [2022-07-13 02:15:16,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578000793] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:16,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515963177] [2022-07-13 02:15:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:16,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:16,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:16,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:16,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 02:15:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:16,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:16,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:16,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:16,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515963177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:16,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:16,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764518419] [2022-07-13 02:15:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:16,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:16,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:16,945 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-13 02:15:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:17,007 INFO L93 Difference]: Finished difference Result 231 states and 316 transitions. [2022-07-13 02:15:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:17,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-07-13 02:15:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:17,009 INFO L225 Difference]: With dead ends: 231 [2022-07-13 02:15:17,010 INFO L226 Difference]: Without dead ends: 228 [2022-07-13 02:15:17,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:17,011 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:17,012 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.0s Time] [2022-07-13 02:15:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-13 02:15:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 189. [2022-07-13 02:15:17,018 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-13 02:15:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 255 transitions. [2022-07-13 02:15:17,020 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 255 transitions. Word has length 23 [2022-07-13 02:15:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:17,021 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 255 transitions. [2022-07-13 02:15:17,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 02:15:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 255 transitions. [2022-07-13 02:15:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 02:15:17,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:17,022 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:17,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:17,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 02:15:17,232 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -439611243, now seen corresponding path program 1 times [2022-07-13 02:15:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:17,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224685867] [2022-07-13 02:15:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:17,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224685867] [2022-07-13 02:15:17,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224685867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:17,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109158208] [2022-07-13 02:15:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:17,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:17,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 02:15:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:17,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:17,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:17,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109158208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:17,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:17,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:17,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125203820] [2022-07-13 02:15:17,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:17,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:17,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:17,337 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-13 02:15:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:17,394 INFO L93 Difference]: Finished difference Result 219 states and 295 transitions. [2022-07-13 02:15:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-13 02:15:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:17,396 INFO L225 Difference]: With dead ends: 219 [2022-07-13 02:15:17,396 INFO L226 Difference]: Without dead ends: 216 [2022-07-13 02:15:17,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:17,396 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:17,397 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.0s Time] [2022-07-13 02:15:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-13 02:15:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2022-07-13 02:15:17,405 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-13 02:15:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 240 transitions. [2022-07-13 02:15:17,406 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 240 transitions. Word has length 25 [2022-07-13 02:15:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:17,406 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 240 transitions. [2022-07-13 02:15:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 02:15:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 240 transitions. [2022-07-13 02:15:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 02:15:17,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:17,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:17,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:17,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:17,620 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash -853587819, now seen corresponding path program 1 times [2022-07-13 02:15:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:17,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478223143] [2022-07-13 02:15:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:17,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478223143] [2022-07-13 02:15:17,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478223143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:17,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:17,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 02:15:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233246662] [2022-07-13 02:15:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:17,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:15:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:17,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:15:17,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:15:17,709 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-13 02:15:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:17,813 INFO L93 Difference]: Finished difference Result 330 states and 425 transitions. [2022-07-13 02:15:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:15:17,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-13 02:15:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:17,814 INFO L225 Difference]: With dead ends: 330 [2022-07-13 02:15:17,814 INFO L226 Difference]: Without dead ends: 260 [2022-07-13 02:15:17,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:17,815 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-13 02:15:17,815 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-13 02:15:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-13 02:15:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 180. [2022-07-13 02:15:17,822 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-13 02:15:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2022-07-13 02:15:17,822 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 31 [2022-07-13 02:15:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:17,823 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2022-07-13 02:15:17,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2022-07-13 02:15:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 02:15:17,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:17,824 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:17,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 02:15:17,824 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1244113542, now seen corresponding path program 1 times [2022-07-13 02:15:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:17,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157641169] [2022-07-13 02:15:17,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:17,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:17,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157641169] [2022-07-13 02:15:17,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157641169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:17,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223172323] [2022-07-13 02:15:17,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:17,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:17,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:17,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:17,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 02:15:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:17,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:17,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:18,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 02:15:18,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223172323] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:18,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 02:15:18,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 13 [2022-07-13 02:15:18,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184760555] [2022-07-13 02:15:18,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:18,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:18,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:18,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:18,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:15:18,076 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-13 02:15:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:18,092 INFO L93 Difference]: Finished difference Result 232 states and 299 transitions. [2022-07-13 02:15:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:18,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-07-13 02:15:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:18,094 INFO L225 Difference]: With dead ends: 232 [2022-07-13 02:15:18,094 INFO L226 Difference]: Without dead ends: 181 [2022-07-13 02:15:18,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:15:18,095 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-13 02:15:18,095 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-13 02:15:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-13 02:15:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2022-07-13 02:15:18,101 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-13 02:15:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 239 transitions. [2022-07-13 02:15:18,101 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 239 transitions. Word has length 35 [2022-07-13 02:15:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:18,102 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 239 transitions. [2022-07-13 02:15:18,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2022-07-13 02:15:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 02:15:18,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:18,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:18,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:18,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:18,315 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2136066482, now seen corresponding path program 1 times [2022-07-13 02:15:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:18,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76881362] [2022-07-13 02:15:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76881362] [2022-07-13 02:15:18,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76881362] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397263033] [2022-07-13 02:15:18,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:18,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:18,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:18,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 02:15:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 02:15:18,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:18,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:18,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397263033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:18,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:18,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-13 02:15:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41600234] [2022-07-13 02:15:18,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:18,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 02:15:18,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 02:15:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:18,529 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-13 02:15:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:18,739 INFO L93 Difference]: Finished difference Result 450 states and 564 transitions. [2022-07-13 02:15:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 02:15:18,740 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-07-13 02:15:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:18,741 INFO L225 Difference]: With dead ends: 450 [2022-07-13 02:15:18,741 INFO L226 Difference]: Without dead ends: 386 [2022-07-13 02:15:18,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-13 02:15:18,742 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 307 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 02:15:18,742 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-13 02:15:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-13 02:15:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 194. [2022-07-13 02:15:18,749 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-13 02:15:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-07-13 02:15:18,750 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 38 [2022-07-13 02:15:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:18,750 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-07-13 02:15:18,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:15:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-07-13 02:15:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 02:15:18,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:18,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:18,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:18,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 02:15:18,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1326719856, now seen corresponding path program 1 times [2022-07-13 02:15:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:18,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383851570] [2022-07-13 02:15:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:18,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:18,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:19,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383851570] [2022-07-13 02:15:19,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383851570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385673732] [2022-07-13 02:15:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:19,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:19,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:19,032 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:19,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 02:15:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 02:15:19,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 02:15:19,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:15:19,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385673732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:19,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:19,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-07-13 02:15:19,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102574728] [2022-07-13 02:15:19,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:19,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 02:15:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:19,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 02:15:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-13 02:15:19,267 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-13 02:15:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:19,703 INFO L93 Difference]: Finished difference Result 490 states and 643 transitions. [2022-07-13 02:15:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 02:15:19,704 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2022-07-13 02:15:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:19,705 INFO L225 Difference]: With dead ends: 490 [2022-07-13 02:15:19,705 INFO L226 Difference]: Without dead ends: 280 [2022-07-13 02:15:19,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-07-13 02:15:19,706 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 198 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:19,706 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.3s Time] [2022-07-13 02:15:19,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-13 02:15:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 135. [2022-07-13 02:15:19,714 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-13 02:15:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2022-07-13 02:15:19,714 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 38 [2022-07-13 02:15:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:19,714 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2022-07-13 02:15:19,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2022-07-13 02:15:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 02:15:19,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:19,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:19,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:19,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 02:15:19,924 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1749175167, now seen corresponding path program 2 times [2022-07-13 02:15:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:19,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921303723] [2022-07-13 02:15:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:19,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921303723] [2022-07-13 02:15:19,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921303723] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:19,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994409933] [2022-07-13 02:15:19,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:19,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:19,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:19,989 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:19,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 02:15:20,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 02:15:20,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:20,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:20,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:20,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:20,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994409933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:20,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:20,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-13 02:15:20,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648800570] [2022-07-13 02:15:20,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:15:20,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:15:20,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:20,070 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-13 02:15:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:20,104 INFO L93 Difference]: Finished difference Result 260 states and 320 transitions. [2022-07-13 02:15:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:20,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-07-13 02:15:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:20,105 INFO L225 Difference]: With dead ends: 260 [2022-07-13 02:15:20,105 INFO L226 Difference]: Without dead ends: 202 [2022-07-13 02:15:20,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:15:20,106 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-13 02:15:20,106 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-13 02:15:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-13 02:15:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 143. [2022-07-13 02:15:20,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-13 02:15:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 182 transitions. [2022-07-13 02:15:20,113 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 182 transitions. Word has length 42 [2022-07-13 02:15:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:20,113 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 182 transitions. [2022-07-13 02:15:20,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 182 transitions. [2022-07-13 02:15:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 02:15:20,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,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-13 02:15:20,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:20,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-13 02:15:20,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-13 02:15:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1287754489, now seen corresponding path program 1 times [2022-07-13 02:15:20,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:20,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246121189] [2022-07-13 02:15:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:20,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:20,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246121189] [2022-07-13 02:15:20,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246121189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:20,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099866535] [2022-07-13 02:15:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:20,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:20,408 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:20,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 02:15:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:15:20,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 02:15:20,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:20,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099866535] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:20,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:20,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-07-13 02:15:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763426327] [2022-07-13 02:15:20,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 02:15:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 02:15:20,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:20,588 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-13 02:15:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:20,887 INFO L93 Difference]: Finished difference Result 306 states and 392 transitions. [2022-07-13 02:15:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 02:15:20,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-07-13 02:15:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:20,888 INFO L225 Difference]: With dead ends: 306 [2022-07-13 02:15:20,888 INFO L226 Difference]: Without dead ends: 244 [2022-07-13 02:15:20,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-07-13 02:15:20,889 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 313 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 02:15:20,889 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-13 02:15:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-13 02:15:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 135. [2022-07-13 02:15:20,896 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-13 02:15:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2022-07-13 02:15:20,897 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 44 [2022-07-13 02:15:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:20,897 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2022-07-13 02:15:20,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:15:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2022-07-13 02:15:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 02:15:20,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:21,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 02:15:21,112 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:21,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1203752287, now seen corresponding path program 1 times [2022-07-13 02:15:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44411223] [2022-07-13 02:15:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 02:15:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:21,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44411223] [2022-07-13 02:15:21,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44411223] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:21,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450903552] [2022-07-13 02:15:21,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:21,221 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:21,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 02:15:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 02:15:21,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:21,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 02:15:21,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450903552] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:21,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:21,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2022-07-13 02:15:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917399439] [2022-07-13 02:15:21,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 02:15:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 02:15:21,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-13 02:15:21,530 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-13 02:15:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,778 INFO L93 Difference]: Finished difference Result 283 states and 350 transitions. [2022-07-13 02:15:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:15:21,778 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-07-13 02:15:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,779 INFO L225 Difference]: With dead ends: 283 [2022-07-13 02:15:21,779 INFO L226 Difference]: Without dead ends: 227 [2022-07-13 02:15:21,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:15:21,780 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-13 02:15:21,780 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-13 02:15:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-13 02:15:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-07-13 02:15:21,790 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-13 02:15:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2022-07-13 02:15:21,791 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 46 [2022-07-13 02:15:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,791 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2022-07-13 02:15:21,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 02:15:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2022-07-13 02:15:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 02:15:21,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:22,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 02:15:22,007 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:22,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash -760986112, now seen corresponding path program 1 times [2022-07-13 02:15:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937508060] [2022-07-13 02:15:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 02:15:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937508060] [2022-07-13 02:15:22,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937508060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984399775] [2022-07-13 02:15:22,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,052 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:22,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 02:15:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 02:15:22,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:22,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:22,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984399775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:22,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:22,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-07-13 02:15:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384643045] [2022-07-13 02:15:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:15:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:15:22,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:22,136 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-13 02:15:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,172 INFO L93 Difference]: Finished difference Result 296 states and 370 transitions. [2022-07-13 02:15:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:15:22,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-07-13 02:15:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,173 INFO L225 Difference]: With dead ends: 296 [2022-07-13 02:15:22,173 INFO L226 Difference]: Without dead ends: 180 [2022-07-13 02:15:22,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:22,174 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-13 02:15:22,175 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-13 02:15:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-13 02:15:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2022-07-13 02:15:22,184 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-13 02:15:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 204 transitions. [2022-07-13 02:15:22,185 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 204 transitions. Word has length 52 [2022-07-13 02:15:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,185 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 204 transitions. [2022-07-13 02:15:22,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2022-07-13 02:15:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 02:15:22,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:22,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:22,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,407 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1055930893, now seen corresponding path program 1 times [2022-07-13 02:15:22,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898261627] [2022-07-13 02:15:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:22,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898261627] [2022-07-13 02:15:22,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898261627] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149965933] [2022-07-13 02:15:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,497 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:22,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 02:15:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 02:15:22,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:22,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:22,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149965933] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:22,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:22,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-07-13 02:15:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315709249] [2022-07-13 02:15:22,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:15:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:15:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:15:22,644 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-13 02:15:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,845 INFO L93 Difference]: Finished difference Result 419 states and 508 transitions. [2022-07-13 02:15:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 02:15:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-07-13 02:15:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,847 INFO L225 Difference]: With dead ends: 419 [2022-07-13 02:15:22,847 INFO L226 Difference]: Without dead ends: 368 [2022-07-13 02:15:22,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:22,848 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-13 02:15:22,848 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-13 02:15:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-13 02:15:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 186. [2022-07-13 02:15:22,861 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-13 02:15:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 228 transitions. [2022-07-13 02:15:22,862 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 228 transitions. Word has length 53 [2022-07-13 02:15:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,862 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 228 transitions. [2022-07-13 02:15:22,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 228 transitions. [2022-07-13 02:15:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 02:15:22,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,863 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:22,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:23,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,072 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1055928971, now seen corresponding path program 1 times [2022-07-13 02:15:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:23,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683449573] [2022-07-13 02:15:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683449573] [2022-07-13 02:15:23,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683449573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:23,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669052903] [2022-07-13 02:15:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:23,125 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:23,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 02:15:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 02:15:23,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:23,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:23,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669052903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:23,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:23,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-07-13 02:15:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163543477] [2022-07-13 02:15:23,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:23,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 02:15:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:23,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 02:15:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-13 02:15:23,412 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-13 02:15:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:24,056 INFO L93 Difference]: Finished difference Result 544 states and 679 transitions. [2022-07-13 02:15:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 02:15:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-07-13 02:15:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:24,058 INFO L225 Difference]: With dead ends: 544 [2022-07-13 02:15:24,058 INFO L226 Difference]: Without dead ends: 488 [2022-07-13 02:15:24,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 02:15:24,059 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 562 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-13 02:15:24,059 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-13 02:15:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-07-13 02:15:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 201. [2022-07-13 02:15:24,070 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-13 02:15:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2022-07-13 02:15:24,070 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 53 [2022-07-13 02:15:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:24,071 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2022-07-13 02:15:24,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2022-07-13 02:15:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 02:15:24,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:24,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:24,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:24,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,288 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:24,288 INFO L85 PathProgramCache]: Analyzing trace with hash -246584267, now seen corresponding path program 1 times [2022-07-13 02:15:24,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:24,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752356386] [2022-07-13 02:15:24,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752356386] [2022-07-13 02:15:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752356386] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076469557] [2022-07-13 02:15:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:24,383 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:24,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 02:15:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:24,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:15:24,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 02:15:24,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:24,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076469557] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:24,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:24,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 20 [2022-07-13 02:15:24,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262798600] [2022-07-13 02:15:24,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:24,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 02:15:24,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 02:15:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:15:24,655 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-13 02:15:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,315 INFO L93 Difference]: Finished difference Result 436 states and 552 transitions. [2022-07-13 02:15:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 02:15:25,315 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-07-13 02:15:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,316 INFO L225 Difference]: With dead ends: 436 [2022-07-13 02:15:25,316 INFO L226 Difference]: Without dead ends: 346 [2022-07-13 02:15:25,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 02:15:25,317 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 175 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-13 02:15:25,318 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-13 02:15:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-13 02:15:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 186. [2022-07-13 02:15:25,326 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-13 02:15:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2022-07-13 02:15:25,327 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 53 [2022-07-13 02:15:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,327 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2022-07-13 02:15:25,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-07-13 02:15:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 02:15:25,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:25,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:25,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 02:15:25,539 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash 239613636, now seen corresponding path program 1 times [2022-07-13 02:15:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720803435] [2022-07-13 02:15:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 02:15:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 02:15:25,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720803435] [2022-07-13 02:15:25,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720803435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:25,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376697180] [2022-07-13 02:15:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:25,593 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:25,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 02:15:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:25,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:25,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:25,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376697180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:25,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:25,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-13 02:15:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934092652] [2022-07-13 02:15:25,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:25,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:25,660 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-13 02:15:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,715 INFO L93 Difference]: Finished difference Result 411 states and 523 transitions. [2022-07-13 02:15:25,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:25,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-07-13 02:15:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,716 INFO L225 Difference]: With dead ends: 411 [2022-07-13 02:15:25,716 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 02:15:25,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:25,717 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:25,717 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.0s Time] [2022-07-13 02:15:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 02:15:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 212. [2022-07-13 02:15:25,726 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-13 02:15:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 259 transitions. [2022-07-13 02:15:25,727 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 259 transitions. Word has length 53 [2022-07-13 02:15:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,727 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 259 transitions. [2022-07-13 02:15:25,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 259 transitions. [2022-07-13 02:15:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 02:15:25,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:25,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:25,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,945 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1225098171, now seen corresponding path program 1 times [2022-07-13 02:15:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494715646] [2022-07-13 02:15:25,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 02:15:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494715646] [2022-07-13 02:15:25,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494715646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666803691] [2022-07-13 02:15:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:25,996 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:25,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 02:15:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 02:15:26,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:26,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:26,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666803691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:26,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:26,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-13 02:15:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647722239] [2022-07-13 02:15:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:26,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:26,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:26,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:26,060 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-13 02:15:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:26,103 INFO L93 Difference]: Finished difference Result 385 states and 477 transitions. [2022-07-13 02:15:26,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:15:26,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-07-13 02:15:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:26,104 INFO L225 Difference]: With dead ends: 385 [2022-07-13 02:15:26,104 INFO L226 Difference]: Without dead ends: 237 [2022-07-13 02:15:26,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:26,105 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-13 02:15:26,106 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-13 02:15:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-13 02:15:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 208. [2022-07-13 02:15:26,115 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-13 02:15:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 256 transitions. [2022-07-13 02:15:26,116 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 256 transitions. Word has length 54 [2022-07-13 02:15:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:26,116 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 256 transitions. [2022-07-13 02:15:26,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 02:15:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 256 transitions. [2022-07-13 02:15:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 02:15:26,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:26,121 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:26,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:26,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:26,338 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:26,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1756937806, now seen corresponding path program 1 times [2022-07-13 02:15:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:26,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223394621] [2022-07-13 02:15:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:26,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223394621] [2022-07-13 02:15:26,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223394621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:26,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:26,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 02:15:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497710589] [2022-07-13 02:15:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:26,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 02:15:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 02:15:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:15:26,510 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-13 02:15:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:26,822 INFO L93 Difference]: Finished difference Result 390 states and 475 transitions. [2022-07-13 02:15:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:15:26,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-07-13 02:15:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:26,824 INFO L225 Difference]: With dead ends: 390 [2022-07-13 02:15:26,824 INFO L226 Difference]: Without dead ends: 389 [2022-07-13 02:15:26,824 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-13 02:15:26,825 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-13 02:15:26,825 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-13 02:15:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-13 02:15:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 234. [2022-07-13 02:15:26,839 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-13 02:15:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-07-13 02:15:26,841 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 55 [2022-07-13 02:15:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:26,841 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-07-13 02:15:26,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-07-13 02:15:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 02:15:26,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:26,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:26,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 02:15:26,843 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:26,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1728682864, now seen corresponding path program 1 times [2022-07-13 02:15:26,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:26,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834630422] [2022-07-13 02:15:26,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:26,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:26,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834630422] [2022-07-13 02:15:26,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834630422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:26,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:26,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 02:15:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331231182] [2022-07-13 02:15:26,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:26,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:15:26,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:26,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:15:26,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:15:26,945 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-13 02:15:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:27,142 INFO L93 Difference]: Finished difference Result 429 states and 523 transitions. [2022-07-13 02:15:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:15:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-07-13 02:15:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:27,144 INFO L225 Difference]: With dead ends: 429 [2022-07-13 02:15:27,144 INFO L226 Difference]: Without dead ends: 378 [2022-07-13 02:15:27,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:27,144 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:27,144 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.1s Time] [2022-07-13 02:15:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-07-13 02:15:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 258. [2022-07-13 02:15:27,169 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-13 02:15:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 318 transitions. [2022-07-13 02:15:27,170 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 318 transitions. Word has length 55 [2022-07-13 02:15:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:27,170 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 318 transitions. [2022-07-13 02:15:27,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 318 transitions. [2022-07-13 02:15:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 02:15:27,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:27,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:27,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 02:15:27,172 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:27,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash -129424594, now seen corresponding path program 1 times [2022-07-13 02:15:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:27,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467771374] [2022-07-13 02:15:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 02:15:27,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:27,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467771374] [2022-07-13 02:15:27,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467771374] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:27,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071983457] [2022-07-13 02:15:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:27,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:27,292 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:27,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 02:15:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 02:15:27,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 02:15:27,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 02:15:27,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071983457] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:27,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 02:15:27,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 21 [2022-07-13 02:15:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219068163] [2022-07-13 02:15:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:27,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:15:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:15:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-07-13 02:15:27,606 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-13 02:15:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:27,711 INFO L93 Difference]: Finished difference Result 402 states and 487 transitions. [2022-07-13 02:15:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:15:27,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-07-13 02:15:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:27,713 INFO L225 Difference]: With dead ends: 402 [2022-07-13 02:15:27,713 INFO L226 Difference]: Without dead ends: 291 [2022-07-13 02:15:27,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-07-13 02:15:27,714 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:27,715 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.0s Time] [2022-07-13 02:15:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-13 02:15:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2022-07-13 02:15:27,739 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-13 02:15:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2022-07-13 02:15:27,740 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 62 [2022-07-13 02:15:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:27,741 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2022-07-13 02:15:27,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2022-07-13 02:15:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 02:15:27,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:27,742 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:27,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:27,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:27,959 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-07-13 02:15:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1579288781, now seen corresponding path program 1 times [2022-07-13 02:15:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:27,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636947306] [2022-07-13 02:15:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:27,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:15:27,985 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 02:15:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:15:28,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 02:15:28,043 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 02:15:28,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2022-07-13 02:15:28,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2022-07-13 02:15:28,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2022-07-13 02:15:28,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2022-07-13 02:15:28,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2022-07-13 02:15:28,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2022-07-13 02:15:28,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2022-07-13 02:15:28,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2022-07-13 02:15:28,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2022-07-13 02:15:28,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2022-07-13 02:15:28,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2022-07-13 02:15:28,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2022-07-13 02:15:28,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2022-07-13 02:15:28,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2022-07-13 02:15:28,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2022-07-13 02:15:28,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2022-07-13 02:15:28,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2022-07-13 02:15:28,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2022-07-13 02:15:28,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2022-07-13 02:15:28,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2022-07-13 02:15:28,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 02:15:28,064 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:28,066 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 02:15:28,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:15:28 BoogieIcfgContainer [2022-07-13 02:15:28,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 02:15:28,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 02:15:28,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 02:15:28,107 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 02:15:28,113 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:14" (3/4) ... [2022-07-13 02:15:28,115 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 02:15:28,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 02:15:28,116 INFO L158 Benchmark]: Toolchain (without parser) took 14698.95ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 57.3MB in the beginning and 141.5MB in the end (delta: -84.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:15:28,116 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:15:28,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.91ms. Allocated memory is still 96.5MB. Free memory was 57.1MB in the beginning and 68.3MB in the end (delta: -11.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 02:15:28,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.26ms. Allocated memory is still 96.5MB. Free memory was 68.3MB in the beginning and 65.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:15:28,117 INFO L158 Benchmark]: Boogie Preprocessor took 56.77ms. Allocated memory is still 96.5MB. Free memory was 65.9MB in the beginning and 64.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:15:28,117 INFO L158 Benchmark]: RCFGBuilder took 481.54ms. Allocated memory is still 96.5MB. Free memory was 64.1MB in the beginning and 42.2MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-13 02:15:28,117 INFO L158 Benchmark]: TraceAbstraction took 13833.10ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 41.6MB in the beginning and 141.5MB in the end (delta: -99.8MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2022-07-13 02:15:28,117 INFO L158 Benchmark]: Witness Printer took 9.19ms. Allocated memory is still 172.0MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:15:28,118 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.91ms. Allocated memory is still 96.5MB. Free memory was 57.1MB in the beginning and 68.3MB in the end (delta: -11.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.26ms. Allocated memory is still 96.5MB. Free memory was 68.3MB in the beginning and 65.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.77ms. Allocated memory is still 96.5MB. Free memory was 65.9MB in the beginning and 64.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.54ms. Allocated memory is still 96.5MB. Free memory was 64.1MB in the beginning and 42.2MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13833.10ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 41.6MB in the beginning and 141.5MB in the end (delta: -99.8MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. * Witness Printer took 9.19ms. Allocated memory is still 172.0MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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: 13.7s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4403 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4323 mSDsluCounter, 18585 SdHoareTripleChecker+Invalid, 2.2s 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.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=26, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 2022 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1725 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2046 ConstructedInterpolants, 0 QuantifiedInterpolants, 5555 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2433 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 55 InterpolantComputations, 20 PerfectInterpolantSequences, 594/743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 02:15:28,136 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