./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:03:09,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:03:09,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:03:09,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:03:09,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:03:09,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:03:09,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:03:09,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:03:09,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:03:09,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:03:09,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:03:09,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:03:09,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:03:09,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:03:09,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:03:09,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:03:09,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:03:09,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:03:09,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:03:09,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:03:09,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:03:09,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:03:09,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:03:09,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:03:09,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:03:09,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:03:09,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:03:09,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:03:09,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:03:09,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:03:09,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:03:09,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:03:09,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:03:09,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:03:09,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:03:09,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:03:09,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:03:09,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:03:09,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:03:09,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:03:09,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:03:09,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-16 04:03:09,702 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:03:09,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:03:09,702 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:03:09,702 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:03:09,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:03:09,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:03:09,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:03:09,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:03:09,728 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:03:09,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:03:09,728 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:03:09,728 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:03:09,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 04:03:09,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:03:09,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:03:09,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:03:09,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:03:09,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:03:09,729 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:03:09,729 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:03:09,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:03:09,730 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:03:09,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:03:09,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:03:09,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:03:09,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:03:09,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:09,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:03:09,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:03:09,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:03:09,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 04:03:09,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 04:03:09,732 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:03:09,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:03:09,733 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:03:09,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:03:09,733 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:03:09,733 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2023-02-16 04:03:09,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:03:09,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:03:09,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:03:09,914 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:03:09,914 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:03:09,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2023-02-16 04:03:11,031 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:03:11,231 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:03:11,232 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2023-02-16 04:03:11,237 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1e7beda/2ff9ae575e044e4ea0e7ae55ee604c6c/FLAG9fb391a5c [2023-02-16 04:03:11,248 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1e7beda/2ff9ae575e044e4ea0e7ae55ee604c6c [2023-02-16 04:03:11,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:03:11,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:03:11,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:11,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:03:11,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:03:11,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450a12ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11, skipping insertion in model container [2023-02-16 04:03:11,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:03:11,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:03:11,365 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_1-3a.c.cil.c[730,743] [2023-02-16 04:03:11,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:11,409 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:03:11,416 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_1-3a.c.cil.c[730,743] [2023-02-16 04:03:11,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:11,448 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:03:11,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11 WrapperNode [2023-02-16 04:03:11,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:11,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:11,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:03:11,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:03:11,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,480 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2023-02-16 04:03:11,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:11,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:03:11,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:03:11,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:03:11,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,517 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:03:11,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:03:11,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:03:11,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:03:11,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:11,561 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-16 04:03:11,566 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-16 04:03:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:03:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 04:03:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-16 04:03:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-16 04:03:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:03:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:03:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 04:03:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 04:03:11,654 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:03:11,655 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:03:12,013 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:03:12,020 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:03:12,020 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:03:12,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:12 BoogieIcfgContainer [2023-02-16 04:03:12,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:03:12,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:03:12,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:03:12,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:03:12,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:03:11" (1/3) ... [2023-02-16 04:03:12,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:12, skipping insertion in model container [2023-02-16 04:03:12,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (2/3) ... [2023-02-16 04:03:12,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:12, skipping insertion in model container [2023-02-16 04:03:12,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:12" (3/3) ... [2023-02-16 04:03:12,030 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2023-02-16 04:03:12,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:03:12,044 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-16 04:03:12,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:03:12,099 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;@ffff3e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:03:12,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-16 04:03:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 96 states have (on average 1.6875) internal successors, (162), 114 states have internal predecessors, (162), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-16 04:03:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:12,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1224848007, now seen corresponding path program 1 times [2023-02-16 04:03:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547596972] [2023-02-16 04:03:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,284 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-16 04:03:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547596972] [2023-02-16 04:03:12,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547596972] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:12,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:12,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335097195] [2023-02-16 04:03:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:12,320 INFO L87 Difference]: Start difference. First operand has 124 states, 96 states have (on average 1.6875) internal successors, (162), 114 states have internal predecessors, (162), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 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-16 04:03:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:12,453 INFO L93 Difference]: Finished difference Result 293 states and 445 transitions. [2023-02-16 04:03:12,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:12,455 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-16 04:03:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:12,462 INFO L225 Difference]: With dead ends: 293 [2023-02-16 04:03:12,462 INFO L226 Difference]: Without dead ends: 141 [2023-02-16 04:03:12,465 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-16 04:03:12,467 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 83 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:12,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 475 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-16 04:03:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2023-02-16 04:03:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 121 states have internal predecessors, (165), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2023-02-16 04:03:12,566 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 9 [2023-02-16 04:03:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:12,567 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2023-02-16 04:03:12,567 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-16 04:03:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2023-02-16 04:03:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 04:03:12,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 04:03:12,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,570 INFO L85 PathProgramCache]: Analyzing trace with hash 782574087, now seen corresponding path program 1 times [2023-02-16 04:03:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462550732] [2023-02-16 04:03:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,653 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-16 04:03:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462550732] [2023-02-16 04:03:12,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462550732] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:12,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:12,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021890995] [2023-02-16 04:03:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:12,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:12,656 INFO L87 Difference]: Start difference. First operand 131 states and 177 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-16 04:03:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:12,761 INFO L93 Difference]: Finished difference Result 251 states and 329 transitions. [2023-02-16 04:03:12,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:12,765 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-16 04:03:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:12,767 INFO L225 Difference]: With dead ends: 251 [2023-02-16 04:03:12,769 INFO L226 Difference]: Without dead ends: 159 [2023-02-16 04:03:12,769 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-16 04:03:12,770 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 146 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:12,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 345 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-16 04:03:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 140. [2023-02-16 04:03:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 130 states have internal predecessors, (177), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2023-02-16 04:03:12,785 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 14 [2023-02-16 04:03:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:12,785 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2023-02-16 04:03:12,785 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-16 04:03:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2023-02-16 04:03:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 04:03:12,786 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,786 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 04:03:12,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2114092376, now seen corresponding path program 1 times [2023-02-16 04:03:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384610762] [2023-02-16 04:03:12,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:03:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384610762] [2023-02-16 04:03:12,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384610762] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:12,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:12,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942204543] [2023-02-16 04:03:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:12,829 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 04:03:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:12,859 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2023-02-16 04:03:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:12,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2023-02-16 04:03:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:12,860 INFO L225 Difference]: With dead ends: 146 [2023-02-16 04:03:12,860 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 04:03:12,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 04:03:12,862 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:12,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 04:03:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2023-02-16 04:03:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.5) internal successors, (174), 128 states have internal predecessors, (174), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 186 transitions. [2023-02-16 04:03:12,875 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 186 transitions. Word has length 16 [2023-02-16 04:03:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:12,876 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 186 transitions. [2023-02-16 04:03:12,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 04:03:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 186 transitions. [2023-02-16 04:03:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 04:03:12,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 04:03:12,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1510006967, now seen corresponding path program 1 times [2023-02-16 04:03:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251458558] [2023-02-16 04:03:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,923 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-16 04:03:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251458558] [2023-02-16 04:03:12,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251458558] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:12,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:12,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770784733] [2023-02-16 04:03:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:12,926 INFO L87 Difference]: Start difference. First operand 138 states and 186 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-16 04:03:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:12,984 INFO L93 Difference]: Finished difference Result 164 states and 213 transitions. [2023-02-16 04:03:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:12,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-16 04:03:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:12,986 INFO L225 Difference]: With dead ends: 164 [2023-02-16 04:03:12,986 INFO L226 Difference]: Without dead ends: 162 [2023-02-16 04:03:12,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:12,987 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 105 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:12,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 436 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-16 04:03:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 138. [2023-02-16 04:03:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.4827586206896552) internal successors, (172), 128 states have internal predecessors, (172), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2023-02-16 04:03:12,996 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 15 [2023-02-16 04:03:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:12,997 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2023-02-16 04:03:12,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-16 04:03:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2023-02-16 04:03:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:12,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,998 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 04:03:12,998 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1140981629, now seen corresponding path program 1 times [2023-02-16 04:03:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125910516] [2023-02-16 04:03:12,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,043 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-16 04:03:13,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125910516] [2023-02-16 04:03:13,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125910516] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:13,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804811492] [2023-02-16 04:03:13,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:13,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:13,046 INFO L87 Difference]: Start difference. First operand 138 states and 184 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-16 04:03:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,116 INFO L93 Difference]: Finished difference Result 196 states and 260 transitions. [2023-02-16 04:03:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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 17 [2023-02-16 04:03:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,119 INFO L225 Difference]: With dead ends: 196 [2023-02-16 04:03:13,120 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 04:03:13,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-16 04:03:13,127 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 147 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 334 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 04:03:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2023-02-16 04:03:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 155 states have internal predecessors, (215), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 227 transitions. [2023-02-16 04:03:13,149 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 227 transitions. Word has length 17 [2023-02-16 04:03:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,152 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 227 transitions. [2023-02-16 04:03:13,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-16 04:03:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 227 transitions. [2023-02-16 04:03:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:13,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,155 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 04:03:13,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:13,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1112354273, now seen corresponding path program 1 times [2023-02-16 04:03:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421036785] [2023-02-16 04:03:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,231 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-16 04:03:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421036785] [2023-02-16 04:03:13,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421036785] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944402910] [2023-02-16 04:03:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:13,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:13,234 INFO L87 Difference]: Start difference. First operand 166 states and 227 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-16 04:03:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,291 INFO L93 Difference]: Finished difference Result 194 states and 259 transitions. [2023-02-16 04:03:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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 17 [2023-02-16 04:03:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,294 INFO L225 Difference]: With dead ends: 194 [2023-02-16 04:03:13,294 INFO L226 Difference]: Without dead ends: 191 [2023-02-16 04:03:13,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-16 04:03:13,297 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 145 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 335 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-16 04:03:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2023-02-16 04:03:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 148 states have (on average 1.4797297297297298) internal successors, (219), 159 states have internal predecessors, (219), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 231 transitions. [2023-02-16 04:03:13,312 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 231 transitions. Word has length 17 [2023-02-16 04:03:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,312 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 231 transitions. [2023-02-16 04:03:13,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-16 04:03:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2023-02-16 04:03:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:13,316 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,316 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 04:03:13,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:13,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -229959118, now seen corresponding path program 1 times [2023-02-16 04:03:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580348135] [2023-02-16 04:03:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:13,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580348135] [2023-02-16 04:03:13,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580348135] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:13,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489754258] [2023-02-16 04:03:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:13,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:13,382 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-16 04:03:13,435 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-16 04:03:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:13,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:13,499 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-16 04:03:13,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:13,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489754258] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:13,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-16 04:03:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297073970] [2023-02-16 04:03:13,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:13,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:13,501 INFO L87 Difference]: Start difference. First operand 170 states and 231 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-16 04:03:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,535 INFO L93 Difference]: Finished difference Result 210 states and 282 transitions. [2023-02-16 04:03:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:13,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 17 [2023-02-16 04:03:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,538 INFO L225 Difference]: With dead ends: 210 [2023-02-16 04:03:13,539 INFO L226 Difference]: Without dead ends: 209 [2023-02-16 04:03:13,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:13,540 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 16 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 343 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-16 04:03:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2023-02-16 04:03:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 154 states have internal predecessors, (211), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2023-02-16 04:03:13,550 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 223 transitions. Word has length 17 [2023-02-16 04:03:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,550 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 223 transitions. [2023-02-16 04:03:13,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-16 04:03:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 223 transitions. [2023-02-16 04:03:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 04:03:13,551 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 04:03:13,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:13,757 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1188804043, now seen corresponding path program 1 times [2023-02-16 04:03:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092649144] [2023-02-16 04:03:13,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:03:13,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092649144] [2023-02-16 04:03:13,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092649144] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711492346] [2023-02-16 04:03:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:13,791 INFO L87 Difference]: Start difference. First operand 165 states and 223 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,822 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2023-02-16 04:03:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 04:03:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,824 INFO L225 Difference]: With dead ends: 211 [2023-02-16 04:03:13,824 INFO L226 Difference]: Without dead ends: 210 [2023-02-16 04:03:13,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:13,825 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 21 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 235 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-16 04:03:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2023-02-16 04:03:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 154 states have internal predecessors, (209), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2023-02-16 04:03:13,832 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 19 [2023-02-16 04:03:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,833 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2023-02-16 04:03:13,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2023-02-16 04:03:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 04:03:13,833 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,834 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 04:03:13,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:13,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1608645210, now seen corresponding path program 1 times [2023-02-16 04:03:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421345687] [2023-02-16 04:03:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 04:03:13,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421345687] [2023-02-16 04:03:13,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421345687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117027514] [2023-02-16 04:03:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:13,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:13,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:13,883 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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-16 04:03:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,931 INFO L93 Difference]: Finished difference Result 189 states and 252 transitions. [2023-02-16 04:03:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 24 [2023-02-16 04:03:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,933 INFO L225 Difference]: With dead ends: 189 [2023-02-16 04:03:13,933 INFO L226 Difference]: Without dead ends: 187 [2023-02-16 04:03:13,933 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-16 04:03:13,933 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 139 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 336 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-16 04:03:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2023-02-16 04:03:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.4388489208633093) internal successors, (200), 148 states have internal predecessors, (200), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 212 transitions. [2023-02-16 04:03:13,940 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 212 transitions. Word has length 24 [2023-02-16 04:03:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,940 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 212 transitions. [2023-02-16 04:03:13,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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-16 04:03:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 212 transitions. [2023-02-16 04:03:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 04:03:13,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,941 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 04:03:13,942 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1580017854, now seen corresponding path program 1 times [2023-02-16 04:03:13,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599208334] [2023-02-16 04:03:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 04:03:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599208334] [2023-02-16 04:03:13,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599208334] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:13,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799335914] [2023-02-16 04:03:13,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:13,976 INFO L87 Difference]: Start difference. First operand 159 states and 212 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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-16 04:03:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:14,023 INFO L93 Difference]: Finished difference Result 181 states and 240 transitions. [2023-02-16 04:03:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:14,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 24 [2023-02-16 04:03:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:14,024 INFO L225 Difference]: With dead ends: 181 [2023-02-16 04:03:14,024 INFO L226 Difference]: Without dead ends: 179 [2023-02-16 04:03:14,025 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-16 04:03:14,025 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 138 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:14,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 334 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-16 04:03:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2023-02-16 04:03:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 139 states have internal predecessors, (188), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 200 transitions. [2023-02-16 04:03:14,032 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 200 transitions. Word has length 24 [2023-02-16 04:03:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:14,032 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 200 transitions. [2023-02-16 04:03:14,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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-16 04:03:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 200 transitions. [2023-02-16 04:03:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 04:03:14,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:14,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:14,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 04:03:14,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash 880395004, now seen corresponding path program 1 times [2023-02-16 04:03:14,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:14,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36449326] [2023-02-16 04:03:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-16 04:03:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:14,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36449326] [2023-02-16 04:03:14,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36449326] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75865993] [2023-02-16 04:03:14,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:14,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:14,189 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-16 04:03:14,191 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-16 04:03:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 04:03:14,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 04:03:14,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:14,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75865993] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:14,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:14,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2023-02-16 04:03:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415205512] [2023-02-16 04:03:14,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:14,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 04:03:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 04:03:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:14,396 INFO L87 Difference]: Start difference. First operand 150 states and 200 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:14,683 INFO L93 Difference]: Finished difference Result 413 states and 542 transitions. [2023-02-16 04:03:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 04:03:14,683 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2023-02-16 04:03:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:14,684 INFO L225 Difference]: With dead ends: 413 [2023-02-16 04:03:14,685 INFO L226 Difference]: Without dead ends: 246 [2023-02-16 04:03:14,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2023-02-16 04:03:14,686 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 282 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:14,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1121 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-16 04:03:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 118. [2023-02-16 04:03:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.39) internal successors, (139), 107 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2023-02-16 04:03:14,693 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 31 [2023-02-16 04:03:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:14,693 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2023-02-16 04:03:14,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2023-02-16 04:03:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 04:03:14,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:14,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:14,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 04:03:14,899 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,SelfDestructingSolverStorable10 [2023-02-16 04:03:14,899 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:14,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1437005267, now seen corresponding path program 1 times [2023-02-16 04:03:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:14,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138623313] [2023-02-16 04:03:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:14,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138623313] [2023-02-16 04:03:14,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138623313] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:14,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:15,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141775497] [2023-02-16 04:03:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:15,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:15,014 INFO L87 Difference]: Start difference. First operand 118 states and 151 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,134 INFO L93 Difference]: Finished difference Result 272 states and 342 transitions. [2023-02-16 04:03:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:15,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-02-16 04:03:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,136 INFO L225 Difference]: With dead ends: 272 [2023-02-16 04:03:15,136 INFO L226 Difference]: Without dead ends: 207 [2023-02-16 04:03:15,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:15,137 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 123 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 823 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-16 04:03:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 118. [2023-02-16 04:03:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.37) internal successors, (137), 107 states have internal predecessors, (137), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2023-02-16 04:03:15,162 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 36 [2023-02-16 04:03:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,162 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2023-02-16 04:03:15,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2023-02-16 04:03:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 04:03:15,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 04:03:15,163 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1977986268, now seen corresponding path program 2 times [2023-02-16 04:03:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507402557] [2023-02-16 04:03:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:15,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507402557] [2023-02-16 04:03:15,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507402557] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:15,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:15,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437030836] [2023-02-16 04:03:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:15,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:15,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:15,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:15,279 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,418 INFO L93 Difference]: Finished difference Result 265 states and 331 transitions. [2023-02-16 04:03:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:15,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-16 04:03:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,419 INFO L225 Difference]: With dead ends: 265 [2023-02-16 04:03:15,420 INFO L226 Difference]: Without dead ends: 219 [2023-02-16 04:03:15,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:15,420 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 188 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 867 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-16 04:03:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 146. [2023-02-16 04:03:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3622047244094488) internal successors, (173), 134 states have internal predecessors, (173), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-16 04:03:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 186 transitions. [2023-02-16 04:03:15,427 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 186 transitions. Word has length 40 [2023-02-16 04:03:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,428 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 186 transitions. [2023-02-16 04:03:15,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 186 transitions. [2023-02-16 04:03:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 04:03:15,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,429 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 04:03:15,429 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1977988190, now seen corresponding path program 1 times [2023-02-16 04:03:15,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980656944] [2023-02-16 04:03:15,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:15,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:15,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980656944] [2023-02-16 04:03:15,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980656944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:15,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:15,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 04:03:15,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514632726] [2023-02-16 04:03:15,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:15,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:15,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:15,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:15,541 INFO L87 Difference]: Start difference. First operand 146 states and 186 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,673 INFO L93 Difference]: Finished difference Result 354 states and 442 transitions. [2023-02-16 04:03:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-16 04:03:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,675 INFO L225 Difference]: With dead ends: 354 [2023-02-16 04:03:15,675 INFO L226 Difference]: Without dead ends: 292 [2023-02-16 04:03:15,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:15,676 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 317 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 803 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-02-16 04:03:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2023-02-16 04:03:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 134 states have internal predecessors, (172), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-16 04:03:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2023-02-16 04:03:15,683 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 40 [2023-02-16 04:03:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,684 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2023-02-16 04:03:15,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2023-02-16 04:03:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 04:03:15,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 04:03:15,685 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,685 INFO L85 PathProgramCache]: Analyzing trace with hash -903123272, now seen corresponding path program 1 times [2023-02-16 04:03:15,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93682326] [2023-02-16 04:03:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:15,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:15,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93682326] [2023-02-16 04:03:15,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93682326] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:15,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523935905] [2023-02-16 04:03:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:15,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:15,798 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-16 04:03:15,800 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-16 04:03:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 04:03:15,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:15,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:15,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523935905] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:15,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:15,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 9 [2023-02-16 04:03:15,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506277098] [2023-02-16 04:03:15,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:15,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:15,900 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,968 INFO L93 Difference]: Finished difference Result 345 states and 437 transitions. [2023-02-16 04:03:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:15,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2023-02-16 04:03:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,970 INFO L225 Difference]: With dead ends: 345 [2023-02-16 04:03:15,970 INFO L226 Difference]: Without dead ends: 270 [2023-02-16 04:03:15,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:15,970 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 175 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 634 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-16 04:03:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 155. [2023-02-16 04:03:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 134 states have (on average 1.335820895522388) internal successors, (179), 140 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 04:03:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 196 transitions. [2023-02-16 04:03:15,979 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 196 transitions. Word has length 42 [2023-02-16 04:03:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,979 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 196 transitions. [2023-02-16 04:03:15,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 196 transitions. [2023-02-16 04:03:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 04:03:15,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:16,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:16,185 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash -405368898, now seen corresponding path program 1 times [2023-02-16 04:03:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:16,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530962774] [2023-02-16 04:03:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530962774] [2023-02-16 04:03:16,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530962774] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308670827] [2023-02-16 04:03:16,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:16,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:16,286 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-16 04:03:16,288 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-16 04:03:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 04:03:16,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:16,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:16,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308670827] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:16,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:16,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2023-02-16 04:03:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94895579] [2023-02-16 04:03:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:16,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:16,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:16,438 INFO L87 Difference]: Start difference. First operand 155 states and 196 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:16,582 INFO L93 Difference]: Finished difference Result 395 states and 492 transitions. [2023-02-16 04:03:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2023-02-16 04:03:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:16,584 INFO L225 Difference]: With dead ends: 395 [2023-02-16 04:03:16,584 INFO L226 Difference]: Without dead ends: 332 [2023-02-16 04:03:16,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:16,585 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 296 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:16,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 840 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-02-16 04:03:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 159. [2023-02-16 04:03:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 138 states have (on average 1.3333333333333333) internal successors, (184), 144 states have internal predecessors, (184), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 04:03:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 201 transitions. [2023-02-16 04:03:16,601 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 201 transitions. Word has length 44 [2023-02-16 04:03:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:16,601 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 201 transitions. [2023-02-16 04:03:16,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 201 transitions. [2023-02-16 04:03:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 04:03:16,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:16,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:16,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:16,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-16 04:03:16,810 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:16,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1085427268, now seen corresponding path program 1 times [2023-02-16 04:03:16,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:16,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832838871] [2023-02-16 04:03:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:16,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:16,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832838871] [2023-02-16 04:03:16,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832838871] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:16,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777719789] [2023-02-16 04:03:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:16,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:16,903 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-16 04:03:16,905 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-16 04:03:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 04:03:16,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:16,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:17,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777719789] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:17,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:17,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-02-16 04:03:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026187197] [2023-02-16 04:03:17,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:17,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 04:03:17,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:17,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 04:03:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:17,154 INFO L87 Difference]: Start difference. First operand 159 states and 201 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:17,292 INFO L93 Difference]: Finished difference Result 330 states and 415 transitions. [2023-02-16 04:03:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:17,293 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2023-02-16 04:03:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:17,294 INFO L225 Difference]: With dead ends: 330 [2023-02-16 04:03:17,294 INFO L226 Difference]: Without dead ends: 270 [2023-02-16 04:03:17,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:17,295 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 168 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:17,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1076 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-16 04:03:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2023-02-16 04:03:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 160 states have internal predecessors, (204), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 04:03:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 221 transitions. [2023-02-16 04:03:17,302 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 221 transitions. Word has length 44 [2023-02-16 04:03:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:17,302 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 221 transitions. [2023-02-16 04:03:17,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 221 transitions. [2023-02-16 04:03:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 04:03:17,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:17,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:17,317 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-16 04:03:17,508 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,SelfDestructingSolverStorable16 [2023-02-16 04:03:17,508 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash 364942029, now seen corresponding path program 1 times [2023-02-16 04:03:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:17,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351159515] [2023-02-16 04:03:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:17,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:17,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:17,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351159515] [2023-02-16 04:03:17,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351159515] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:17,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917729694] [2023-02-16 04:03:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:17,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:17,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:17,634 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-16 04:03:17,636 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-16 04:03:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:17,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 04:03:17,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 04:03:17,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:17,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917729694] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:17,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:17,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 17 [2023-02-16 04:03:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567278543] [2023-02-16 04:03:17,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:17,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 04:03:17,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 04:03:17,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-02-16 04:03:17,816 INFO L87 Difference]: Start difference. First operand 175 states and 221 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 04:03:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:18,059 INFO L93 Difference]: Finished difference Result 331 states and 413 transitions. [2023-02-16 04:03:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 04:03:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 47 [2023-02-16 04:03:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:18,061 INFO L225 Difference]: With dead ends: 331 [2023-02-16 04:03:18,061 INFO L226 Difference]: Without dead ends: 248 [2023-02-16 04:03:18,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-02-16 04:03:18,062 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 276 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:18,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 934 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-16 04:03:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 172. [2023-02-16 04:03:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 157 states have internal predecessors, (195), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 04:03:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2023-02-16 04:03:18,070 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 47 [2023-02-16 04:03:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:18,070 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2023-02-16 04:03:18,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 04:03:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2023-02-16 04:03:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 04:03:18,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:18,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:18,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:18,276 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,SelfDestructingSolverStorable17 [2023-02-16 04:03:18,276 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:18,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2049582225, now seen corresponding path program 1 times [2023-02-16 04:03:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:18,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851306708] [2023-02-16 04:03:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:18,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:18,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851306708] [2023-02-16 04:03:18,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851306708] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:18,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392872950] [2023-02-16 04:03:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:18,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:18,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:18,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 04:03:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 04:03:18,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 04:03:18,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:19,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392872950] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:19,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:19,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 13] total 28 [2023-02-16 04:03:19,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754325253] [2023-02-16 04:03:19,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:19,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 04:03:19,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:19,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 04:03:19,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2023-02-16 04:03:19,005 INFO L87 Difference]: Start difference. First operand 172 states and 212 transitions. Second operand has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 23 states have internal predecessors, (84), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:20,160 INFO L93 Difference]: Finished difference Result 783 states and 976 transitions. [2023-02-16 04:03:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-16 04:03:20,160 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 23 states have internal predecessors, (84), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2023-02-16 04:03:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:20,163 INFO L225 Difference]: With dead ends: 783 [2023-02-16 04:03:20,163 INFO L226 Difference]: Without dead ends: 737 [2023-02-16 04:03:20,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=2573, Unknown=0, NotChecked=0, Total=2862 [2023-02-16 04:03:20,164 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 773 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 5407 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:20,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 5407 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 04:03:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2023-02-16 04:03:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 224. [2023-02-16 04:03:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.2814070351758795) internal successors, (255), 204 states have internal predecessors, (255), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (16), 15 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-16 04:03:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 280 transitions. [2023-02-16 04:03:20,202 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 280 transitions. Word has length 49 [2023-02-16 04:03:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:20,202 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 280 transitions. [2023-02-16 04:03:20,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 23 states have internal predecessors, (84), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 280 transitions. [2023-02-16 04:03:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 04:03:20,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:20,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:20,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:20,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:20,425 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1621632943, now seen corresponding path program 1 times [2023-02-16 04:03:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:20,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225334066] [2023-02-16 04:03:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:20,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-16 04:03:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:20,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225334066] [2023-02-16 04:03:20,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225334066] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654537936] [2023-02-16 04:03:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:20,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:20,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:20,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:20,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 04:03:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:20,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:20,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 04:03:20,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:20,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654537936] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:20,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:20,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-16 04:03:20,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347429025] [2023-02-16 04:03:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:20,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:20,570 INFO L87 Difference]: Start difference. First operand 224 states and 280 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:20,602 INFO L93 Difference]: Finished difference Result 386 states and 487 transitions. [2023-02-16 04:03:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2023-02-16 04:03:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:20,604 INFO L225 Difference]: With dead ends: 386 [2023-02-16 04:03:20,604 INFO L226 Difference]: Without dead ends: 248 [2023-02-16 04:03:20,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:20,605 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 4 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:20,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 310 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-16 04:03:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2023-02-16 04:03:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 211 states have (on average 1.2654028436018958) internal successors, (267), 216 states have internal predecessors, (267), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (16), 15 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-16 04:03:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 292 transitions. [2023-02-16 04:03:20,618 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 292 transitions. Word has length 50 [2023-02-16 04:03:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:20,618 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 292 transitions. [2023-02-16 04:03:20,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 292 transitions. [2023-02-16 04:03:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 04:03:20,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:20,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:20,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:20,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:20,825 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash -443554453, now seen corresponding path program 1 times [2023-02-16 04:03:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:20,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145802788] [2023-02-16 04:03:20,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:20,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-16 04:03:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:21,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:21,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145802788] [2023-02-16 04:03:21,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145802788] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:21,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306881885] [2023-02-16 04:03:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:21,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:21,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:21,153 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:21,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 04:03:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:21,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 04:03:21,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:21,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:21,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306881885] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:21,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:21,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2023-02-16 04:03:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963289571] [2023-02-16 04:03:21,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:21,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 04:03:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 04:03:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2023-02-16 04:03:21,806 INFO L87 Difference]: Start difference. First operand 236 states and 292 transitions. Second operand has 37 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 04:03:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:22,759 INFO L93 Difference]: Finished difference Result 734 states and 955 transitions. [2023-02-16 04:03:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-16 04:03:22,759 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 51 [2023-02-16 04:03:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:22,768 INFO L225 Difference]: With dead ends: 734 [2023-02-16 04:03:22,768 INFO L226 Difference]: Without dead ends: 686 [2023-02-16 04:03:22,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=333, Invalid=3449, Unknown=0, NotChecked=0, Total=3782 [2023-02-16 04:03:22,770 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 682 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:22,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 3231 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:03:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2023-02-16 04:03:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 234. [2023-02-16 04:03:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 215 states have internal predecessors, (266), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (16), 14 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-16 04:03:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2023-02-16 04:03:22,784 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 51 [2023-02-16 04:03:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:22,785 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2023-02-16 04:03:22,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 04:03:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2023-02-16 04:03:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 04:03:22,786 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:22,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:22,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:22,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:22,991 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -420922199, now seen corresponding path program 1 times [2023-02-16 04:03:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:22,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678341169] [2023-02-16 04:03:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-16 04:03:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:23,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:23,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678341169] [2023-02-16 04:03:23,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678341169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:23,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:23,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:23,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650347160] [2023-02-16 04:03:23,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:23,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:23,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:23,167 INFO L87 Difference]: Start difference. First operand 234 states and 291 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:23,388 INFO L93 Difference]: Finished difference Result 344 states and 424 transitions. [2023-02-16 04:03:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:23,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2023-02-16 04:03:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:23,390 INFO L225 Difference]: With dead ends: 344 [2023-02-16 04:03:23,390 INFO L226 Difference]: Without dead ends: 343 [2023-02-16 04:03:23,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:23,391 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 293 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:23,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 802 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-02-16 04:03:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 232. [2023-02-16 04:03:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 207 states have (on average 1.2705314009661837) internal successors, (263), 213 states have internal predecessors, (263), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (16), 14 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-16 04:03:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 288 transitions. [2023-02-16 04:03:23,404 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 288 transitions. Word has length 51 [2023-02-16 04:03:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:23,404 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 288 transitions. [2023-02-16 04:03:23,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2023-02-16 04:03:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-16 04:03:23,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:23,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:23,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 04:03:23,405 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1272472378, now seen corresponding path program 1 times [2023-02-16 04:03:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:23,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278860020] [2023-02-16 04:03:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:23,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278860020] [2023-02-16 04:03:23,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278860020] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:23,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:23,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 04:03:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826498308] [2023-02-16 04:03:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 04:03:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 04:03:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:23,571 INFO L87 Difference]: Start difference. First operand 232 states and 288 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:23,948 INFO L93 Difference]: Finished difference Result 549 states and 689 transitions. [2023-02-16 04:03:23,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 04:03:23,948 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2023-02-16 04:03:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:23,950 INFO L225 Difference]: With dead ends: 549 [2023-02-16 04:03:23,950 INFO L226 Difference]: Without dead ends: 547 [2023-02-16 04:03:23,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2023-02-16 04:03:23,951 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 286 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:23,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2048 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2023-02-16 04:03:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 294. [2023-02-16 04:03:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 268 states have (on average 1.2835820895522387) internal successors, (344), 272 states have internal predecessors, (344), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (20), 17 states have call predecessors, (20), 9 states have call successors, (20) [2023-02-16 04:03:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 373 transitions. [2023-02-16 04:03:23,966 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 373 transitions. Word has length 54 [2023-02-16 04:03:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:23,967 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 373 transitions. [2023-02-16 04:03:23,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 373 transitions. [2023-02-16 04:03:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 04:03:23,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:23,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:23,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-16 04:03:23,968 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash -568271205, now seen corresponding path program 1 times [2023-02-16 04:03:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:23,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364975272] [2023-02-16 04:03:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:24,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:24,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:24,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:24,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364975272] [2023-02-16 04:03:24,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364975272] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:24,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115464286] [2023-02-16 04:03:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:24,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:24,150 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:24,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 04:03:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:24,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 04:03:24,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:24,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:24,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115464286] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:24,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:24,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2023-02-16 04:03:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786164934] [2023-02-16 04:03:24,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:24,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 04:03:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 04:03:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-02-16 04:03:24,859 INFO L87 Difference]: Start difference. First operand 294 states and 373 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:26,846 INFO L93 Difference]: Finished difference Result 1017 states and 1269 transitions. [2023-02-16 04:03:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-16 04:03:26,846 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 56 [2023-02-16 04:03:26,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:26,849 INFO L225 Difference]: With dead ends: 1017 [2023-02-16 04:03:26,849 INFO L226 Difference]: Without dead ends: 966 [2023-02-16 04:03:26,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=544, Invalid=2996, Unknown=0, NotChecked=0, Total=3540 [2023-02-16 04:03:26,850 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 1136 mSDsluCounter, 4503 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 4875 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:26,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 4875 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 04:03:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-02-16 04:03:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 309. [2023-02-16 04:03:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 283 states have (on average 1.2826855123674912) internal successors, (363), 286 states have internal predecessors, (363), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (20), 18 states have call predecessors, (20), 9 states have call successors, (20) [2023-02-16 04:03:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 392 transitions. [2023-02-16 04:03:26,868 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 392 transitions. Word has length 56 [2023-02-16 04:03:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:26,868 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 392 transitions. [2023-02-16 04:03:26,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 392 transitions. [2023-02-16 04:03:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 04:03:26,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:26,869 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:26,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-16 04:03:27,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-16 04:03:27,075 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1913410720, now seen corresponding path program 1 times [2023-02-16 04:03:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:27,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319903040] [2023-02-16 04:03:27,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:27,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319903040] [2023-02-16 04:03:27,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319903040] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:27,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140703280] [2023-02-16 04:03:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:27,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:27,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:27,273 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:27,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 04:03:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:27,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-16 04:03:27,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 04:03:27,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 04:03:27,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140703280] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:27,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:27,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2023-02-16 04:03:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787710773] [2023-02-16 04:03:27,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:27,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 04:03:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:27,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 04:03:27,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2023-02-16 04:03:27,864 INFO L87 Difference]: Start difference. First operand 309 states and 392 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 04:03:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:29,046 INFO L93 Difference]: Finished difference Result 771 states and 996 transitions. [2023-02-16 04:03:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-16 04:03:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) Word has length 56 [2023-02-16 04:03:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:29,048 INFO L225 Difference]: With dead ends: 771 [2023-02-16 04:03:29,048 INFO L226 Difference]: Without dead ends: 662 [2023-02-16 04:03:29,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=2727, Unknown=0, NotChecked=0, Total=3080 [2023-02-16 04:03:29,049 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 453 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:29,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 2303 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:03:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-02-16 04:03:29,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 362. [2023-02-16 04:03:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 334 states have (on average 1.2664670658682635) internal successors, (423), 333 states have internal predecessors, (423), 9 states have call successors, (9), 4 states have call predecessors, (9), 11 states have return successors, (28), 24 states have call predecessors, (28), 9 states have call successors, (28) [2023-02-16 04:03:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 460 transitions. [2023-02-16 04:03:29,073 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 460 transitions. Word has length 56 [2023-02-16 04:03:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:29,073 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 460 transitions. [2023-02-16 04:03:29,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 04:03:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 460 transitions. [2023-02-16 04:03:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 04:03:29,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:29,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:29,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:29,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-16 04:03:29,280 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1701498206, now seen corresponding path program 1 times [2023-02-16 04:03:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:29,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759246945] [2023-02-16 04:03:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:03:29,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:03:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:03:29,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:03:29,337 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 04:03:29,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-16 04:03:29,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-16 04:03:29,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-16 04:03:29,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-16 04:03:29,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-16 04:03:29,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-16 04:03:29,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-16 04:03:29,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-16 04:03:29,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-16 04:03:29,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-16 04:03:29,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-16 04:03:29,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-16 04:03:29,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-16 04:03:29,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-16 04:03:29,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-16 04:03:29,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-16 04:03:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-16 04:03:29,345 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:29,347 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:03:29,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:03:29 BoogieIcfgContainer [2023-02-16 04:03:29,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:03:29,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:03:29,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:03:29,371 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:03:29,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:12" (3/4) ... [2023-02-16 04:03:29,373 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 04:03:29,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:03:29,374 INFO L158 Benchmark]: Toolchain (without parser) took 18123.05ms. Allocated memory was 180.4MB in the beginning and 329.3MB in the end (delta: 148.9MB). Free memory was 140.9MB in the beginning and 247.2MB in the end (delta: -106.3MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2023-02-16 04:03:29,374 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:29,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.10ms. Allocated memory is still 180.4MB. Free memory was 140.9MB in the beginning and 127.0MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 04:03:29,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.92ms. Allocated memory is still 180.4MB. Free memory was 127.0MB in the beginning and 124.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 04:03:29,374 INFO L158 Benchmark]: Boogie Preprocessor took 38.97ms. Allocated memory is still 180.4MB. Free memory was 124.3MB in the beginning and 122.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:29,375 INFO L158 Benchmark]: RCFGBuilder took 500.97ms. Allocated memory is still 180.4MB. Free memory was 122.8MB in the beginning and 99.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-02-16 04:03:29,375 INFO L158 Benchmark]: TraceAbstraction took 17347.23ms. Allocated memory was 180.4MB in the beginning and 329.3MB in the end (delta: 148.9MB). Free memory was 98.6MB in the beginning and 247.2MB in the end (delta: -148.6MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2023-02-16 04:03:29,375 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 329.3MB. Free memory is still 247.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:29,376 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 180.4MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.10ms. Allocated memory is still 180.4MB. Free memory was 140.9MB in the beginning and 127.0MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.92ms. Allocated memory is still 180.4MB. Free memory was 127.0MB in the beginning and 124.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.97ms. Allocated memory is still 180.4MB. Free memory was 124.3MB in the beginning and 122.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 500.97ms. Allocated memory is still 180.4MB. Free memory was 122.8MB in the beginning and 99.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17347.23ms. Allocated memory was 180.4MB in the beginning and 329.3MB in the end (delta: 148.9MB). Free memory was 98.6MB in the beginning and 247.2MB in the end (delta: -148.6MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 329.3MB. Free memory is still 247.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76, overapproximation of bitwiseAnd at line 108. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-127, eb=-128] [L251] 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] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=33554431] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L29] COND FALSE !(! m) VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L57] COND TRUE 1 VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L77] EXPR e + 128 VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-128, \old(m)=33554431, __retres4=33554431, e=-128, m=33554431, res=33554431] [L80] return (__retres4); VAL [\old(e)=-128, \old(m)=33554431, \result=36028797052518399, __retres4=33554431, e=-128, m=33554431, res=33554431] [L253] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=36028797052518399, ea=-127, eb=-128, ma=16777216, mb=33554431, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, tmp=1, zero=0] [L263] sa = tmp VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=33554431, a=16777216, b=33554431] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=16777216, \old(b)=33554431, a=33554431, b=16777216, tmp=16777216] [L101] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=33554431, a=33554431, b=16777216, tmp=16777216] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=33554431, a=33554431, b=16777216, ma=0, tmp=16777216] [L109] (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=33554431, a=33554431, b=16777216, ma=0, tmp=16777216] - 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: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6527 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6396 mSDsluCounter, 29466 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25881 mSDsCounter, 879 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6380 IncrementalHoareTripleChecker+Invalid, 7259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 879 mSolverCounterUnsat, 3585 mSDtfsCounter, 6380 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1261 GetRequests, 843 SyntacticMatches, 17 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2949 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=25, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 3448 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1406 NumberOfCodeBlocks, 1406 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1641 ConstructedInterpolants, 0 QuantifiedInterpolants, 7647 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 43 InterpolantComputations, 18 PerfectInterpolantSequences, 504/630 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-16 04:03:29,403 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_1-3a.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:03:31,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:03:31,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:03:31,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:03:31,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:03:31,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:03:31,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:03:31,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:03:31,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:03:31,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:03:31,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:03:31,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:03:31,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:03:31,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:03:31,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:03:31,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:03:31,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:03:31,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:03:31,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:03:31,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:03:31,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:03:31,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:03:31,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:03:31,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:03:31,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:03:31,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:03:31,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:03:31,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:03:31,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:03:31,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:03:31,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:03:31,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:03:31,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:03:31,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:03:31,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:03:31,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:03:31,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:03:31,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:03:31,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:03:31,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:03:31,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:03:31,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-16 04:03:31,273 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:03:31,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:03:31,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:03:31,275 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:03:31,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:03:31,276 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:03:31,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:03:31,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:03:31,276 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:03:31,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:03:31,277 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:03:31,278 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:03:31,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:03:31,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:03:31,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:03:31,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:03:31,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:03:31,278 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 04:03:31,279 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 04:03:31,279 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:03:31,279 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 04:03:31,279 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:03:31,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:03:31,279 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:03:31,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:03:31,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:03:31,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:03:31,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:03:31,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:31,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:03:31,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:03:31,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:03:31,281 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 04:03:31,281 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:31,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:03:31,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:03:31,281 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:03:31,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:03:31,282 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 04:03:31,287 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:03:31,287 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2023-02-16 04:03:31,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:03:31,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:03:31,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:03:31,558 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:03:31,561 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:03:31,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2023-02-16 04:03:32,609 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:03:32,846 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:03:32,846 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2023-02-16 04:03:32,853 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0fb6d4f/3743b0ee7c2c4647936d07a9fccb5721/FLAG529cd33d5 [2023-02-16 04:03:32,865 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0fb6d4f/3743b0ee7c2c4647936d07a9fccb5721 [2023-02-16 04:03:32,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:03:32,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:03:32,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:32,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:03:32,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:03:32,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55051cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32, skipping insertion in model container [2023-02-16 04:03:32,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:03:32,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:03:32,978 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_1-3a.c.cil.c[730,743] [2023-02-16 04:03:33,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:33,052 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:03:33,064 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_1-3a.c.cil.c[730,743] [2023-02-16 04:03:33,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:33,117 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:03:33,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33 WrapperNode [2023-02-16 04:03:33,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:33,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:33,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:03:33,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:03:33,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,178 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2023-02-16 04:03:33,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:33,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:03:33,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:03:33,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:03:33,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,215 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:03:33,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:03:33,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:03:33,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:03:33,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (1/1) ... [2023-02-16 04:03:33,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:33,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:33,257 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-16 04:03:33,298 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-16 04:03:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:03:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 04:03:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-16 04:03:33,313 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-16 04:03:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:03:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:03:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 04:03:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 04:03:33,387 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:03:33,388 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:03:33,695 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:03:33,700 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:03:33,700 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:03:33,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:33 BoogieIcfgContainer [2023-02-16 04:03:33,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:03:33,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:03:33,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:03:33,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:03:33,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:03:32" (1/3) ... [2023-02-16 04:03:33,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d62f115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:33, skipping insertion in model container [2023-02-16 04:03:33,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:33" (2/3) ... [2023-02-16 04:03:33,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d62f115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:33, skipping insertion in model container [2023-02-16 04:03:33,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:33" (3/3) ... [2023-02-16 04:03:33,706 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2023-02-16 04:03:33,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:03:33,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-16 04:03:33,749 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:03:33,753 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;@1cbfb6d4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:03:33,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-16 04:03:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 92 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-16 04:03:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:33,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:33,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:33,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1558059187, now seen corresponding path program 1 times [2023-02-16 04:03:33,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:33,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115076837] [2023-02-16 04:03:33,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:33,779 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-16 04:03:33,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:33,793 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-16 04:03:33,794 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-16 04:03:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 04:03:33,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:33,859 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-16 04:03:33,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:33,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:33,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115076837] [2023-02-16 04:03:33,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115076837] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:33,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:33,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-16 04:03:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564131838] [2023-02-16 04:03:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:33,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 04:03:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 04:03:33,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 04:03:33,883 INFO L87 Difference]: Start difference. First operand has 102 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 92 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 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-16 04:03:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:33,904 INFO L93 Difference]: Finished difference Result 192 states and 289 transitions. [2023-02-16 04:03:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 04:03:33,906 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-16 04:03:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:33,910 INFO L225 Difference]: With dead ends: 192 [2023-02-16 04:03:33,910 INFO L226 Difference]: Without dead ends: 65 [2023-02-16 04:03:33,913 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-16 04:03:33,915 INFO L413 NwaCegarLoop]: 128 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, 128 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-16 04:03:33,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-16 04:03:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-16 04:03:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.36) internal successors, (68), 56 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2023-02-16 04:03:33,958 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 9 [2023-02-16 04:03:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:33,959 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2023-02-16 04:03:33,959 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-16 04:03:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2023-02-16 04:03:33,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:33,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:33,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:33,976 INFO L552 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)] Ended with exit code 0 [2023-02-16 04:03:34,166 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-16 04:03:34,167 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1559000453, now seen corresponding path program 1 times [2023-02-16 04:03:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:34,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383584093] [2023-02-16 04:03:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,168 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-16 04:03:34,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:34,170 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-16 04:03:34,172 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-16 04:03:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:34,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:34,271 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-16 04:03:34,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:34,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:34,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383584093] [2023-02-16 04:03:34,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383584093] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:34,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:34,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121870258] [2023-02-16 04:03:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:34,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:34,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:34,274 INFO L87 Difference]: Start difference. First operand 65 states and 80 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-16 04:03:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:34,323 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2023-02-16 04:03:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:03:34,324 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-16 04:03:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:34,326 INFO L225 Difference]: With dead ends: 135 [2023-02-16 04:03:34,326 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 04:03:34,327 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-16 04:03:34,328 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:34,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 218 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 04:03:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-16 04:03:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 60 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2023-02-16 04:03:34,337 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 9 [2023-02-16 04:03:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:34,337 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2023-02-16 04:03:34,337 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-16 04:03:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2023-02-16 04:03:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 04:03:34,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:34,338 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:34,358 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-16 04:03:34,544 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-16 04:03:34,545 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:34,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1313459023, now seen corresponding path program 1 times [2023-02-16 04:03:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:34,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300311935] [2023-02-16 04:03:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,547 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-16 04:03:34,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:34,548 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-16 04:03:34,550 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-16 04:03:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:34,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:03:34,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:34,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:34,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300311935] [2023-02-16 04:03:34,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300311935] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:34,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:34,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682744917] [2023-02-16 04:03:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:34,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:34,587 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 04:03:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:34,606 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2023-02-16 04:03:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:34,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2023-02-16 04:03:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:34,607 INFO L225 Difference]: With dead ends: 73 [2023-02-16 04:03:34,607 INFO L226 Difference]: Without dead ends: 72 [2023-02-16 04:03:34,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-16 04:03:34,609 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:34,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 149 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-16 04:03:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-02-16 04:03:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 59 states have internal predecessors, (71), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2023-02-16 04:03:34,615 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 16 [2023-02-16 04:03:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:34,615 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2023-02-16 04:03:34,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 04:03:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2023-02-16 04:03:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 04:03:34,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:34,616 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:34,637 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-16 04:03:34,843 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-16 04:03:34,843 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1373713817, now seen corresponding path program 1 times [2023-02-16 04:03:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:34,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280084333] [2023-02-16 04:03:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,847 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-16 04:03:34,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:34,848 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-16 04:03:34,881 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-16 04:03:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:34,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:03:34,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:34,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:34,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280084333] [2023-02-16 04:03:34,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280084333] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:34,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:34,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577770881] [2023-02-16 04:03:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:34,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:34,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:34,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:34,941 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-16 04:03:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:34,968 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2023-02-16 04:03:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:34,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2023-02-16 04:03:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:34,970 INFO L225 Difference]: With dead ends: 72 [2023-02-16 04:03:34,970 INFO L226 Difference]: Without dead ends: 71 [2023-02-16 04:03:34,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-16 04:03:34,971 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:34,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 148 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-16 04:03:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-02-16 04:03:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 58 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2023-02-16 04:03:34,989 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2023-02-16 04:03:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:34,990 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2023-02-16 04:03:34,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-16 04:03:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2023-02-16 04:03:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 04:03:34,990 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:34,991 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:34,999 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-16 04:03:35,197 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-16 04:03:35,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1373781343, now seen corresponding path program 1 times [2023-02-16 04:03:35,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:35,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725853445] [2023-02-16 04:03:35,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:35,198 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-16 04:03:35,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:35,200 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-16 04:03:35,202 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-16 04:03:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:35,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:35,314 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-16 04:03:35,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:35,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:35,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725853445] [2023-02-16 04:03:35,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725853445] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:35,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:35,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:35,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865594193] [2023-02-16 04:03:35,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:35,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:35,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:35,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:35,316 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:35,494 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2023-02-16 04:03:35,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:35,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-16 04:03:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:35,499 INFO L225 Difference]: With dead ends: 84 [2023-02-16 04:03:35,499 INFO L226 Difference]: Without dead ends: 83 [2023-02-16 04:03:35,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-16 04:03:35,500 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 55 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:35,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 170 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-16 04:03:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2023-02-16 04:03:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 63 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2023-02-16 04:03:35,508 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 18 [2023-02-16 04:03:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:35,508 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2023-02-16 04:03:35,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2023-02-16 04:03:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 04:03:35,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:35,509 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-16 04:03:35,517 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-16 04:03:35,713 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-16 04:03:35,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -581634771, now seen corresponding path program 1 times [2023-02-16 04:03:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:35,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732909469] [2023-02-16 04:03:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:35,714 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-16 04:03:35,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:35,720 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-16 04:03:35,721 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-16 04:03:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:35,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:36,049 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-16 04:03:36,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:36,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:36,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732909469] [2023-02-16 04:03:36,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732909469] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:36,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:36,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 04:03:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784249470] [2023-02-16 04:03:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:36,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:36,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:36,051 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-16 04:03:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:37,947 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2023-02-16 04:03:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 04:03:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-16 04:03:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:37,948 INFO L225 Difference]: With dead ends: 89 [2023-02-16 04:03:37,948 INFO L226 Difference]: Without dead ends: 88 [2023-02-16 04:03:37,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:37,949 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:37,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-16 04:03:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-16 04:03:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2023-02-16 04:03:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 57 states have internal predecessors, (69), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-02-16 04:03:37,957 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 21 [2023-02-16 04:03:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:37,957 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-02-16 04:03:37,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-16 04:03:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2023-02-16 04:03:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 04:03:37,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:37,958 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:37,979 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-16 04:03:38,164 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-16 04:03:38,165 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:38,166 INFO L85 PathProgramCache]: Analyzing trace with hash -998317733, now seen corresponding path program 1 times [2023-02-16 04:03:38,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:38,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114215700] [2023-02-16 04:03:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:38,166 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-16 04:03:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:38,167 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-16 04:03:38,170 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-16 04:03:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:38,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:38,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:38,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:38,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114215700] [2023-02-16 04:03:38,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114215700] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:38,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:38,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-16 04:03:38,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035003853] [2023-02-16 04:03:38,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:38,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:38,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:38,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:38,322 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:38,401 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2023-02-16 04:03:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-02-16 04:03:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:38,402 INFO L225 Difference]: With dead ends: 102 [2023-02-16 04:03:38,404 INFO L226 Difference]: Without dead ends: 70 [2023-02-16 04:03:38,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:38,409 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 33 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:38,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 292 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-16 04:03:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-02-16 04:03:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 57 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2023-02-16 04:03:38,440 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 38 [2023-02-16 04:03:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:38,441 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2023-02-16 04:03:38,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2023-02-16 04:03:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 04:03:38,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:38,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:38,450 INFO L552 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)] Ended with exit code 0 [2023-02-16 04:03:38,643 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-16 04:03:38,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1701001285, now seen corresponding path program 1 times [2023-02-16 04:03:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:38,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825453469] [2023-02-16 04:03:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:38,645 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-16 04:03:38,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:38,646 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-16 04:03:38,649 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-16 04:03:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:38,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:38,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:38,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825453469] [2023-02-16 04:03:38,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825453469] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:38,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:38,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-16 04:03:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330046587] [2023-02-16 04:03:38,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:38,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:38,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:38,755 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:38,801 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2023-02-16 04:03:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2023-02-16 04:03:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:38,802 INFO L225 Difference]: With dead ends: 137 [2023-02-16 04:03:38,802 INFO L226 Difference]: Without dead ends: 104 [2023-02-16 04:03:38,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:38,803 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 31 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:38,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 481 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-16 04:03:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2023-02-16 04:03:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 63 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 04:03:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2023-02-16 04:03:38,811 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 42 [2023-02-16 04:03:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:38,811 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2023-02-16 04:03:38,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2023-02-16 04:03:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 04:03:38,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:38,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:38,819 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-16 04:03:39,019 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-16 04:03:39,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash 599821305, now seen corresponding path program 1 times [2023-02-16 04:03:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:39,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243126742] [2023-02-16 04:03:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:39,020 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-16 04:03:39,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:39,021 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-16 04:03:39,023 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-16 04:03:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:39,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:39,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:39,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:39,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243126742] [2023-02-16 04:03:39,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243126742] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:39,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:39,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 04:03:39,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814598537] [2023-02-16 04:03:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:39,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:39,101 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:39,152 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2023-02-16 04:03:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:39,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-02-16 04:03:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:39,154 INFO L225 Difference]: With dead ends: 140 [2023-02-16 04:03:39,154 INFO L226 Difference]: Without dead ends: 110 [2023-02-16 04:03:39,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:39,156 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 28 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:39,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 351 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-16 04:03:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2023-02-16 04:03:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 70 states have internal predecessors, (83), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 04:03:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2023-02-16 04:03:39,165 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 42 [2023-02-16 04:03:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:39,165 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2023-02-16 04:03:39,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2023-02-16 04:03:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 04:03:39,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:39,166 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:39,173 INFO L552 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)] Ended with exit code 0 [2023-02-16 04:03:39,376 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-16 04:03:39,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash -680042373, now seen corresponding path program 1 times [2023-02-16 04:03:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:39,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127872348] [2023-02-16 04:03:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:39,377 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-16 04:03:39,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:39,379 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-16 04:03:39,381 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-16 04:03:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 04:03:39,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:39,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:39,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:39,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127872348] [2023-02-16 04:03:39,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127872348] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:39,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:39,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 04:03:39,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71135361] [2023-02-16 04:03:39,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:39,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 04:03:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:39,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 04:03:39,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:39,445 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:39,494 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2023-02-16 04:03:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 04:03:39,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-02-16 04:03:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:39,495 INFO L225 Difference]: With dead ends: 115 [2023-02-16 04:03:39,495 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 04:03:39,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:39,496 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:39,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 399 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 04:03:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-16 04:03:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 63 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 04:03:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2023-02-16 04:03:39,501 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 42 [2023-02-16 04:03:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:39,502 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2023-02-16 04:03:39,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2023-02-16 04:03:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 04:03:39,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:39,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:39,526 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-16 04:03:39,709 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-16 04:03:39,710 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1554538856, now seen corresponding path program 1 times [2023-02-16 04:03:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:39,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497845163] [2023-02-16 04:03:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:39,710 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-16 04:03:39,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:39,711 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-16 04:03:39,713 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-16 04:03:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:39,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:39,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:39,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:39,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497845163] [2023-02-16 04:03:39,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497845163] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:39,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:39,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-16 04:03:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269879366] [2023-02-16 04:03:39,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:39,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:39,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:39,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:39,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:39,835 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:39,902 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2023-02-16 04:03:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:39,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2023-02-16 04:03:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:39,903 INFO L225 Difference]: With dead ends: 109 [2023-02-16 04:03:39,903 INFO L226 Difference]: Without dead ends: 67 [2023-02-16 04:03:39,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:39,904 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:39,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 527 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-16 04:03:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-16 04:03:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2023-02-16 04:03:39,908 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 46 [2023-02-16 04:03:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:39,908 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2023-02-16 04:03:39,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2023-02-16 04:03:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 04:03:39,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:39,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:39,923 INFO L552 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)] Ended with exit code 0 [2023-02-16 04:03:40,123 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-16 04:03:40,123 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1609276837, now seen corresponding path program 1 times [2023-02-16 04:03:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049054849] [2023-02-16 04:03:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:40,124 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-16 04:03:40,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:40,125 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-16 04:03:40,127 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-16 04:03:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:40,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 04:03:40,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:40,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:40,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:40,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049054849] [2023-02-16 04:03:40,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049054849] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:40,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:40,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649941661] [2023-02-16 04:03:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:40,288 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:40,409 INFO L93 Difference]: Finished difference Result 163 states and 190 transitions. [2023-02-16 04:03:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:40,409 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2023-02-16 04:03:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:40,410 INFO L225 Difference]: With dead ends: 163 [2023-02-16 04:03:40,410 INFO L226 Difference]: Without dead ends: 136 [2023-02-16 04:03:40,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:40,411 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 103 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:40,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 579 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-16 04:03:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2023-02-16 04:03:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.196969696969697) internal successors, (79), 69 states have internal predecessors, (79), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 04:03:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2023-02-16 04:03:40,418 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 50 [2023-02-16 04:03:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:40,418 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2023-02-16 04:03:40,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2023-02-16 04:03:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 04:03:40,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:40,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:40,426 INFO L552 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)] Ended with exit code 0 [2023-02-16 04:03:40,625 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-16 04:03:40,626 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:40,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1351111399, now seen corresponding path program 1 times [2023-02-16 04:03:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:40,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847584824] [2023-02-16 04:03:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:40,627 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-16 04:03:40,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:40,628 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-16 04:03:40,630 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-16 04:03:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:40,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 04:03:40,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:40,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:40,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:40,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847584824] [2023-02-16 04:03:40,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847584824] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:40,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:40,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 04:03:40,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436436418] [2023-02-16 04:03:40,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:40,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 04:03:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 04:03:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:40,796 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:41,031 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2023-02-16 04:03:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:41,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2023-02-16 04:03:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:41,032 INFO L225 Difference]: With dead ends: 144 [2023-02-16 04:03:41,032 INFO L226 Difference]: Without dead ends: 104 [2023-02-16 04:03:41,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-16 04:03:41,033 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 79 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:41,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 799 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-16 04:03:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2023-02-16 04:03:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 61 states have internal predecessors, (68), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-16 04:03:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2023-02-16 04:03:41,039 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 50 [2023-02-16 04:03:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:41,039 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2023-02-16 04:03:41,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2023-02-16 04:03:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 04:03:41,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:41,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:41,047 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-16 04:03:41,248 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-16 04:03:41,248 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -181865359, now seen corresponding path program 1 times [2023-02-16 04:03:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:41,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556314925] [2023-02-16 04:03:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:41,249 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-16 04:03:41,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:41,265 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-16 04:03:41,282 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-16 04:03:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:41,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 04:03:41,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:41,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:03:41,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:41,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556314925] [2023-02-16 04:03:41,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556314925] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:41,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:41,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-02-16 04:03:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198967062] [2023-02-16 04:03:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:41,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:41,467 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:41,527 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-02-16 04:03:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:03:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2023-02-16 04:03:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:41,529 INFO L225 Difference]: With dead ends: 72 [2023-02-16 04:03:41,529 INFO L226 Difference]: Without dead ends: 71 [2023-02-16 04:03:41,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:41,529 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:41,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-16 04:03:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-02-16 04:03:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 60 states have internal predecessors, (67), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-16 04:03:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2023-02-16 04:03:41,535 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 52 [2023-02-16 04:03:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:41,535 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2023-02-16 04:03:41,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2023-02-16 04:03:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 04:03:41,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:41,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:41,557 INFO L552 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)] Ended with exit code 0 [2023-02-16 04:03:41,743 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-16 04:03:41,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1342858669, now seen corresponding path program 1 times [2023-02-16 04:03:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:41,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496900143] [2023-02-16 04:03:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:41,744 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-16 04:03:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:41,745 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-16 04:03:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:41,815 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-16 04:03:41,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 04:03:41,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:41,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:03:41,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:41,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496900143] [2023-02-16 04:03:41,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496900143] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:41,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:41,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-02-16 04:03:41,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378127620] [2023-02-16 04:03:41,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:41,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:41,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:41,948 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:42,025 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2023-02-16 04:03:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2023-02-16 04:03:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:42,026 INFO L225 Difference]: With dead ends: 76 [2023-02-16 04:03:42,026 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 04:03:42,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:42,026 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:42,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 166 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 04:03:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2023-02-16 04:03:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-16 04:03:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2023-02-16 04:03:42,032 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 53 [2023-02-16 04:03:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:42,033 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2023-02-16 04:03:42,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2023-02-16 04:03:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-16 04:03:42,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:42,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:42,055 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-16 04:03:42,240 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-16 04:03:42,240 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2145100703, now seen corresponding path program 1 times [2023-02-16 04:03:42,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:42,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568457975] [2023-02-16 04:03:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:42,241 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-16 04:03:42,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:42,242 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-16 04:03:42,244 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-16 04:03:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:42,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 04:03:42,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:42,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:42,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:42,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568457975] [2023-02-16 04:03:42,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568457975] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:42,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1177233261] [2023-02-16 04:03:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:42,614 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:42,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 04:03:42,616 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 04:03:42,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-16 04:03:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:42,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 04:03:42,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 04:03:42,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 04:03:42,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1177233261] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:42,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:42,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 13 [2023-02-16 04:03:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178455350] [2023-02-16 04:03:42,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:42,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 04:03:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 04:03:42,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-02-16 04:03:42,728 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 04:03:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:43,084 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2023-02-16 04:03:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:43,084 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 64 [2023-02-16 04:03:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:43,085 INFO L225 Difference]: With dead ends: 128 [2023-02-16 04:03:43,085 INFO L226 Difference]: Without dead ends: 99 [2023-02-16 04:03:43,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2023-02-16 04:03:43,086 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 54 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:43,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 913 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 04:03:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-16 04:03:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2023-02-16 04:03:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.139240506329114) internal successors, (90), 80 states have internal predecessors, (90), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-16 04:03:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2023-02-16 04:03:43,092 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 64 [2023-02-16 04:03:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:43,092 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2023-02-16 04:03:43,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 04:03:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2023-02-16 04:03:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-16 04:03:43,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:43,093 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:43,117 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-16 04:03:43,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2023-02-16 04:03:43,515 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:43,515 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:43,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2017228173, now seen corresponding path program 2 times [2023-02-16 04:03:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:43,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913144350] [2023-02-16 04:03:43,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:03:43,516 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-16 04:03:43,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:43,533 INFO L229 MonitoredProcess]: Starting monitored process 19 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-16 04:03:43,535 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 (19)] Waiting until timeout for monitored process [2023-02-16 04:03:43,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 04:03:43,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:03:43,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:43,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 04:03:43,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:43,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:43,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913144350] [2023-02-16 04:03:43,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913144350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:43,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:43,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349016621] [2023-02-16 04:03:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:43,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:43,639 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 04:03:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:43,811 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2023-02-16 04:03:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2023-02-16 04:03:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:43,812 INFO L225 Difference]: With dead ends: 149 [2023-02-16 04:03:43,813 INFO L226 Difference]: Without dead ends: 94 [2023-02-16 04:03:43,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-02-16 04:03:43,813 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:43,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 521 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-16 04:03:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-16 04:03:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.139240506329114) internal successors, (90), 80 states have internal predecessors, (90), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-16 04:03:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2023-02-16 04:03:43,822 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 64 [2023-02-16 04:03:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:43,822 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2023-02-16 04:03:43,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 04:03:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2023-02-16 04:03:43,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-16 04:03:43,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:43,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:43,838 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 (19)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:44,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-16 04:03:44,030 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash -353543927, now seen corresponding path program 1 times [2023-02-16 04:03:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:44,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426525787] [2023-02-16 04:03:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:44,034 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-16 04:03:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:44,035 INFO L229 MonitoredProcess]: Starting monitored process 20 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-16 04:03:44,044 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 (20)] Waiting until timeout for monitored process [2023-02-16 04:03:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:44,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:44,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 04:03:44,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:44,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:44,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426525787] [2023-02-16 04:03:44,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426525787] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:44,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:44,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:44,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342075099] [2023-02-16 04:03:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:44,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:44,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:44,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:44,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:44,113 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 04:03:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:44,201 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2023-02-16 04:03:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:44,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2023-02-16 04:03:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:44,202 INFO L225 Difference]: With dead ends: 99 [2023-02-16 04:03:44,202 INFO L226 Difference]: Without dead ends: 93 [2023-02-16 04:03:44,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-16 04:03:44,203 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:44,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-16 04:03:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2023-02-16 04:03:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 66 states have internal predecessors, (75), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 04:03:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2023-02-16 04:03:44,207 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 66 [2023-02-16 04:03:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:44,208 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2023-02-16 04:03:44,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 04:03:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2023-02-16 04:03:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-16 04:03:44,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:44,208 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:44,217 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 (20)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:44,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-16 04:03:44,416 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1874504783, now seen corresponding path program 1 times [2023-02-16 04:03:44,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:44,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034395520] [2023-02-16 04:03:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:44,417 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-16 04:03:44,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:44,418 INFO L229 MonitoredProcess]: Starting monitored process 21 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-16 04:03:44,449 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 (21)] Waiting until timeout for monitored process [2023-02-16 04:03:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:44,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 04:03:44,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 04:03:44,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 04:03:44,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:44,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034395520] [2023-02-16 04:03:44,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034395520] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:44,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:44,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-16 04:03:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528327794] [2023-02-16 04:03:44,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:44,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 04:03:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 04:03:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:44,619 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 04:03:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:44,710 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2023-02-16 04:03:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 72 [2023-02-16 04:03:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:44,711 INFO L225 Difference]: With dead ends: 102 [2023-02-16 04:03:44,711 INFO L226 Difference]: Without dead ends: 64 [2023-02-16 04:03:44,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:44,711 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:44,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 544 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-16 04:03:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-16 04:03:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 04:03:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-02-16 04:03:44,715 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 72 [2023-02-16 04:03:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:44,715 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-02-16 04:03:44,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 04:03:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-02-16 04:03:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-16 04:03:44,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:44,716 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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-16 04:03:44,723 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 (21)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:44,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-16 04:03:44,923 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash 281509725, now seen corresponding path program 1 times [2023-02-16 04:03:44,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:44,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538967031] [2023-02-16 04:03:44,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:44,924 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-16 04:03:44,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:44,925 INFO L229 MonitoredProcess]: Starting monitored process 22 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-16 04:03:44,927 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 (22)] Waiting until timeout for monitored process [2023-02-16 04:03:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:44,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:03:44,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-16 04:03:45,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:45,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:45,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538967031] [2023-02-16 04:03:45,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538967031] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:45,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:45,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548127331] [2023-02-16 04:03:45,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:45,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:45,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:45,101 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:45,452 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-02-16 04:03:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2023-02-16 04:03:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:45,453 INFO L225 Difference]: With dead ends: 64 [2023-02-16 04:03:45,453 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 04:03:45,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:45,454 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:45,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 04:03:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 04:03:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 04:03:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 04:03:45,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2023-02-16 04:03:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:45,455 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 04:03:45,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 04:03:45,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 04:03:45,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-16 04:03:45,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-16 04:03:45,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-16 04:03:45,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-16 04:03:45,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-16 04:03:45,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-16 04:03:45,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-16 04:03:45,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-16 04:03:45,466 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 (22)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:45,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-16 04:03:45,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 04:03:50,448 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L895 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-16 04:03:50,449 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-02-16 04:03:50,449 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L895 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32))) (and (= base2flt_~m (_ bv0 32)) (= base2flt_~__retres4~0 (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point L258-2(lines 258 262) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 112) no Hoare annotation was computed. [2023-02-16 04:03:50,450 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 137) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L895 garLoopResultBuilder]: At program point L126-2(lines 126 137) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32))) (.cse1 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) |ULTIMATE.start_addflt_~ea~0#1|) (bvneg ((_ sign_extend 1) |ULTIMATE.start_addflt_~eb~0#1|)))))) (or (and .cse0 (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv128 32)) (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)))) .cse1) (and (bvult (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv4294967169 32)) (_ bv32 32)) .cse0 (= (bvadd |ULTIMATE.start_addflt_~a#1| (_ bv1 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (_ bv0 32)) .cse1) (and .cse0 .cse1 (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv127 32)) (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32))))))) [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 287) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L283-2(lines 283 287) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L333-2(lines 333 337) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 225 356) the Hoare annotation is: true [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 132) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 100) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L94-2(lines 93 146) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L317-1(lines 315 349) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L902 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: true [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L251-1(line 251) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L902 garLoopResultBuilder]: At program point L144(lines 93 146) the Hoare annotation is: true [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 272) no Hoare annotation was computed. [2023-02-16 04:03:50,451 INFO L899 garLoopResultBuilder]: For program point L268-2(lines 268 272) no Hoare annotation was computed. [2023-02-16 04:03:50,452 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2023-02-16 04:03:50,452 INFO L902 garLoopResultBuilder]: At program point L293-1(lines 293 302) the Hoare annotation is: true [2023-02-16 04:03:50,452 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2023-02-16 04:03:50,452 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32)) [2023-02-16 04:03:50,452 INFO L899 garLoopResultBuilder]: For program point L252-1(line 252) no Hoare annotation was computed. [2023-02-16 04:03:50,452 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-02-16 04:03:50,452 INFO L899 garLoopResultBuilder]: For program point L112-1(line 112) no Hoare annotation was computed. [2023-02-16 04:03:50,452 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2023-02-16 04:03:50,453 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 04:03:50,454 INFO L895 garLoopResultBuilder]: At program point L253(line 253) the Hoare annotation is: (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32)) [2023-02-16 04:03:50,454 INFO L899 garLoopResultBuilder]: For program point L253-1(line 253) no Hoare annotation was computed. [2023-02-16 04:03:50,454 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 311) no Hoare annotation was computed. [2023-02-16 04:03:50,454 INFO L899 garLoopResultBuilder]: For program point L278-1(lines 249 355) no Hoare annotation was computed. [2023-02-16 04:03:50,454 INFO L902 garLoopResultBuilder]: At program point addflt_returnLabel#1(lines 83 147) the Hoare annotation is: true [2023-02-16 04:03:50,454 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 324) no Hoare annotation was computed. [2023-02-16 04:03:50,454 INFO L899 garLoopResultBuilder]: For program point L320-2(lines 320 324) no Hoare annotation was computed. [2023-02-16 04:03:50,454 INFO L899 garLoopResultBuilder]: For program point L279(lines 279 308) no Hoare annotation was computed. [2023-02-16 04:03:50,454 INFO L895 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (and (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv128 32)) (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)))) (bvsle (bvadd ((_ sign_extend 1) |ULTIMATE.start_addflt_~ea~0#1|) (bvneg ((_ sign_extend 1) |ULTIMATE.start_addflt_~eb~0#1|))) (_ bv2147483647 33))) [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point L114-1(line 114) no Hoare annotation was computed. [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 300) no Hoare annotation was computed. [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point L296-2(lines 296 300) no Hoare annotation was computed. [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 264) no Hoare annotation was computed. [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point L255-2(lines 249 355) no Hoare annotation was computed. [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 115) no Hoare annotation was computed. [2023-02-16 04:03:50,455 INFO L899 garLoopResultBuilder]: For program point L280(lines 280 289) no Hoare annotation was computed. [2023-02-16 04:03:50,456 INFO L902 garLoopResultBuilder]: At program point L280-2(lines 280 289) the Hoare annotation is: true [2023-02-16 04:03:50,456 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-02-16 04:03:50,456 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 339) no Hoare annotation was computed. [2023-02-16 04:03:50,456 INFO L899 garLoopResultBuilder]: For program point L330-2(lines 329 345) no Hoare annotation was computed. [2023-02-16 04:03:50,456 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 04:03:50,456 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 115) no Hoare annotation was computed. [2023-02-16 04:03:50,456 INFO L895 garLoopResultBuilder]: At program point L116(line 116) the Hoare annotation is: (let ((.cse0 (bvadd ((_ sign_extend 1) |ULTIMATE.start_addflt_~ea~0#1|) (bvneg ((_ sign_extend 1) |ULTIMATE.start_addflt_~eb~0#1|))))) (and (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv128 32)) (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)))) (bvsle .cse0 (_ bv2147483647 33)) (bvsle (_ bv6442450944 33) .cse0))) [2023-02-16 04:03:50,456 INFO L899 garLoopResultBuilder]: For program point L116-1(line 116) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L899 garLoopResultBuilder]: For program point L141-1(line 141) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L899 garLoopResultBuilder]: For program point L265-1(lines 265 274) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L899 garLoopResultBuilder]: For program point L133-1(line 133) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 112) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 351) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L899 garLoopResultBuilder]: For program point L315-1(lines 315 351) no Hoare annotation was computed. [2023-02-16 04:03:50,457 INFO L902 garLoopResultBuilder]: At program point L340-1(lines 327 345) the Hoare annotation is: true [2023-02-16 04:03:50,457 INFO L902 garLoopResultBuilder]: At program point $Ultimate##48(lines 317 326) the Hoare annotation is: true [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point L291(lines 279 306) no Hoare annotation was computed. [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-16 04:03:50,458 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-16 04:03:50,459 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-16 04:03:50,461 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:50,462 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:03:50,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,476 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,476 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:03:50 BoogieIcfgContainer [2023-02-16 04:03:50,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:03:50,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:03:50,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:03:50,482 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:03:50,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:33" (3/4) ... [2023-02-16 04:03:50,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 04:03:50,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-16 04:03:50,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-16 04:03:50,499 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-02-16 04:03:50,499 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-16 04:03:50,499 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 04:03:50,500 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 04:03:50,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) || (m == 0bv32 && __retres4 == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-16 04:03:50,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-16 04:03:50,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-16 04:03:50,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-16 04:03:50,541 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 04:03:50,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:03:50,542 INFO L158 Benchmark]: Toolchain (without parser) took 17674.37ms. Allocated memory was 94.4MB in the beginning and 130.0MB in the end (delta: 35.7MB). Free memory was 71.1MB in the beginning and 49.8MB in the end (delta: 21.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2023-02-16 04:03:50,542 INFO L158 Benchmark]: CDTParser took 13.82ms. Allocated memory is still 69.2MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:50,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.75ms. Allocated memory is still 94.4MB. Free memory was 70.8MB in the beginning and 56.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 04:03:50,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 94.4MB. Free memory was 56.5MB in the beginning and 54.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:03:50,543 INFO L158 Benchmark]: Boogie Preprocessor took 44.60ms. Allocated memory is still 94.4MB. Free memory was 54.4MB in the beginning and 52.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:03:50,544 INFO L158 Benchmark]: RCFGBuilder took 477.38ms. Allocated memory is still 94.4MB. Free memory was 52.6MB in the beginning and 60.4MB in the end (delta: -7.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2023-02-16 04:03:50,544 INFO L158 Benchmark]: TraceAbstraction took 16778.47ms. Allocated memory was 94.4MB in the beginning and 130.0MB in the end (delta: 35.7MB). Free memory was 59.6MB in the beginning and 54.0MB in the end (delta: 5.6MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2023-02-16 04:03:50,545 INFO L158 Benchmark]: Witness Printer took 60.01ms. Allocated memory is still 130.0MB. Free memory was 54.0MB in the beginning and 49.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 04:03:50,549 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 13.82ms. Allocated memory is still 69.2MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.75ms. Allocated memory is still 94.4MB. Free memory was 70.8MB in the beginning and 56.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 94.4MB. Free memory was 56.5MB in the beginning and 54.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.60ms. Allocated memory is still 94.4MB. Free memory was 54.4MB in the beginning and 52.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.38ms. Allocated memory is still 94.4MB. Free memory was 52.6MB in the beginning and 60.4MB in the end (delta: -7.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16778.47ms. Allocated memory was 94.4MB in the beginning and 130.0MB in the end (delta: 35.7MB). Free memory was 59.6MB in the beginning and 54.0MB in the end (delta: 5.6MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * Witness Printer took 60.01ms. Allocated memory is still 130.0MB. Free memory was 54.0MB in the beginning and 49.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] * 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 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 102 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 7042 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5498 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1453 IncrementalHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1544 mSDtfsCounter, 1453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1302 GetRequests, 1161 SyntacticMatches, 6 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, InterpolantAutomatonStates: 123, 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, 20 MinimizatonAttempts, 210 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 110 PreInvPairs, 153 NumberOfFragments, 235 HoareAnnotationTreeSize, 110 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 9014 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 910 NumberOfCodeBlocks, 883 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1249 ConstructedInterpolants, 47 QuantifiedInterpolants, 2713 SizeOfPredicates, 69 NumberOfNonLiveVariables, 1689 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 399/444 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-16 04:03:50,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,571 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 28]: Loop Invariant [2023-02-16 04:03:50,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: (((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) || (m == 0bv32 && __retres4 == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant [2023-02-16 04:03:50,575 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,575 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,575 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 57]: Loop Invariant [2023-02-16 04:03:50,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,577 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:50,577 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:50,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-16 04:03:50,592 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 Result: TRUE