./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 26d01a9c 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_5.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 dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:42:20,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:42:20,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:42:20,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:42:20,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:42:20,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:42:20,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:42:20,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:42:20,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:42:20,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:42:20,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:42:20,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:42:20,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:42:20,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:42:20,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:42:20,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:42:20,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:42:20,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:42:20,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:42:20,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:42:20,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:42:20,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:42:20,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:42:20,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:42:20,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:42:20,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:42:20,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:42:20,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:42:20,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:42:20,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:42:20,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:42:20,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:42:20,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:42:20,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:42:20,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:42:20,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:42:20,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:42:20,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:42:20,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:42:20,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:42:20,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:42:20,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-18 07:42:20,589 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:42:20,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:42:20,589 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:42:20,590 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:42:20,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:42:20,590 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:42:20,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:42:20,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:42:20,591 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:42:20,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:42:20,592 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 07:42:20,592 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:42:20,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 07:42:20,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 07:42:20,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:42:20,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 07:42:20,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:42:20,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 07:42:20,593 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 07:42:20,593 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 07:42:20,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 07:42:20,594 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:42:20,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 07:42:20,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:42:20,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:42:20,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:42:20,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:20,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:42:20,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:42:20,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 07:42:20,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 07:42:20,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 07:42:20,596 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:42:20,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 07:42:20,596 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:42:20,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:42:20,596 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:42:20,597 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2023-02-18 07:42:20,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:42:20,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:42:20,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:42:20,802 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:42:20,802 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:42:20,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2023-02-18 07:42:21,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:42:22,013 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:42:22,014 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2023-02-18 07:42:22,020 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29bd5c2d/7bd744dec3cf4de2a5a78b86b5452225/FLAG99a616003 [2023-02-18 07:42:22,412 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29bd5c2d/7bd744dec3cf4de2a5a78b86b5452225 [2023-02-18 07:42:22,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:42:22,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:42:22,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:22,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:42:22,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:42:22,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aaba96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22, skipping insertion in model container [2023-02-18 07:42:22,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:42:22,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:42:22,553 WARN L237 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_5.c.cil.c[727,740] [2023-02-18 07:42:22,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:22,592 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:42:22,600 WARN L237 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_5.c.cil.c[727,740] [2023-02-18 07:42:22,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:22,644 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:42:22,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22 WrapperNode [2023-02-18 07:42:22,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:22,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:22,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:42:22,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:42:22,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,674 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181 [2023-02-18 07:42:22,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:22,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:42:22,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:42:22,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:42:22,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,693 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:42:22,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:42:22,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:42:22,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:42:22,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (1/1) ... [2023-02-18 07:42:22,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:22,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:22,745 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) [2023-02-18 07:42:22,750 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 [2023-02-18 07:42:22,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:42:22,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 07:42:22,775 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-18 07:42:22,775 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-18 07:42:22,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:42:22,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:42:22,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 07:42:22,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 07:42:22,821 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:42:22,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:42:23,249 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:42:23,255 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:42:23,258 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 07:42:23,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:23 BoogieIcfgContainer [2023-02-18 07:42:23,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:42:23,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:42:23,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:42:23,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:42:23,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:42:22" (1/3) ... [2023-02-18 07:42:23,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f214dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:23, skipping insertion in model container [2023-02-18 07:42:23,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:22" (2/3) ... [2023-02-18 07:42:23,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f214dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:23, skipping insertion in model container [2023-02-18 07:42:23,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:23" (3/3) ... [2023-02-18 07:42:23,279 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2023-02-18 07:42:23,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:42:23,291 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-18 07:42:23,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:42:23,343 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ed57431, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:42:23,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-18 07:42:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 90 states have (on average 1.7) internal successors, (153), 115 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 07:42:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:42:23,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:23,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:23,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1548318721, now seen corresponding path program 1 times [2023-02-18 07:42:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:23,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401363813] [2023-02-18 07:42:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:23,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401363813] [2023-02-18 07:42:23,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401363813] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:23,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:23,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:42:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832693707] [2023-02-18 07:42:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:23,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:23,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:23,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:23,586 INFO L87 Difference]: Start difference. First operand has 122 states, 90 states have (on average 1.7) internal successors, (153), 115 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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) [2023-02-18 07:42:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:23,721 INFO L93 Difference]: Finished difference Result 296 states and 415 transitions. [2023-02-18 07:42:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:23,723 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 [2023-02-18 07:42:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:23,732 INFO L225 Difference]: With dead ends: 296 [2023-02-18 07:42:23,732 INFO L226 Difference]: Without dead ends: 158 [2023-02-18 07:42:23,737 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 [2023-02-18 07:42:23,740 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 87 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:23,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 412 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-18 07:42:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2023-02-18 07:42:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 138 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2023-02-18 07:42:23,772 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 9 [2023-02-18 07:42:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:23,772 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2023-02-18 07:42:23,772 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) [2023-02-18 07:42:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2023-02-18 07:42:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 07:42:23,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:23,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:23,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 07:42:23,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:23,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1386908481, now seen corresponding path program 1 times [2023-02-18 07:42:23,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:23,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657608601] [2023-02-18 07:42:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:23,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657608601] [2023-02-18 07:42:23,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657608601] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:23,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:23,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580610362] [2023-02-18 07:42:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:23,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:23,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:23,869 INFO L87 Difference]: Start difference. First operand 145 states and 190 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) [2023-02-18 07:42:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:23,967 INFO L93 Difference]: Finished difference Result 321 states and 419 transitions. [2023-02-18 07:42:23,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:23,968 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 [2023-02-18 07:42:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:23,971 INFO L225 Difference]: With dead ends: 321 [2023-02-18 07:42:23,972 INFO L226 Difference]: Without dead ends: 179 [2023-02-18 07:42:23,976 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 [2023-02-18 07:42:23,979 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 157 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:23,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 339 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-18 07:42:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2023-02-18 07:42:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 131 states have (on average 1.534351145038168) internal successors, (201), 152 states have internal predecessors, (201), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2023-02-18 07:42:23,999 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 14 [2023-02-18 07:42:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:24,000 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2023-02-18 07:42:24,000 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) [2023-02-18 07:42:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2023-02-18 07:42:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 07:42:24,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:24,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:24,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 07:42:24,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:24,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:24,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1595006381, now seen corresponding path program 1 times [2023-02-18 07:42:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:24,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711784972] [2023-02-18 07:42:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:24,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:24,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:24,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711784972] [2023-02-18 07:42:24,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711784972] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:24,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:24,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031847870] [2023-02-18 07:42:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:24,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:24,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:24,062 INFO L87 Difference]: Start difference. First operand 159 states and 209 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2023-02-18 07:42:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:24,097 INFO L93 Difference]: Finished difference Result 320 states and 420 transitions. [2023-02-18 07:42:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:24,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 [2023-02-18 07:42:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:24,098 INFO L225 Difference]: With dead ends: 320 [2023-02-18 07:42:24,099 INFO L226 Difference]: Without dead ends: 164 [2023-02-18 07:42:24,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:24,105 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 7 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:24,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 345 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-18 07:42:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-02-18 07:42:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.5185185185185186) internal successors, (205), 156 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2023-02-18 07:42:24,123 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 15 [2023-02-18 07:42:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:24,123 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2023-02-18 07:42:24,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2023-02-18 07:42:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2023-02-18 07:42:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 07:42:24,124 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:24,125 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:24,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 07:42:24,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:24,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 814606369, now seen corresponding path program 1 times [2023-02-18 07:42:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:24,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109884307] [2023-02-18 07:42:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:24,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109884307] [2023-02-18 07:42:24,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109884307] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:24,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:24,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:42:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328815853] [2023-02-18 07:42:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:24,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:42:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:42:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:42:24,157 INFO L87 Difference]: Start difference. First operand 164 states and 213 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:24,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:24,184 INFO L93 Difference]: Finished difference Result 170 states and 220 transitions. [2023-02-18 07:42:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:42:24,185 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, (3), 1 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 [2023-02-18 07:42:24,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:24,186 INFO L225 Difference]: With dead ends: 170 [2023-02-18 07:42:24,186 INFO L226 Difference]: Without dead ends: 169 [2023-02-18 07:42:24,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:42:24,191 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:24,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-18 07:42:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2023-02-18 07:42:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 134 states have (on average 1.507462686567164) internal successors, (202), 154 states have internal predecessors, (202), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 210 transitions. [2023-02-18 07:42:24,209 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 210 transitions. Word has length 23 [2023-02-18 07:42:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:24,209 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 210 transitions. [2023-02-18 07:42:24,209 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 210 transitions. [2023-02-18 07:42:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 07:42:24,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:24,212 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:24,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 07:42:24,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash 486151468, now seen corresponding path program 1 times [2023-02-18 07:42:24,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:24,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869484393] [2023-02-18 07:42:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:24,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869484393] [2023-02-18 07:42:24,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869484393] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:24,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:24,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:24,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943646683] [2023-02-18 07:42:24,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:24,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:24,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:24,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:24,294 INFO L87 Difference]: Start difference. First operand 162 states and 210 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2023-02-18 07:42:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:24,327 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2023-02-18 07:42:24,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2023-02-18 07:42:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:24,332 INFO L225 Difference]: With dead ends: 277 [2023-02-18 07:42:24,332 INFO L226 Difference]: Without dead ends: 150 [2023-02-18 07:42:24,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:24,333 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 41 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:24,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 345 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-18 07:42:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-18 07:42:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 136 states have internal predecessors, (176), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2023-02-18 07:42:24,352 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 22 [2023-02-18 07:42:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:24,352 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2023-02-18 07:42:24,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2023-02-18 07:42:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2023-02-18 07:42:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 07:42:24,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:24,353 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:24,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 07:42:24,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2125647912, now seen corresponding path program 1 times [2023-02-18 07:42:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:24,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220558310] [2023-02-18 07:42:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:24,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:24,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220558310] [2023-02-18 07:42:24,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220558310] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:24,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:24,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191599702] [2023-02-18 07:42:24,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:24,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:24,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:24,401 INFO L87 Difference]: Start difference. First operand 144 states and 184 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-02-18 07:42:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:24,454 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2023-02-18 07:42:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:24,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 22 [2023-02-18 07:42:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:24,455 INFO L225 Difference]: With dead ends: 153 [2023-02-18 07:42:24,455 INFO L226 Difference]: Without dead ends: 150 [2023-02-18 07:42:24,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:42:24,456 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 69 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:24,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 422 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-18 07:42:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-18 07:42:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 136 states have internal predecessors, (171), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2023-02-18 07:42:24,463 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 22 [2023-02-18 07:42:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:24,463 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2023-02-18 07:42:24,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-02-18 07:42:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2023-02-18 07:42:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 07:42:24,464 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:24,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:24,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 07:42:24,465 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1249763114, now seen corresponding path program 1 times [2023-02-18 07:42:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:24,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444696932] [2023-02-18 07:42:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 07:42:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:24,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444696932] [2023-02-18 07:42:24,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444696932] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:24,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:24,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:42:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833966087] [2023-02-18 07:42:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:24,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:24,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:24,527 INFO L87 Difference]: Start difference. First operand 144 states and 179 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2023-02-18 07:42:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:24,556 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2023-02-18 07:42:24,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:24,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 26 [2023-02-18 07:42:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:24,558 INFO L225 Difference]: With dead ends: 165 [2023-02-18 07:42:24,558 INFO L226 Difference]: Without dead ends: 162 [2023-02-18 07:42:24,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:24,559 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 24 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:24,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 227 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-18 07:42:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2023-02-18 07:42:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.4426229508196722) internal successors, (176), 141 states have internal predecessors, (176), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2023-02-18 07:42:24,563 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 26 [2023-02-18 07:42:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:24,564 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2023-02-18 07:42:24,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2023-02-18 07:42:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2023-02-18 07:42:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 07:42:24,564 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:24,565 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:24,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 07:42:24,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:24,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -465994842, now seen corresponding path program 1 times [2023-02-18 07:42:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:24,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511880654] [2023-02-18 07:42:24,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511880654] [2023-02-18 07:42:24,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511880654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909786620] [2023-02-18 07:42:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:24,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:24,628 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) [2023-02-18 07:42:24,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 07:42:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:42:24,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:24,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:24,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909786620] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:24,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:24,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-18 07:42:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559839077] [2023-02-18 07:42:24,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:24,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 07:42:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:24,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 07:42:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:24,776 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:25,021 INFO L93 Difference]: Finished difference Result 505 states and 650 transitions. [2023-02-18 07:42:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 07:42:25,021 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-18 07:42:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:25,023 INFO L225 Difference]: With dead ends: 505 [2023-02-18 07:42:25,023 INFO L226 Difference]: Without dead ends: 397 [2023-02-18 07:42:25,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2023-02-18 07:42:25,024 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 329 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:25,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 568 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-18 07:42:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 169. [2023-02-18 07:42:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.408450704225352) internal successors, (200), 161 states have internal predecessors, (200), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 208 transitions. [2023-02-18 07:42:25,033 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 208 transitions. Word has length 37 [2023-02-18 07:42:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:25,034 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 208 transitions. [2023-02-18 07:42:25,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 208 transitions. [2023-02-18 07:42:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 07:42:25,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:25,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:25,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:25,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:25,242 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:25,243 INFO L85 PathProgramCache]: Analyzing trace with hash -767991458, now seen corresponding path program 1 times [2023-02-18 07:42:25,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:25,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973985012] [2023-02-18 07:42:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:25,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 07:42:25,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:25,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973985012] [2023-02-18 07:42:25,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973985012] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:25,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:25,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916972249] [2023-02-18 07:42:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:25,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:25,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:25,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:25,278 INFO L87 Difference]: Start difference. First operand 169 states and 208 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2023-02-18 07:42:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:25,334 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2023-02-18 07:42:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2023-02-18 07:42:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:25,336 INFO L225 Difference]: With dead ends: 220 [2023-02-18 07:42:25,336 INFO L226 Difference]: Without dead ends: 217 [2023-02-18 07:42:25,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:25,337 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 155 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:25,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 344 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-18 07:42:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 196. [2023-02-18 07:42:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 168 states have (on average 1.4285714285714286) internal successors, (240), 187 states have internal predecessors, (240), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2023-02-18 07:42:25,353 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 39 [2023-02-18 07:42:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:25,353 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2023-02-18 07:42:25,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2023-02-18 07:42:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2023-02-18 07:42:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 07:42:25,354 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:25,355 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-02-18 07:42:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 07:42:25,355 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash -796618814, now seen corresponding path program 1 times [2023-02-18 07:42:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:25,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46193638] [2023-02-18 07:42:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 07:42:25,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:25,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46193638] [2023-02-18 07:42:25,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46193638] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:25,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:25,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:25,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980363275] [2023-02-18 07:42:25,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:25,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:25,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:25,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:25,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:25,392 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2023-02-18 07:42:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:25,448 INFO L93 Difference]: Finished difference Result 218 states and 271 transitions. [2023-02-18 07:42:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:25,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2023-02-18 07:42:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:25,450 INFO L225 Difference]: With dead ends: 218 [2023-02-18 07:42:25,450 INFO L226 Difference]: Without dead ends: 215 [2023-02-18 07:42:25,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:25,451 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 162 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:25,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 332 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-18 07:42:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2023-02-18 07:42:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 175 states have (on average 1.4114285714285715) internal successors, (247), 193 states have internal predecessors, (247), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 255 transitions. [2023-02-18 07:42:25,458 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 255 transitions. Word has length 39 [2023-02-18 07:42:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:25,458 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 255 transitions. [2023-02-18 07:42:25,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2023-02-18 07:42:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 255 transitions. [2023-02-18 07:42:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 07:42:25,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:25,459 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-02-18 07:42:25,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 07:42:25,460 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash -739732565, now seen corresponding path program 1 times [2023-02-18 07:42:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:25,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140913323] [2023-02-18 07:42:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:25,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:25,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140913323] [2023-02-18 07:42:25,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140913323] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:25,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:25,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 07:42:25,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093624223] [2023-02-18 07:42:25,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:25,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:25,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:25,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:25,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:25,518 INFO L87 Difference]: Start difference. First operand 202 states and 255 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:25,591 INFO L93 Difference]: Finished difference Result 432 states and 549 transitions. [2023-02-18 07:42:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:25,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-02-18 07:42:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:25,593 INFO L225 Difference]: With dead ends: 432 [2023-02-18 07:42:25,593 INFO L226 Difference]: Without dead ends: 285 [2023-02-18 07:42:25,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:25,594 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 57 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:25,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 301 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-02-18 07:42:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 202. [2023-02-18 07:42:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 175 states have (on average 1.4057142857142857) internal successors, (246), 193 states have internal predecessors, (246), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2023-02-18 07:42:25,602 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 44 [2023-02-18 07:42:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:25,602 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2023-02-18 07:42:25,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2023-02-18 07:42:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-18 07:42:25,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:25,603 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-02-18 07:42:25,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 07:42:25,603 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:25,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash -994209911, now seen corresponding path program 1 times [2023-02-18 07:42:25,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:25,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139220252] [2023-02-18 07:42:25,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:25,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139220252] [2023-02-18 07:42:25,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139220252] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:25,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826446141] [2023-02-18 07:42:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:25,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:25,702 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) [2023-02-18 07:42:25,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 07:42:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:42:25,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:25,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:25,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826446141] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:25,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:25,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-18 07:42:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593408708] [2023-02-18 07:42:25,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:25,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 07:42:25,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:25,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 07:42:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:42:25,955 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:26,211 INFO L93 Difference]: Finished difference Result 534 states and 677 transitions. [2023-02-18 07:42:26,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 07:42:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-18 07:42:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:26,214 INFO L225 Difference]: With dead ends: 534 [2023-02-18 07:42:26,214 INFO L226 Difference]: Without dead ends: 373 [2023-02-18 07:42:26,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 16 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-02-18 07:42:26,214 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 156 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:26,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 628 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-02-18 07:42:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 192. [2023-02-18 07:42:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 165 states have (on average 1.387878787878788) internal successors, (229), 183 states have internal predecessors, (229), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2023-02-18 07:42:26,226 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 49 [2023-02-18 07:42:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:26,226 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2023-02-18 07:42:26,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2023-02-18 07:42:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-18 07:42:26,227 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:26,227 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 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] [2023-02-18 07:42:26,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:26,435 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,SelfDestructingSolverStorable11 [2023-02-18 07:42:26,435 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1453329379, now seen corresponding path program 1 times [2023-02-18 07:42:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:26,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549751816] [2023-02-18 07:42:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:26,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549751816] [2023-02-18 07:42:26,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549751816] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:26,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709528463] [2023-02-18 07:42:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:26,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:26,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:26,581 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) [2023-02-18 07:42:26,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 07:42:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:42:26,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:26,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:26,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709528463] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:26,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:26,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-18 07:42:26,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212726354] [2023-02-18 07:42:26,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:26,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 07:42:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:26,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 07:42:26,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-18 07:42:26,747 INFO L87 Difference]: Start difference. First operand 192 states and 237 transitions. Second operand has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:27,198 INFO L93 Difference]: Finished difference Result 1152 states and 1491 transitions. [2023-02-18 07:42:27,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-18 07:42:27,198 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2023-02-18 07:42:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:27,202 INFO L225 Difference]: With dead ends: 1152 [2023-02-18 07:42:27,202 INFO L226 Difference]: Without dead ends: 1011 [2023-02-18 07:42:27,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=740, Invalid=1152, Unknown=0, NotChecked=0, Total=1892 [2023-02-18 07:42:27,203 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 881 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:27,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 980 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:42:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-02-18 07:42:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 242. [2023-02-18 07:42:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 233 states have internal predecessors, (290), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 298 transitions. [2023-02-18 07:42:27,220 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 298 transitions. Word has length 62 [2023-02-18 07:42:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:27,221 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 298 transitions. [2023-02-18 07:42:27,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 298 transitions. [2023-02-18 07:42:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-18 07:42:27,221 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:27,221 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 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] [2023-02-18 07:42:27,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 07:42:27,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:27,427 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash -420611575, now seen corresponding path program 2 times [2023-02-18 07:42:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:27,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735714306] [2023-02-18 07:42:27,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:27,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735714306] [2023-02-18 07:42:27,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735714306] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:27,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525867551] [2023-02-18 07:42:27,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:42:27,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:27,616 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) [2023-02-18 07:42:27,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 07:42:27,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:42:27,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:27,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:42:27,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:27,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:28,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525867551] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:28,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:28,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-18 07:42:28,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195833588] [2023-02-18 07:42:28,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:28,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 07:42:28,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:28,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 07:42:28,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-18 07:42:28,080 INFO L87 Difference]: Start difference. First operand 242 states and 298 transitions. Second operand has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:29,202 INFO L93 Difference]: Finished difference Result 734 states and 929 transitions. [2023-02-18 07:42:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 07:42:29,202 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2023-02-18 07:42:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:29,204 INFO L225 Difference]: With dead ends: 734 [2023-02-18 07:42:29,204 INFO L226 Difference]: Without dead ends: 573 [2023-02-18 07:42:29,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 118 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=504, Invalid=902, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 07:42:29,205 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 347 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:29,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1737 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 07:42:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-02-18 07:42:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 232. [2023-02-18 07:42:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 223 states have internal predecessors, (269), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 277 transitions. [2023-02-18 07:42:29,218 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 277 transitions. Word has length 69 [2023-02-18 07:42:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:29,219 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 277 transitions. [2023-02-18 07:42:29,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 277 transitions. [2023-02-18 07:42:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-18 07:42:29,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:29,220 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 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] [2023-02-18 07:42:29,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 07:42:29,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:29,425 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1581803805, now seen corresponding path program 2 times [2023-02-18 07:42:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:29,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220824437] [2023-02-18 07:42:29,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:29,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:29,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220824437] [2023-02-18 07:42:29,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220824437] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:29,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573386853] [2023-02-18 07:42:29,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:42:29,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:29,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:29,684 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) [2023-02-18 07:42:29,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 07:42:29,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:42:29,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:29,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:42:29,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:29,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:30,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573386853] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:30,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:30,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-18 07:42:30,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748429447] [2023-02-18 07:42:30,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:30,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 07:42:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 07:42:30,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 07:42:30,179 INFO L87 Difference]: Start difference. First operand 232 states and 277 transitions. Second operand has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:31,509 INFO L93 Difference]: Finished difference Result 2040 states and 2659 transitions. [2023-02-18 07:42:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-02-18 07:42:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2023-02-18 07:42:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:31,515 INFO L225 Difference]: With dead ends: 2040 [2023-02-18 07:42:31,515 INFO L226 Difference]: Without dead ends: 1899 [2023-02-18 07:42:31,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2696, Invalid=4276, Unknown=0, NotChecked=0, Total=6972 [2023-02-18 07:42:31,517 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1787 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:31,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 1329 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 07:42:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2023-02-18 07:42:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 322. [2023-02-18 07:42:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 295 states have (on average 1.2813559322033898) internal successors, (378), 313 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 386 transitions. [2023-02-18 07:42:31,544 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 386 transitions. Word has length 102 [2023-02-18 07:42:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:31,544 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 386 transitions. [2023-02-18 07:42:31,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 386 transitions. [2023-02-18 07:42:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-18 07:42:31,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:31,549 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 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] [2023-02-18 07:42:31,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 07:42:31,756 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,SelfDestructingSolverStorable14 [2023-02-18 07:42:31,758 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:31,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2024534263, now seen corresponding path program 3 times [2023-02-18 07:42:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:31,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134512124] [2023-02-18 07:42:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:32,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134512124] [2023-02-18 07:42:32,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134512124] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:32,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376438741] [2023-02-18 07:42:32,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 07:42:32,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:32,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:32,140 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) [2023-02-18 07:42:32,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 07:42:40,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-02-18 07:42:40,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:40,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 07:42:40,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:40,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:41,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376438741] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:41,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:41,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2023-02-18 07:42:41,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994970627] [2023-02-18 07:42:41,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:41,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-18 07:42:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-18 07:42:41,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=1735, Unknown=0, NotChecked=0, Total=2352 [2023-02-18 07:42:41,949 INFO L87 Difference]: Start difference. First operand 322 states and 386 transitions. Second operand has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:45,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:42:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:53,477 INFO L93 Difference]: Finished difference Result 1054 states and 1332 transitions. [2023-02-18 07:42:53,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-18 07:42:53,478 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 109 [2023-02-18 07:42:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:53,480 INFO L225 Difference]: With dead ends: 1054 [2023-02-18 07:42:53,481 INFO L226 Difference]: Without dead ends: 893 [2023-02-18 07:42:53,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 185 SyntacticMatches, 16 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1624, Invalid=3632, Unknown=0, NotChecked=0, Total=5256 [2023-02-18 07:42:53,482 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 941 mSDsluCounter, 3806 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 4025 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:53,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 4025 Invalid, 3194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-02-18 07:42:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-02-18 07:42:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 322. [2023-02-18 07:42:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 295 states have (on average 1.2474576271186442) internal successors, (368), 313 states have internal predecessors, (368), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 376 transitions. [2023-02-18 07:42:53,505 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 376 transitions. Word has length 109 [2023-02-18 07:42:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:53,505 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 376 transitions. [2023-02-18 07:42:53,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 376 transitions. [2023-02-18 07:42:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-02-18 07:42:53,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:53,506 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 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] [2023-02-18 07:42:53,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-18 07:42:53,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 07:42:53,730 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash 528449865, now seen corresponding path program 4 times [2023-02-18 07:42:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:53,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250683093] [2023-02-18 07:42:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:53,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:42:53,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 07:42:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:42:53,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 07:42:53,796 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 07:42:53,797 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-18 07:42:53,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-18 07:42:53,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-18 07:42:53,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-18 07:42:53,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-18 07:42:53,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-18 07:42:53,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-18 07:42:53,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-18 07:42:53,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-18 07:42:53,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-18 07:42:53,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-18 07:42:53,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-18 07:42:53,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-18 07:42:53,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-18 07:42:53,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-18 07:42:53,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-18 07:42:53,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-18 07:42:53,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-18 07:42:53,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-18 07:42:53,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-18 07:42:53,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-18 07:42:53,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-18 07:42:53,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-18 07:42:53,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-18 07:42:53,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 07:42:53,803 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:53,806 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 07:42:53,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:42:53 BoogieIcfgContainer [2023-02-18 07:42:53,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 07:42:53,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 07:42:53,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 07:42:53,867 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 07:42:53,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:23" (3/4) ... [2023-02-18 07:42:53,869 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 07:42:53,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 07:42:53,870 INFO L158 Benchmark]: Toolchain (without parser) took 31451.11ms. Allocated memory was 121.6MB in the beginning and 314.6MB in the end (delta: 192.9MB). Free memory was 84.6MB in the beginning and 254.1MB in the end (delta: -169.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-02-18 07:42:53,870 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 66.2MB in the beginning and 66.1MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:42:53,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.69ms. Allocated memory is still 121.6MB. Free memory was 84.6MB in the beginning and 70.9MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 07:42:53,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.35ms. Allocated memory is still 121.6MB. Free memory was 70.9MB in the beginning and 68.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:42:53,872 INFO L158 Benchmark]: Boogie Preprocessor took 21.00ms. Allocated memory is still 121.6MB. Free memory was 68.5MB in the beginning and 66.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:42:53,872 INFO L158 Benchmark]: RCFGBuilder took 576.31ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 66.8MB in the beginning and 119.2MB in the end (delta: -52.4MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2023-02-18 07:42:53,872 INFO L158 Benchmark]: TraceAbstraction took 30592.67ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 119.2MB in the beginning and 255.2MB in the end (delta: -135.9MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2023-02-18 07:42:53,872 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 314.6MB. Free memory was 255.2MB in the beginning and 254.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:42:53,875 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.14ms. Allocated memory is still 121.6MB. Free memory was 66.2MB in the beginning and 66.1MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.69ms. Allocated memory is still 121.6MB. Free memory was 84.6MB in the beginning and 70.9MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.35ms. Allocated memory is still 121.6MB. Free memory was 70.9MB in the beginning and 68.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.00ms. Allocated memory is still 121.6MB. Free memory was 68.5MB in the beginning and 66.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 576.31ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 66.8MB in the beginning and 119.2MB in the end (delta: -52.4MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30592.67ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 119.2MB in the beginning and 255.2MB in the end (delta: -135.9MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 314.6MB. Free memory was 255.2MB in the beginning and 254.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 77]: 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: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR (e + 128) << 24U VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464, e=-24, m=0, res=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=0, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] - 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: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: 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, 122 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 30.5s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5210 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5204 mSDsluCounter, 12561 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10586 mSDsCounter, 750 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6373 IncrementalHoareTripleChecker+Invalid, 7123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 750 mSolverCounterUnsat, 1975 mSDtfsCounter, 6373 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 817 SyntacticMatches, 56 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4205 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=15, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 3849 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1268 NumberOfCodeBlocks, 1268 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1509 ConstructedInterpolants, 0 QuantifiedInterpolants, 17117 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 304/3646 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 [2023-02-18 07:42:53,919 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 Retrying with bit-precise analysis ### Bit-precise run ### 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_5.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:42:55,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:42:55,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:42:55,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:42:55,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:42:55,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:42:55,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:42:55,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:42:55,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:42:55,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:42:55,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:42:55,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:42:55,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:42:55,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:42:55,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:42:55,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:42:55,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:42:55,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:42:55,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:42:55,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:42:55,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:42:55,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:42:55,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:42:55,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:42:55,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:42:55,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:42:55,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:42:55,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:42:55,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:42:55,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:42:55,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:42:55,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:42:55,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:42:55,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:42:55,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:42:55,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:42:55,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:42:55,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:42:55,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:42:55,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:42:55,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:42:55,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-18 07:42:55,868 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:42:55,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:42:55,869 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:42:55,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:42:55,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:42:55,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:42:55,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:42:55,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:42:55,871 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:42:55,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:42:55,872 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 07:42:55,872 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:42:55,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 07:42:55,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:42:55,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 07:42:55,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:42:55,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 07:42:55,873 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 07:42:55,873 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 07:42:55,873 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 07:42:55,873 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 07:42:55,873 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 07:42:55,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 07:42:55,874 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:42:55,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 07:42:55,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:42:55,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:42:55,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:42:55,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:55,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:42:55,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:42:55,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 07:42:55,875 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 07:42:55,876 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 07:42:55,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:42:55,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 07:42:55,876 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:42:55,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:42:55,876 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 07:42:55,877 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:42:55,877 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2023-02-18 07:42:56,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:42:56,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:42:56,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:42:56,143 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:42:56,143 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:42:56,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2023-02-18 07:42:57,266 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:42:57,536 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:42:57,536 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2023-02-18 07:42:57,549 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1180c0bc/c515cee67fa74786ac9547ddfc50a713/FLAG811ecb05e [2023-02-18 07:42:57,562 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1180c0bc/c515cee67fa74786ac9547ddfc50a713 [2023-02-18 07:42:57,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:42:57,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:42:57,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:57,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:42:57,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:42:57,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:57" (1/1) ... [2023-02-18 07:42:57,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c2234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:57, skipping insertion in model container [2023-02-18 07:42:57,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:57" (1/1) ... [2023-02-18 07:42:57,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:42:57,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:42:57,869 WARN L237 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_5.c.cil.c[727,740] [2023-02-18 07:42:57,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:57,977 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:42:58,009 WARN L237 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_5.c.cil.c[727,740] [2023-02-18 07:42:58,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:58,068 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:42:58,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58 WrapperNode [2023-02-18 07:42:58,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:58,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:58,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:42:58,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:42:58,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,151 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2023-02-18 07:42:58,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:58,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:42:58,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:42:58,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:42:58,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,219 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:42:58,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:42:58,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:42:58,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:42:58,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (1/1) ... [2023-02-18 07:42:58,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:58,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:58,295 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) [2023-02-18 07:42:58,326 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 [2023-02-18 07:42:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:42:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 07:42:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-18 07:42:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-18 07:42:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:42:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:42:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 07:42:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 07:42:58,450 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:42:58,451 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:42:58,767 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:42:58,772 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:42:58,772 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 07:42:58,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:58 BoogieIcfgContainer [2023-02-18 07:42:58,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:42:58,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:42:58,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:42:58,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:42:58,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:42:57" (1/3) ... [2023-02-18 07:42:58,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294bd167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:58, skipping insertion in model container [2023-02-18 07:42:58,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:58" (2/3) ... [2023-02-18 07:42:58,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294bd167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:58, skipping insertion in model container [2023-02-18 07:42:58,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:58" (3/3) ... [2023-02-18 07:42:58,779 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2023-02-18 07:42:58,795 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:42:58,795 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-18 07:42:58,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:42:58,842 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c5d6b5f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:42:58,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-18 07:42:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 92 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 07:42:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:42:58,851 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:58,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:58,852 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1525933714, now seen corresponding path program 1 times [2023-02-18 07:42:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:58,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142333996] [2023-02-18 07:42:58,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:58,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:58,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:58,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:58,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-18 07:42:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:58,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 07:42:58,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:58,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:58,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:58,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142333996] [2023-02-18 07:42:58,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142333996] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:58,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:58,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-18 07:42:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922493378] [2023-02-18 07:42:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:58,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 07:42:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:59,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 07:42:59,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:42:59,014 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 92 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 8.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) [2023-02-18 07:42:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:59,039 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2023-02-18 07:42:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 07:42:59,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.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 [2023-02-18 07:42:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:59,046 INFO L225 Difference]: With dead ends: 185 [2023-02-18 07:42:59,046 INFO L226 Difference]: Without dead ends: 73 [2023-02-18 07:42:59,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:42:59,051 INFO L413 NwaCegarLoop]: 109 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, 109 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 [2023-02-18 07:42:59,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-18 07:42:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-18 07:42:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 67 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2023-02-18 07:42:59,078 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 9 [2023-02-18 07:42:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:59,078 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2023-02-18 07:42:59,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.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) [2023-02-18 07:42:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2023-02-18 07:42:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:42:59,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:59,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:59,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:59,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:59,288 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1524992448, now seen corresponding path program 1 times [2023-02-18 07:42:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:59,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606656949] [2023-02-18 07:42:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:59,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:59,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:59,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-18 07:42:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:59,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:42:59,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:59,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:59,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:59,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606656949] [2023-02-18 07:42:59,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606656949] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:59,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:59,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:59,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986561575] [2023-02-18 07:42:59,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:59,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:59,391 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.0) 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) [2023-02-18 07:42:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:59,457 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2023-02-18 07:42:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:42:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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 [2023-02-18 07:42:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:59,460 INFO L225 Difference]: With dead ends: 151 [2023-02-18 07:42:59,461 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 07:42:59,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:59,468 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:59,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 232 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 07:42:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-02-18 07:42:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.396551724137931) internal successors, (81), 71 states have internal predecessors, (81), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-18 07:42:59,481 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 9 [2023-02-18 07:42:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:59,481 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-18 07:42:59,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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) [2023-02-18 07:42:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-18 07:42:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 07:42:59,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:59,482 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:59,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:59,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:59,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:42:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:59,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1370428688, now seen corresponding path program 1 times [2023-02-18 07:42:59,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:59,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105389926] [2023-02-18 07:42:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:59,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:59,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:59,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:59,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 07:42:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:59,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:42:59,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:59,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:59,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:59,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105389926] [2023-02-18 07:42:59,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105389926] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:59,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:59,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:42:59,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034769440] [2023-02-18 07:42:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:59,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:59,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:59,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:59,742 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2023-02-18 07:42:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:59,809 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2023-02-18 07:42:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:59,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 [2023-02-18 07:42:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:59,811 INFO L225 Difference]: With dead ends: 193 [2023-02-18 07:42:59,811 INFO L226 Difference]: Without dead ends: 125 [2023-02-18 07:42:59,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:59,813 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 67 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:59,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 214 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-18 07:42:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2023-02-18 07:42:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 106 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2023-02-18 07:42:59,822 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 16 [2023-02-18 07:42:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:59,823 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2023-02-18 07:42:59,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2023-02-18 07:42:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2023-02-18 07:42:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 07:42:59,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:59,824 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:59,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:00,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1635050763, now seen corresponding path program 1 times [2023-02-18 07:43:00,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:00,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647461936] [2023-02-18 07:43:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:00,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:00,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:00,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-18 07:43:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:00,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:43:00,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:00,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:00,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:00,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647461936] [2023-02-18 07:43:00,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647461936] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:00,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:00,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:43:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252137535] [2023-02-18 07:43:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:00,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:43:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:43:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:43:00,090 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2023-02-18 07:43:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:00,123 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2023-02-18 07:43:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:43:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2023-02-18 07:43:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:00,125 INFO L225 Difference]: With dead ends: 197 [2023-02-18 07:43:00,125 INFO L226 Difference]: Without dead ends: 104 [2023-02-18 07:43:00,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:43:00,126 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:00,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 235 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:43:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-18 07:43:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-02-18 07:43:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 90 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-02-18 07:43:00,133 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 21 [2023-02-18 07:43:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:00,134 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-02-18 07:43:00,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2023-02-18 07:43:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-02-18 07:43:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 07:43:00,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:00,134 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:00,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:00,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1476687918, now seen corresponding path program 1 times [2023-02-18 07:43:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:00,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879783729] [2023-02-18 07:43:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:00,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:00,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:00,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-18 07:43:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:00,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:43:00,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:00,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:00,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:00,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879783729] [2023-02-18 07:43:00,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879783729] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:00,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:00,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 07:43:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804038913] [2023-02-18 07:43:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:00,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:43:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:00,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:43:00,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:43:00,425 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2023-02-18 07:43:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:00,491 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2023-02-18 07:43:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:43:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 21 [2023-02-18 07:43:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:00,492 INFO L225 Difference]: With dead ends: 190 [2023-02-18 07:43:00,492 INFO L226 Difference]: Without dead ends: 113 [2023-02-18 07:43:00,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:43:00,493 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 44 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:00,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 310 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:43:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-18 07:43:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2023-02-18 07:43:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 92 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2023-02-18 07:43:00,513 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 21 [2023-02-18 07:43:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:00,513 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2023-02-18 07:43:00,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2023-02-18 07:43:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2023-02-18 07:43:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 07:43:00,514 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:00,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:00,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:00,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1476578814, now seen corresponding path program 1 times [2023-02-18 07:43:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:00,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212278733] [2023-02-18 07:43:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:00,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:00,723 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:00,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 07:43:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:00,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:43:00,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:00,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:00,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:00,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212278733] [2023-02-18 07:43:00,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212278733] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:00,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:00,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-18 07:43:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898191217] [2023-02-18 07:43:00,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:00,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:43:00,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:00,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:43:00,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:43:00,802 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:01,113 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2023-02-18 07:43:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:43:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-18 07:43:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:01,114 INFO L225 Difference]: With dead ends: 217 [2023-02-18 07:43:01,114 INFO L226 Difference]: Without dead ends: 146 [2023-02-18 07:43:01,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-02-18 07:43:01,115 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 192 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:01,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 320 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:43:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-18 07:43:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2023-02-18 07:43:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.345679012345679) internal successors, (109), 93 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2023-02-18 07:43:01,123 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 21 [2023-02-18 07:43:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:01,123 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2023-02-18 07:43:01,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2023-02-18 07:43:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 07:43:01,124 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:01,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:01,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:01,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:01,331 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -547019776, now seen corresponding path program 1 times [2023-02-18 07:43:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:01,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250667581] [2023-02-18 07:43:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:01,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:01,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:01,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-18 07:43:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:01,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:43:01,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:01,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:01,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:01,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250667581] [2023-02-18 07:43:01,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250667581] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:01,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:01,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 07:43:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745520974] [2023-02-18 07:43:01,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:01,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:43:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:43:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:43:01,405 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:01,527 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2023-02-18 07:43:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 07:43:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-18 07:43:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:01,529 INFO L225 Difference]: With dead ends: 217 [2023-02-18 07:43:01,529 INFO L226 Difference]: Without dead ends: 141 [2023-02-18 07:43:01,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2023-02-18 07:43:01,531 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 155 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:01,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 447 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-18 07:43:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2023-02-18 07:43:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 111 states have internal predecessors, (130), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2023-02-18 07:43:01,550 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 26 [2023-02-18 07:43:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:01,550 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2023-02-18 07:43:01,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2023-02-18 07:43:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 07:43:01,551 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:01,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-18 07:43:01,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:01,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:01,758 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:01,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash -198921976, now seen corresponding path program 1 times [2023-02-18 07:43:01,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:01,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83300067] [2023-02-18 07:43:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:01,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:01,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:01,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:01,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-18 07:43:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:01,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:43:01,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:01,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:01,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:01,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83300067] [2023-02-18 07:43:01,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83300067] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:01,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:01,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 07:43:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843640241] [2023-02-18 07:43:01,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:01,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:43:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:43:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:43:01,865 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:02,243 INFO L93 Difference]: Finished difference Result 307 states and 370 transitions. [2023-02-18 07:43:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 07:43:02,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-02-18 07:43:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:02,244 INFO L225 Difference]: With dead ends: 307 [2023-02-18 07:43:02,245 INFO L226 Difference]: Without dead ends: 234 [2023-02-18 07:43:02,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-18 07:43:02,246 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 155 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:02,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 427 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:43:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-18 07:43:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 121. [2023-02-18 07:43:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 113 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2023-02-18 07:43:02,257 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 38 [2023-02-18 07:43:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:02,257 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2023-02-18 07:43:02,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2023-02-18 07:43:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 07:43:02,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:02,258 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:02,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:02,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:02,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1144709760, now seen corresponding path program 2 times [2023-02-18 07:43:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:02,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309109575] [2023-02-18 07:43:02,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:43:02,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:02,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:02,467 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:02,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 07:43:02,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:43:02,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:02,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 07:43:02,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:02,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:02,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:02,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309109575] [2023-02-18 07:43:02,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309109575] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:02,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:02,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-18 07:43:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954610022] [2023-02-18 07:43:02,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:02,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 07:43:02,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 07:43:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-02-18 07:43:02,645 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:02,998 INFO L93 Difference]: Finished difference Result 275 states and 320 transitions. [2023-02-18 07:43:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 07:43:02,998 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-18 07:43:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:02,999 INFO L225 Difference]: With dead ends: 275 [2023-02-18 07:43:03,000 INFO L226 Difference]: Without dead ends: 199 [2023-02-18 07:43:03,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 07:43:03,001 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 238 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:03,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 992 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-18 07:43:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2023-02-18 07:43:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 151 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2023-02-18 07:43:03,011 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 46 [2023-02-18 07:43:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:03,012 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2023-02-18 07:43:03,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2023-02-18 07:43:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:43:03,013 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:03,013 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:03,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:03,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:03,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:03,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:03,221 INFO L85 PathProgramCache]: Analyzing trace with hash -321230200, now seen corresponding path program 2 times [2023-02-18 07:43:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:03,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771670164] [2023-02-18 07:43:03,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:43:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:03,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:03,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:03,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 07:43:03,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:43:03,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:03,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 07:43:03,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-18 07:43:03,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:03,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771670164] [2023-02-18 07:43:03,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771670164] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:03,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:03,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:43:03,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884108582] [2023-02-18 07:43:03,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:03,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:43:03,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:03,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:43:03,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:43:03,267 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:43:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:03,291 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2023-02-18 07:43:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:43:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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 58 [2023-02-18 07:43:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:03,292 INFO L225 Difference]: With dead ends: 165 [2023-02-18 07:43:03,292 INFO L226 Difference]: Without dead ends: 164 [2023-02-18 07:43:03,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:43:03,293 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:03,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 152 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:43:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-18 07:43:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2023-02-18 07:43:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 150 states have internal predecessors, (173), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2023-02-18 07:43:03,301 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 58 [2023-02-18 07:43:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:03,301 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2023-02-18 07:43:03,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:43:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2023-02-18 07:43:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:43:03,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:03,302 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:03,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:03,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:03,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash -321162674, now seen corresponding path program 1 times [2023-02-18 07:43:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:03,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651343980] [2023-02-18 07:43:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:03,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:03,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:03,510 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:03,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-18 07:43:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:03,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:43:03,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:03,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:03,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:03,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651343980] [2023-02-18 07:43:03,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651343980] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:03,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:03,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-18 07:43:03,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93846335] [2023-02-18 07:43:03,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:03,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 07:43:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:03,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 07:43:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-18 07:43:03,828 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:05,294 INFO L93 Difference]: Finished difference Result 484 states and 595 transitions. [2023-02-18 07:43:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 07:43:05,294 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2023-02-18 07:43:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:05,298 INFO L225 Difference]: With dead ends: 484 [2023-02-18 07:43:05,298 INFO L226 Difference]: Without dead ends: 412 [2023-02-18 07:43:05,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2023-02-18 07:43:05,299 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 687 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:05,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 853 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 07:43:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-02-18 07:43:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 160. [2023-02-18 07:43:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 152 states have internal predecessors, (168), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2023-02-18 07:43:05,314 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 58 [2023-02-18 07:43:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:05,315 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2023-02-18 07:43:05,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2023-02-18 07:43:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 07:43:05,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:05,318 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:05,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:05,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:05,525 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1322135424, now seen corresponding path program 3 times [2023-02-18 07:43:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:05,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879564554] [2023-02-18 07:43:05,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 07:43:05,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:05,528 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:05,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-18 07:43:05,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-18 07:43:05,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:05,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 07:43:05,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:05,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:06,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:06,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879564554] [2023-02-18 07:43:06,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879564554] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:06,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:06,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-02-18 07:43:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578741010] [2023-02-18 07:43:06,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:06,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-18 07:43:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:06,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-18 07:43:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 07:43:06,091 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:08,764 INFO L93 Difference]: Finished difference Result 564 states and 669 transitions. [2023-02-18 07:43:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-02-18 07:43:08,766 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2023-02-18 07:43:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:08,768 INFO L225 Difference]: With dead ends: 564 [2023-02-18 07:43:08,768 INFO L226 Difference]: Without dead ends: 489 [2023-02-18 07:43:08,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2023-02-18 07:43:08,771 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 731 mSDsluCounter, 4122 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 4361 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:08,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 4361 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 07:43:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-02-18 07:43:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 238. [2023-02-18 07:43:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 219 states have (on average 1.1963470319634704) internal successors, (262), 230 states have internal predecessors, (262), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2023-02-18 07:43:08,786 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 86 [2023-02-18 07:43:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:08,786 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2023-02-18 07:43:08,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2023-02-18 07:43:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-18 07:43:08,787 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:08,788 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:08,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:08,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:09,000 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1110203058, now seen corresponding path program 2 times [2023-02-18 07:43:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:09,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051262843] [2023-02-18 07:43:09,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:43:09,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:09,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:09,002 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:09,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-18 07:43:09,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:43:09,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:09,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:43:09,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:09,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:10,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:10,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051262843] [2023-02-18 07:43:10,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051262843] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:10,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:10,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-18 07:43:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862420757] [2023-02-18 07:43:10,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:10,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-18 07:43:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-18 07:43:10,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2023-02-18 07:43:10,422 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:16,370 INFO L93 Difference]: Finished difference Result 853 states and 1065 transitions. [2023-02-18 07:43:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-18 07:43:16,371 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 98 [2023-02-18 07:43:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:16,375 INFO L225 Difference]: With dead ends: 853 [2023-02-18 07:43:16,375 INFO L226 Difference]: Without dead ends: 781 [2023-02-18 07:43:16,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2023-02-18 07:43:16,377 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1161 mSDsluCounter, 2290 mSDsCounter, 0 mSdLazyCounter, 4114 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 4114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:16,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 2438 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 4114 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-02-18 07:43:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-02-18 07:43:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 240. [2023-02-18 07:43:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 221 states have (on average 1.1266968325791855) internal successors, (249), 232 states have internal predecessors, (249), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 257 transitions. [2023-02-18 07:43:16,400 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 257 transitions. Word has length 98 [2023-02-18 07:43:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:16,400 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 257 transitions. [2023-02-18 07:43:16,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 257 transitions. [2023-02-18 07:43:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-18 07:43:16,401 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:16,401 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:16,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:16,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:16,611 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2098489280, now seen corresponding path program 4 times [2023-02-18 07:43:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:16,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879059724] [2023-02-18 07:43:16,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 07:43:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:16,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:16,642 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:16,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-18 07:43:16,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 07:43:16,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:16,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 07:43:16,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:17,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:18,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:18,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879059724] [2023-02-18 07:43:18,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879059724] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:18,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:18,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-18 07:43:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578619759] [2023-02-18 07:43:18,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:18,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-18 07:43:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:18,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-18 07:43:18,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2023-02-18 07:43:18,950 INFO L87 Difference]: Start difference. First operand 240 states and 257 transitions. Second operand has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:43,135 INFO L93 Difference]: Finished difference Result 490 states and 558 transitions. [2023-02-18 07:43:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-02-18 07:43:43,139 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2023-02-18 07:43:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:43,146 INFO L225 Difference]: With dead ends: 490 [2023-02-18 07:43:43,147 INFO L226 Difference]: Without dead ends: 486 [2023-02-18 07:43:43,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2023-02-18 07:43:43,159 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 1073 mSDsluCounter, 4252 mSDsCounter, 0 mSdLazyCounter, 4162 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 4365 SdHoareTripleChecker+Invalid, 4315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 4162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:43,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 4365 Invalid, 4315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 4162 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-02-18 07:43:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-02-18 07:43:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 364. [2023-02-18 07:43:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 345 states have (on average 1.2115942028985507) internal successors, (418), 356 states have internal predecessors, (418), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 426 transitions. [2023-02-18 07:43:43,226 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 426 transitions. Word has length 136 [2023-02-18 07:43:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:43,227 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 426 transitions. [2023-02-18 07:43:43,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 426 transitions. [2023-02-18 07:43:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-18 07:43:43,228 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:43,228 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 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] [2023-02-18 07:43:43,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:43,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:43,435 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:43,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1305368822, now seen corresponding path program 1 times [2023-02-18 07:43:43,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:43,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342060203] [2023-02-18 07:43:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:43,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:43,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:43,437 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:43,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-18 07:43:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:43,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:43:43,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-02-18 07:43:43,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:43,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:43,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342060203] [2023-02-18 07:43:43,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342060203] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:43,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:43,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:43:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627683638] [2023-02-18 07:43:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:43,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:43:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:43:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:43:43,520 INFO L87 Difference]: Start difference. First operand 364 states and 426 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2023-02-18 07:43:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:43,831 INFO L93 Difference]: Finished difference Result 382 states and 447 transitions. [2023-02-18 07:43:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:43:43,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 152 [2023-02-18 07:43:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:43,832 INFO L225 Difference]: With dead ends: 382 [2023-02-18 07:43:43,832 INFO L226 Difference]: Without dead ends: 379 [2023-02-18 07:43:43,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:43:43,833 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 63 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:43,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 171 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:43:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-02-18 07:43:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2023-02-18 07:43:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 352 states have (on average 1.2102272727272727) internal successors, (426), 363 states have internal predecessors, (426), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 434 transitions. [2023-02-18 07:43:43,880 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 434 transitions. Word has length 152 [2023-02-18 07:43:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:43,880 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 434 transitions. [2023-02-18 07:43:43,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2023-02-18 07:43:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 434 transitions. [2023-02-18 07:43:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-02-18 07:43:43,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:43,881 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 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] [2023-02-18 07:43:43,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:44,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:44,089 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 07:43:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1608575873, now seen corresponding path program 1 times [2023-02-18 07:43:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:44,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322912211] [2023-02-18 07:43:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:44,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:44,091 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:44,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-18 07:43:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:43:44,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 07:43:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:43:44,240 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-18 07:43:44,243 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 07:43:44,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-18 07:43:44,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-18 07:43:44,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-18 07:43:44,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-18 07:43:44,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-18 07:43:44,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-18 07:43:44,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-18 07:43:44,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-18 07:43:44,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-18 07:43:44,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-18 07:43:44,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-18 07:43:44,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-18 07:43:44,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-18 07:43:44,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-18 07:43:44,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-18 07:43:44,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-18 07:43:44,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-18 07:43:44,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-18 07:43:44,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-18 07:43:44,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-18 07:43:44,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-18 07:43:44,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-18 07:43:44,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-18 07:43:44,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-18 07:43:44,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:44,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:44,483 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:44,486 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 07:43:44,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:43:44 BoogieIcfgContainer [2023-02-18 07:43:44,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 07:43:44,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 07:43:44,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 07:43:44,556 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 07:43:44,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:58" (3/4) ... [2023-02-18 07:43:44,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 07:43:44,613 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 07:43:44,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 07:43:44,614 INFO L158 Benchmark]: Toolchain (without parser) took 47047.94ms. Allocated memory was 92.3MB in the beginning and 167.8MB in the end (delta: 75.5MB). Free memory was 68.7MB in the beginning and 129.1MB in the end (delta: -60.4MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-02-18 07:43:44,614 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:43:44,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.49ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 54.7MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 07:43:44,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.67ms. Allocated memory is still 92.3MB. Free memory was 54.7MB in the beginning and 52.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:43:44,615 INFO L158 Benchmark]: Boogie Preprocessor took 61.81ms. Allocated memory is still 92.3MB. Free memory was 52.9MB in the beginning and 51.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:43:44,615 INFO L158 Benchmark]: RCFGBuilder took 545.51ms. Allocated memory is still 92.3MB. Free memory was 51.1MB in the beginning and 57.3MB in the end (delta: -6.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2023-02-18 07:43:44,615 INFO L158 Benchmark]: TraceAbstraction took 45780.74ms. Allocated memory was 92.3MB in the beginning and 167.8MB in the end (delta: 75.5MB). Free memory was 56.6MB in the beginning and 135.4MB in the end (delta: -78.8MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2023-02-18 07:43:44,616 INFO L158 Benchmark]: Witness Printer took 57.64ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 129.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-18 07:43:44,617 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.49ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 54.7MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.67ms. Allocated memory is still 92.3MB. Free memory was 54.7MB in the beginning and 52.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.81ms. Allocated memory is still 92.3MB. Free memory was 52.9MB in the beginning and 51.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.51ms. Allocated memory is still 92.3MB. Free memory was 51.1MB in the beginning and 57.3MB in the end (delta: -6.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 45780.74ms. Allocated memory was 92.3MB in the beginning and 167.8MB in the end (delta: 75.5MB). Free memory was 56.6MB in the beginning and 135.4MB in the end (delta: -78.8MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. * Witness Printer took 57.64ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 129.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 77]: integer overflow possible integer overflow possible We found a FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR (e + 128) << 24U [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464, e=-24, m=0, res=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] - 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: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: 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, 99 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4608 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4608 mSDsluCounter, 15626 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14080 mSDsCounter, 703 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12238 IncrementalHoareTripleChecker+Invalid, 12941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 703 mSolverCounterUnsat, 1546 mSDtfsCounter, 12238 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 1200 SyntacticMatches, 12 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 27.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=15, InterpolantAutomatonStates: 316, 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, 15 MinimizatonAttempts, 1433 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 950 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1281 ConstructedInterpolants, 8 QuantifiedInterpolants, 12586 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 1576/6570 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 proved your program to be incorrect! [2023-02-18 07:43:44,639 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)