./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:03:25,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:03:25,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:03:25,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:03:25,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:03:25,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:03:25,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:03:25,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:03:25,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:03:25,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:03:25,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:03:25,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:03:25,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:03:25,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:03:25,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:03:25,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:03:25,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:03:25,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:03:25,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:03:25,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:03:25,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:03:25,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:03:25,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:03:25,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:03:25,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:03:25,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:03:25,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:03:25,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:03:25,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:03:25,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:03:25,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:03:25,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:03:25,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:03:25,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:03:25,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:03:25,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:03:25,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:03:25,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:03:25,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:03:25,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:03:25,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:03:25,858 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:25,878 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:03:25,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:03:25,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:03:25,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:03:25,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:03:25,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:03:25,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:03:25,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:03:25,880 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:03:25,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:03:25,881 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:03:25,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:03:25,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 04:03:25,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:03:25,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:03:25,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:03:25,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:03:25,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:03:25,882 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:03:25,882 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:03:25,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:03:25,883 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:03:25,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:03:25,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:03:25,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:03:25,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:03:25,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:25,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:03:25,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:03:25,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:03:25,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 04:03:25,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 04:03:25,884 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:03:25,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:03:25,884 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:03:25,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:03:25,885 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:03:25,885 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2023-02-16 04:03:26,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:03:26,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:03:26,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:03:26,104 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:03:26,104 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:03:26,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2023-02-16 04:03:27,020 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:03:27,148 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:03:27,148 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2023-02-16 04:03:27,153 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493040a42/3c1f2dd6c8f44036abfdd2a549f80cb5/FLAGfa959196b [2023-02-16 04:03:27,162 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493040a42/3c1f2dd6c8f44036abfdd2a549f80cb5 [2023-02-16 04:03:27,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:03:27,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:03:27,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:27,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:03:27,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:03:27,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:27" (1/1) ... [2023-02-16 04:03:27,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8fceb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:27, skipping insertion in model container [2023-02-16 04:03:27,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:27" (1/1) ... [2023-02-16 04:03:27,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:03:27,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:03:27,284 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_4-3a.c.cil.c[730,743] [2023-02-16 04:03:27,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:27,335 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:03:27,387 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_4-3a.c.cil.c[730,743] [2023-02-16 04:03:27,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:27,424 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:03:27,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:27 WrapperNode [2023-02-16 04:03:27,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:27,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:27,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:03:27,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:03:27,430 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:27" (1/1) ... [2023-02-16 04:03:27,438 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:27" (1/1) ... [2023-02-16 04:03:27,453 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-16 04:03:27,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:27,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:03:27,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:03:27,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:03:27,461 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:27" (1/1) ... [2023-02-16 04:03:27,461 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:27" (1/1) ... [2023-02-16 04:03:27,473 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:27" (1/1) ... [2023-02-16 04:03:27,481 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:27" (1/1) ... [2023-02-16 04:03:27,485 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:27" (1/1) ... [2023-02-16 04:03:27,492 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:27" (1/1) ... [2023-02-16 04:03:27,493 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:27" (1/1) ... [2023-02-16 04:03:27,494 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:27" (1/1) ... [2023-02-16 04:03:27,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:03:27,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:03:27,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:03:27,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:03:27,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:27" (1/1) ... [2023-02-16 04:03:27,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:27,519 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:27,535 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:27,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:03:27,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 04:03:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-16 04:03:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-16 04:03:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:03:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:03:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-02-16 04:03:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-02-16 04:03:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 04:03:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 04:03:27,601 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:03:27,602 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:03:27,897 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:03:27,902 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:03:27,903 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:03:27,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:27 BoogieIcfgContainer [2023-02-16 04:03:27,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:03:27,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:03:27,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:03:27,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:03:27,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:03:27" (1/3) ... [2023-02-16 04:03:27,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4428c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:27, skipping insertion in model container [2023-02-16 04:03:27,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:27" (2/3) ... [2023-02-16 04:03:27,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4428c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:27, skipping insertion in model container [2023-02-16 04:03:27,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:27" (3/3) ... [2023-02-16 04:03:27,909 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2023-02-16 04:03:27,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:03:27,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-16 04:03:27,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:03:27,958 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;@447b04f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:03:27,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-16 04:03:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 93 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-16 04:03:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:27,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:27,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:27,967 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:27,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1106600790, now seen corresponding path program 1 times [2023-02-16 04:03:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:27,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857869784] [2023-02-16 04:03:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:28,164 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:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:28,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857869784] [2023-02-16 04:03:28,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857869784] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:28,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:28,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:28,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039584482] [2023-02-16 04:03:28,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:28,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:28,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:28,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:28,199 INFO L87 Difference]: Start difference. First operand has 106 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 93 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 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:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:28,280 INFO L93 Difference]: Finished difference Result 257 states and 375 transitions. [2023-02-16 04:03:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:28,284 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:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:28,290 INFO L225 Difference]: With dead ends: 257 [2023-02-16 04:03:28,290 INFO L226 Difference]: Without dead ends: 144 [2023-02-16 04:03:28,293 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:28,295 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 83 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 370 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.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:28,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 370 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-16 04:03:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2023-02-16 04:03:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 122 states have internal predecessors, (167), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2023-02-16 04:03:28,328 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 9 [2023-02-16 04:03:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:28,328 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2023-02-16 04:03:28,329 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:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2023-02-16 04:03:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 04:03:28,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:28,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:28,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 04:03:28,330 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:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash 888286794, now seen corresponding path program 1 times [2023-02-16 04:03:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:28,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972851811] [2023-02-16 04:03:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:28,432 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:28,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:28,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972851811] [2023-02-16 04:03:28,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972851811] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:28,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:28,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:28,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801787195] [2023-02-16 04:03:28,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:28,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:28,436 INFO L87 Difference]: Start difference. First operand 134 states and 182 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:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:28,566 INFO L93 Difference]: Finished difference Result 257 states and 339 transitions. [2023-02-16 04:03:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:28,566 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:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:28,568 INFO L225 Difference]: With dead ends: 257 [2023-02-16 04:03:28,568 INFO L226 Difference]: Without dead ends: 162 [2023-02-16 04:03:28,569 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:28,570 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 128 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:28,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 451 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-16 04:03:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2023-02-16 04:03:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 131 states have internal predecessors, (179), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2023-02-16 04:03:28,582 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 14 [2023-02-16 04:03:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:28,583 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2023-02-16 04:03:28,583 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:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2023-02-16 04:03:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 04:03:28,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:28,584 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:28,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 04:03:28,585 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:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1505602901, now seen corresponding path program 1 times [2023-02-16 04:03:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:28,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619836053] [2023-02-16 04:03:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:28,615 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:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:28,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619836053] [2023-02-16 04:03:28,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619836053] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:28,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:28,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:28,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582681419] [2023-02-16 04:03:28,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:28,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:28,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:28,618 INFO L87 Difference]: Start difference. First operand 143 states and 194 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:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:28,641 INFO L93 Difference]: Finished difference Result 149 states and 201 transitions. [2023-02-16 04:03:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:28,641 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:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:28,643 INFO L225 Difference]: With dead ends: 149 [2023-02-16 04:03:28,643 INFO L226 Difference]: Without dead ends: 148 [2023-02-16 04:03:28,643 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:28,644 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 229 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:28,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 229 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:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-16 04:03:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2023-02-16 04:03:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 129 states have internal predecessors, (176), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 191 transitions. [2023-02-16 04:03:28,655 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 191 transitions. Word has length 16 [2023-02-16 04:03:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:28,656 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 191 transitions. [2023-02-16 04:03:28,656 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:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 191 transitions. [2023-02-16 04:03:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 04:03:28,657 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:28,657 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:28,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 04:03:28,657 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:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1767086950, now seen corresponding path program 1 times [2023-02-16 04:03:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:28,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643823123] [2023-02-16 04:03:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:28,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:28,709 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:28,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:28,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643823123] [2023-02-16 04:03:28,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643823123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:28,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:28,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:28,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431389273] [2023-02-16 04:03:28,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:28,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:28,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:28,714 INFO L87 Difference]: Start difference. First operand 141 states and 191 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:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:28,807 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2023-02-16 04:03:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:28,808 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:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:28,811 INFO L225 Difference]: With dead ends: 167 [2023-02-16 04:03:28,812 INFO L226 Difference]: Without dead ends: 165 [2023-02-16 04:03:28,812 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:28,813 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 105 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 456 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:28,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 456 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-16 04:03:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2023-02-16 04:03:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.5) internal successors, (174), 129 states have internal predecessors, (174), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 189 transitions. [2023-02-16 04:03:28,823 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 189 transitions. Word has length 15 [2023-02-16 04:03:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:28,823 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 189 transitions. [2023-02-16 04:03:28,823 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:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 189 transitions. [2023-02-16 04:03:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:28,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:28,824 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:28,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 04:03:28,824 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:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash -542322912, now seen corresponding path program 1 times [2023-02-16 04:03:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:28,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511460272] [2023-02-16 04:03:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:28,872 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:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:28,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511460272] [2023-02-16 04:03:28,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511460272] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:28,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:28,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084484980] [2023-02-16 04:03:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:28,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:28,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:28,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:28,889 INFO L87 Difference]: Start difference. First operand 141 states and 189 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:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:28,960 INFO L93 Difference]: Finished difference Result 199 states and 265 transitions. [2023-02-16 04:03:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:28,961 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:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:28,965 INFO L225 Difference]: With dead ends: 199 [2023-02-16 04:03:28,965 INFO L226 Difference]: Without dead ends: 197 [2023-02-16 04:03:28,966 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:28,969 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 89 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 414 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:28,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 414 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-16 04:03:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2023-02-16 04:03:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 232 transitions. [2023-02-16 04:03:28,983 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 232 transitions. Word has length 17 [2023-02-16 04:03:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:28,983 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 232 transitions. [2023-02-16 04:03:28,983 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:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 232 transitions. [2023-02-16 04:03:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:28,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:28,984 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:28,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 04:03:28,984 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:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash -570950268, now seen corresponding path program 1 times [2023-02-16 04:03:28,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:28,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998555471] [2023-02-16 04:03:28,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,030 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:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:29,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998555471] [2023-02-16 04:03:29,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998555471] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:29,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:29,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996393442] [2023-02-16 04:03:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:29,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:29,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:29,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:29,037 INFO L87 Difference]: Start difference. First operand 169 states and 232 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:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:29,102 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2023-02-16 04:03:29,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:29,102 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:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:29,106 INFO L225 Difference]: With dead ends: 197 [2023-02-16 04:03:29,106 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 04:03:29,107 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:29,112 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 87 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 415 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:29,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 415 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:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 04:03:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2023-02-16 04:03:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 160 states have internal predecessors, (221), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions. [2023-02-16 04:03:29,130 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 17 [2023-02-16 04:03:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:29,131 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 236 transitions. [2023-02-16 04:03:29,131 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:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2023-02-16 04:03:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:29,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:29,132 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:29,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 04:03:29,132 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:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash 846267151, now seen corresponding path program 1 times [2023-02-16 04:03:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:29,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800756140] [2023-02-16 04:03:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,172 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:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:29,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800756140] [2023-02-16 04:03:29,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800756140] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:29,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171023053] [2023-02-16 04:03:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:29,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:29,176 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:29,177 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:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:29,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:29,267 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:29,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:29,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171023053] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:29,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:29,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-16 04:03:29,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380296990] [2023-02-16 04:03:29,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:29,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:29,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:29,269 INFO L87 Difference]: Start difference. First operand 173 states and 236 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:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:29,304 INFO L93 Difference]: Finished difference Result 213 states and 287 transitions. [2023-02-16 04:03:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:29,305 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:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:29,306 INFO L225 Difference]: With dead ends: 213 [2023-02-16 04:03:29,306 INFO L226 Difference]: Without dead ends: 212 [2023-02-16 04:03:29,306 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:29,308 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:29,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 252 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-16 04:03:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 168. [2023-02-16 04:03:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 155 states have internal predecessors, (213), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 228 transitions. [2023-02-16 04:03:29,321 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 228 transitions. Word has length 17 [2023-02-16 04:03:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:29,322 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 228 transitions. [2023-02-16 04:03:29,322 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:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 228 transitions. [2023-02-16 04:03:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 04:03:29,325 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:29,325 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:29,332 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:29,529 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:29,532 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:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash 355130216, now seen corresponding path program 1 times [2023-02-16 04:03:29,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:29,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351047297] [2023-02-16 04:03:29,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,576 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:29,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:29,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351047297] [2023-02-16 04:03:29,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351047297] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:29,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:29,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:29,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147315708] [2023-02-16 04:03:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:29,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:29,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:29,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:29,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:29,578 INFO L87 Difference]: Start difference. First operand 168 states and 228 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:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:29,614 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2023-02-16 04:03:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:29,615 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:29,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:29,616 INFO L225 Difference]: With dead ends: 214 [2023-02-16 04:03:29,616 INFO L226 Difference]: Without dead ends: 213 [2023-02-16 04:03:29,616 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:29,617 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 21 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 245 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:29,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 245 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:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-16 04:03:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 168. [2023-02-16 04:03:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 155 states have internal predecessors, (211), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 226 transitions. [2023-02-16 04:03:29,626 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 226 transitions. Word has length 19 [2023-02-16 04:03:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:29,626 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 226 transitions. [2023-02-16 04:03:29,626 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:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 226 transitions. [2023-02-16 04:03:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 04:03:29,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:29,630 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:29,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 04:03:29,630 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:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1004223459, now seen corresponding path program 1 times [2023-02-16 04:03:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:29,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457976260] [2023-02-16 04:03:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,719 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:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:29,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457976260] [2023-02-16 04:03:29,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457976260] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:29,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:29,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:29,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881060792] [2023-02-16 04:03:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:29,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:29,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:29,722 INFO L87 Difference]: Start difference. First operand 168 states and 226 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:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:29,780 INFO L93 Difference]: Finished difference Result 192 states and 257 transitions. [2023-02-16 04:03:29,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:29,781 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:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:29,783 INFO L225 Difference]: With dead ends: 192 [2023-02-16 04:03:29,783 INFO L226 Difference]: Without dead ends: 190 [2023-02-16 04:03:29,784 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:29,785 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 81 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 416 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:29,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 416 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:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-16 04:03:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 162. [2023-02-16 04:03:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 139 states have (on average 1.4532374100719425) internal successors, (202), 149 states have internal predecessors, (202), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 217 transitions. [2023-02-16 04:03:29,794 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 217 transitions. Word has length 24 [2023-02-16 04:03:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:29,794 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 217 transitions. [2023-02-16 04:03:29,795 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:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 217 transitions. [2023-02-16 04:03:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 04:03:29,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:29,796 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:29,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 04:03:29,797 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:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1032850815, now seen corresponding path program 1 times [2023-02-16 04:03:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:29,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283888818] [2023-02-16 04:03:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:29,861 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:29,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:29,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283888818] [2023-02-16 04:03:29,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283888818] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:29,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:29,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:29,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614185837] [2023-02-16 04:03:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:29,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:29,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:29,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:29,863 INFO L87 Difference]: Start difference. First operand 162 states and 217 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:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:29,926 INFO L93 Difference]: Finished difference Result 184 states and 245 transitions. [2023-02-16 04:03:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:29,927 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:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:29,928 INFO L225 Difference]: With dead ends: 184 [2023-02-16 04:03:29,928 INFO L226 Difference]: Without dead ends: 182 [2023-02-16 04:03:29,928 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:29,929 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 80 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 414 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:29,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 414 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:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-16 04:03:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2023-02-16 04:03:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 132 states have (on average 1.4393939393939394) internal successors, (190), 140 states have internal predecessors, (190), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 205 transitions. [2023-02-16 04:03:29,940 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 205 transitions. Word has length 24 [2023-02-16 04:03:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:29,940 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 205 transitions. [2023-02-16 04:03:29,940 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:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 205 transitions. [2023-02-16 04:03:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 04:03:29,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:29,941 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] [2023-02-16 04:03:29,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 04:03:29,942 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash -288190097, now seen corresponding path program 1 times [2023-02-16 04:03:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147878450] [2023-02-16 04:03:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-16 04:03:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,081 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:30,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:30,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147878450] [2023-02-16 04:03:30,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147878450] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:30,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663998394] [2023-02-16 04:03:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:30,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:30,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:30,082 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:30,084 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:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 04:03:30,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:30,184 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:30,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:30,304 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:30,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663998394] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:30,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:30,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2023-02-16 04:03:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412563735] [2023-02-16 04:03:30,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:30,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 04:03:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 04:03:30,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-02-16 04:03:30,305 INFO L87 Difference]: Start difference. First operand 153 states and 205 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:30,653 INFO L93 Difference]: Finished difference Result 443 states and 590 transitions. [2023-02-16 04:03:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 04:03:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2023-02-16 04:03:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:30,655 INFO L225 Difference]: With dead ends: 443 [2023-02-16 04:03:30,655 INFO L226 Difference]: Without dead ends: 295 [2023-02-16 04:03:30,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2023-02-16 04:03:30,658 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 262 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:30,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1700 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-16 04:03:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 134. [2023-02-16 04:03:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 118 states have internal predecessors, (153), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-16 04:03:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2023-02-16 04:03:30,668 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 30 [2023-02-16 04:03:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:30,669 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2023-02-16 04:03:30,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2023-02-16 04:03:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 04:03:30,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:30,671 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] [2023-02-16 04:03:30,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:30,879 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:30,880 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash 294012820, now seen corresponding path program 1 times [2023-02-16 04:03:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:30,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809334413] [2023-02-16 04:03:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:30,981 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:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:30,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809334413] [2023-02-16 04:03:30,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809334413] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:30,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:30,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:30,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552950562] [2023-02-16 04:03:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:30,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:30,983 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:31,062 INFO L93 Difference]: Finished difference Result 325 states and 421 transitions. [2023-02-16 04:03:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:31,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-02-16 04:03:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:31,064 INFO L225 Difference]: With dead ends: 325 [2023-02-16 04:03:31,064 INFO L226 Difference]: Without dead ends: 262 [2023-02-16 04:03:31,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:31,065 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 163 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:31,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1008 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-16 04:03:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 145. [2023-02-16 04:03:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.376068376068376) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2023-02-16 04:03:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2023-02-16 04:03:31,074 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 35 [2023-02-16 04:03:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:31,075 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2023-02-16 04:03:31,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2023-02-16 04:03:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 04:03:31,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:31,076 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:31,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 04:03:31,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash 379794388, now seen corresponding path program 1 times [2023-02-16 04:03:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:31,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127292669] [2023-02-16 04:03:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:31,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-16 04:03:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 04:03:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,178 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:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:31,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127292669] [2023-02-16 04:03:31,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127292669] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:31,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932148569] [2023-02-16 04:03:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:31,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:31,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:31,181 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:31,184 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:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 04:03:31,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:31,290 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:31,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:31,392 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:31,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932148569] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:31,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:31,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-02-16 04:03:31,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016507172] [2023-02-16 04:03:31,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:31,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 04:03:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:31,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 04:03:31,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-02-16 04:03:31,394 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-16 04:03:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:31,541 INFO L93 Difference]: Finished difference Result 317 states and 410 transitions. [2023-02-16 04:03:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:31,542 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 39 [2023-02-16 04:03:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:31,543 INFO L225 Difference]: With dead ends: 317 [2023-02-16 04:03:31,543 INFO L226 Difference]: Without dead ends: 239 [2023-02-16 04:03:31,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2023-02-16 04:03:31,544 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 232 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:31,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 2376 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-16 04:03:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 132. [2023-02-16 04:03:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 117 states have internal predecessors, (149), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-16 04:03:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2023-02-16 04:03:31,550 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 39 [2023-02-16 04:03:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:31,550 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2023-02-16 04:03:31,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-16 04:03:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2023-02-16 04:03:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 04:03:31,551 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:31,551 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] [2023-02-16 04:03:31,558 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:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:31,764 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1945363323, now seen corresponding path program 2 times [2023-02-16 04:03:31,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:31,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969463380] [2023-02-16 04:03:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:31,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,835 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:31,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:31,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969463380] [2023-02-16 04:03:31,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969463380] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:31,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:31,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:31,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123084753] [2023-02-16 04:03:31,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:31,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:31,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:31,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:31,836 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:31,953 INFO L93 Difference]: Finished difference Result 301 states and 388 transitions. [2023-02-16 04:03:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:31,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-16 04:03:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:31,954 INFO L225 Difference]: With dead ends: 301 [2023-02-16 04:03:31,954 INFO L226 Difference]: Without dead ends: 242 [2023-02-16 04:03:31,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:31,955 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 225 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:31,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1173 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-02-16 04:03:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 193. [2023-02-16 04:03:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 163 states have (on average 1.4110429447852761) internal successors, (230), 173 states have internal predecessors, (230), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-02-16 04:03:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 257 transitions. [2023-02-16 04:03:31,962 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 257 transitions. Word has length 39 [2023-02-16 04:03:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:31,962 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 257 transitions. [2023-02-16 04:03:31,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2023-02-16 04:03:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 04:03:31,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:31,963 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] [2023-02-16 04:03:31,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 04:03:31,963 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1945361401, now seen corresponding path program 1 times [2023-02-16 04:03:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:31,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574493022] [2023-02-16 04:03:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,096 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:32,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:32,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574493022] [2023-02-16 04:03:32,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574493022] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:32,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:32,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694017329] [2023-02-16 04:03:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:32,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:32,098 INFO L87 Difference]: Start difference. First operand 193 states and 257 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:32,254 INFO L93 Difference]: Finished difference Result 389 states and 502 transitions. [2023-02-16 04:03:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-16 04:03:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:32,255 INFO L225 Difference]: With dead ends: 389 [2023-02-16 04:03:32,255 INFO L226 Difference]: Without dead ends: 327 [2023-02-16 04:03:32,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:32,257 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 338 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:32,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1169 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-16 04:03:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 193. [2023-02-16 04:03:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 163 states have (on average 1.3987730061349692) internal successors, (228), 173 states have internal predecessors, (228), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-02-16 04:03:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 255 transitions. [2023-02-16 04:03:32,265 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 255 transitions. Word has length 39 [2023-02-16 04:03:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:32,266 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 255 transitions. [2023-02-16 04:03:32,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 255 transitions. [2023-02-16 04:03:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 04:03:32,267 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:32,267 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] [2023-02-16 04:03:32,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 04:03:32,267 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:32,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1888103099, now seen corresponding path program 1 times [2023-02-16 04:03:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:32,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105485434] [2023-02-16 04:03:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,372 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:32,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105485434] [2023-02-16 04:03:32,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105485434] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459462650] [2023-02-16 04:03:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:32,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:32,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:32,374 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:32,376 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:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 04:03:32,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:32,456 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:32,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:32,655 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:32,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459462650] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:32,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:32,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-02-16 04:03:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256989363] [2023-02-16 04:03:32,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:32,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 04:03:32,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 04:03:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-16 04:03:32,658 INFO L87 Difference]: Start difference. First operand 193 states and 255 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:32,815 INFO L93 Difference]: Finished difference Result 494 states and 672 transitions. [2023-02-16 04:03:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 04:03:32,816 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2023-02-16 04:03:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:32,817 INFO L225 Difference]: With dead ends: 494 [2023-02-16 04:03:32,817 INFO L226 Difference]: Without dead ends: 386 [2023-02-16 04:03:32,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-16 04:03:32,818 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 265 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:32,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1204 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-02-16 04:03:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 286. [2023-02-16 04:03:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 244 states have (on average 1.4057377049180328) internal successors, (343), 255 states have internal predecessors, (343), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2023-02-16 04:03:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 391 transitions. [2023-02-16 04:03:32,829 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 391 transitions. Word has length 39 [2023-02-16 04:03:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:32,829 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 391 transitions. [2023-02-16 04:03:32,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 391 transitions. [2023-02-16 04:03:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 04:03:32,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:32,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:32,836 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:33,034 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:33,034 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1841081669, now seen corresponding path program 1 times [2023-02-16 04:03:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:33,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503210012] [2023-02-16 04:03:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-16 04:03:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:33,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503210012] [2023-02-16 04:03:33,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503210012] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:33,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:33,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404142813] [2023-02-16 04:03:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:33,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:33,110 INFO L87 Difference]: Start difference. First operand 286 states and 391 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:33,232 INFO L93 Difference]: Finished difference Result 626 states and 859 transitions. [2023-02-16 04:03:33,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 04:03:33,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2023-02-16 04:03:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:33,235 INFO L225 Difference]: With dead ends: 626 [2023-02-16 04:03:33,235 INFO L226 Difference]: Without dead ends: 556 [2023-02-16 04:03:33,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-16 04:03:33,235 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 298 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:33,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1595 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-02-16 04:03:33,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 324. [2023-02-16 04:03:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 278 states have (on average 1.4028776978417266) internal successors, (390), 288 states have internal predecessors, (390), 26 states have call successors, (26), 10 states have call predecessors, (26), 12 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2023-02-16 04:03:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 445 transitions. [2023-02-16 04:03:33,249 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 445 transitions. Word has length 43 [2023-02-16 04:03:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:33,249 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 445 transitions. [2023-02-16 04:03:33,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2023-02-16 04:03:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 04:03:33,250 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:33,250 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] [2023-02-16 04:03:33,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 04:03:33,250 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:33,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1106350186, now seen corresponding path program 1 times [2023-02-16 04:03:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:33,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138789032] [2023-02-16 04:03:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,426 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:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:33,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138789032] [2023-02-16 04:03:33,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138789032] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:33,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:33,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077680723] [2023-02-16 04:03:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:33,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 04:03:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 04:03:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:33,429 INFO L87 Difference]: Start difference. First operand 324 states and 445 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:33,725 INFO L93 Difference]: Finished difference Result 411 states and 549 transitions. [2023-02-16 04:03:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:33,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-16 04:03:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:33,727 INFO L225 Difference]: With dead ends: 411 [2023-02-16 04:03:33,727 INFO L226 Difference]: Without dead ends: 410 [2023-02-16 04:03:33,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-16 04:03:33,728 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 268 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:33,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1196 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-02-16 04:03:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 322. [2023-02-16 04:03:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 276 states have (on average 1.4021739130434783) internal successors, (387), 286 states have internal predecessors, (387), 26 states have call successors, (26), 10 states have call predecessors, (26), 12 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2023-02-16 04:03:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 442 transitions. [2023-02-16 04:03:33,747 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 442 transitions. Word has length 44 [2023-02-16 04:03:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:33,748 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 442 transitions. [2023-02-16 04:03:33,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 442 transitions. [2023-02-16 04:03:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 04:03:33,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:33,749 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:33,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 04:03:33,749 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash -544833963, now seen corresponding path program 1 times [2023-02-16 04:03:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:33,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991698272] [2023-02-16 04:03:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-16 04:03:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,823 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:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:33,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991698272] [2023-02-16 04:03:33,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991698272] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:33,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439640764] [2023-02-16 04:03:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:33,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:33,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:33,825 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:33,827 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:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 04:03:33,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:33,890 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:33,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:33,950 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:33,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439640764] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:33,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:33,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-16 04:03:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472950507] [2023-02-16 04:03:33,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:33,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 04:03:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 04:03:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-16 04:03:33,953 INFO L87 Difference]: Start difference. First operand 322 states and 442 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-16 04:03:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:34,053 INFO L93 Difference]: Finished difference Result 529 states and 721 transitions. [2023-02-16 04:03:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2023-02-16 04:03:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:34,055 INFO L225 Difference]: With dead ends: 529 [2023-02-16 04:03:34,055 INFO L226 Difference]: Without dead ends: 452 [2023-02-16 04:03:34,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:34,056 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 217 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:34,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2063 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-02-16 04:03:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 352. [2023-02-16 04:03:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.3927392739273927) internal successors, (422), 311 states have internal predecessors, (422), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (30), 28 states have call predecessors, (30), 25 states have call successors, (30) [2023-02-16 04:03:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 481 transitions. [2023-02-16 04:03:34,075 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 481 transitions. Word has length 49 [2023-02-16 04:03:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:34,075 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 481 transitions. [2023-02-16 04:03:34,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-16 04:03:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 481 transitions. [2023-02-16 04:03:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 04:03:34,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:34,076 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:34,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:34,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:34,282 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -544832041, now seen corresponding path program 1 times [2023-02-16 04:03:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:34,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080363848] [2023-02-16 04:03:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-16 04:03:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,406 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:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:34,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080363848] [2023-02-16 04:03:34,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080363848] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:34,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176536645] [2023-02-16 04:03:34,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:34,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:34,408 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:34,409 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:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:34,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:34,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-16 04:03:34,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176536645] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:34,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:34,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 14 [2023-02-16 04:03:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042268203] [2023-02-16 04:03:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:34,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:34,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-16 04:03:34,553 INFO L87 Difference]: Start difference. First operand 352 states and 481 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:34,577 INFO L93 Difference]: Finished difference Result 494 states and 676 transitions. [2023-02-16 04:03:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2023-02-16 04:03:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:34,579 INFO L225 Difference]: With dead ends: 494 [2023-02-16 04:03:34,579 INFO L226 Difference]: Without dead ends: 334 [2023-02-16 04:03:34,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-16 04:03:34,580 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:34,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 223 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-02-16 04:03:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 327. [2023-02-16 04:03:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 284 states have (on average 1.397887323943662) internal successors, (397), 293 states have internal predecessors, (397), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (26), 24 states have call predecessors, (26), 23 states have call successors, (26) [2023-02-16 04:03:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 448 transitions. [2023-02-16 04:03:34,599 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 448 transitions. Word has length 49 [2023-02-16 04:03:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:34,599 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 448 transitions. [2023-02-16 04:03:34,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 448 transitions. [2023-02-16 04:03:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 04:03:34,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:34,601 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] [2023-02-16 04:03:34,609 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:34,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:34,806 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1096692583, now seen corresponding path program 1 times [2023-02-16 04:03:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:34,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337699173] [2023-02-16 04:03:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,031 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:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:35,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337699173] [2023-02-16 04:03:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337699173] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:35,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:35,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 04:03:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479330932] [2023-02-16 04:03:35,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:35,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 04:03:35,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:35,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 04:03:35,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:35,033 INFO L87 Difference]: Start difference. First operand 327 states and 448 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:35,425 INFO L93 Difference]: Finished difference Result 861 states and 1202 transitions. [2023-02-16 04:03:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 04:03:35,425 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-16 04:03:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:35,428 INFO L225 Difference]: With dead ends: 861 [2023-02-16 04:03:35,428 INFO L226 Difference]: Without dead ends: 859 [2023-02-16 04:03:35,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2023-02-16 04:03:35,429 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 275 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 3187 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:35,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 3187 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 04:03:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-02-16 04:03:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 440. [2023-02-16 04:03:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 386 states have (on average 1.4196891191709844) internal successors, (548), 396 states have internal predecessors, (548), 33 states have call successors, (33), 11 states have call predecessors, (33), 13 states have return successors, (36), 32 states have call predecessors, (36), 31 states have call successors, (36) [2023-02-16 04:03:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 617 transitions. [2023-02-16 04:03:35,476 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 617 transitions. Word has length 49 [2023-02-16 04:03:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:35,476 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 617 transitions. [2023-02-16 04:03:35,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 617 transitions. [2023-02-16 04:03:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 04:03:35,477 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:35,477 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] [2023-02-16 04:03:35,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-16 04:03:35,479 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1039434281, now seen corresponding path program 1 times [2023-02-16 04:03:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:35,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60530735] [2023-02-16 04:03:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:35,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60530735] [2023-02-16 04:03:35,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60530735] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:35,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050244090] [2023-02-16 04:03:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:35,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:35,655 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:35,657 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:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 04:03:35,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:35,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:36,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050244090] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:36,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:36,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2023-02-16 04:03:36,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358460052] [2023-02-16 04:03:36,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:36,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 04:03:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:36,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 04:03:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-02-16 04:03:36,286 INFO L87 Difference]: Start difference. First operand 440 states and 617 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 19 states have internal predecessors, (72), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:37,107 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2023-02-16 04:03:37,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 04:03:37,107 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 19 states have internal predecessors, (72), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 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:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:37,110 INFO L225 Difference]: With dead ends: 1167 [2023-02-16 04:03:37,110 INFO L226 Difference]: Without dead ends: 1036 [2023-02-16 04:03:37,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2023-02-16 04:03:37,112 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 452 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 3221 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:37,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 3221 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 04:03:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2023-02-16 04:03:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 616. [2023-02-16 04:03:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 545 states have (on average 1.4311926605504588) internal successors, (780), 556 states have internal predecessors, (780), 46 states have call successors, (46), 14 states have call predecessors, (46), 17 states have return successors, (52), 45 states have call predecessors, (52), 44 states have call successors, (52) [2023-02-16 04:03:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 878 transitions. [2023-02-16 04:03:37,145 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 878 transitions. Word has length 49 [2023-02-16 04:03:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:37,145 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 878 transitions. [2023-02-16 04:03:37,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 19 states have internal predecessors, (72), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 878 transitions. [2023-02-16 04:03:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 04:03:37,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:37,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:37,153 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:37,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:37,355 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash -758511423, now seen corresponding path program 1 times [2023-02-16 04:03:37,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:37,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642602702] [2023-02-16 04:03:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:37,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642602702] [2023-02-16 04:03:37,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642602702] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:37,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:37,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862877146] [2023-02-16 04:03:37,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:37,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:37,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:37,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:37,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:37,412 INFO L87 Difference]: Start difference. First operand 616 states and 878 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:37,458 INFO L93 Difference]: Finished difference Result 1018 states and 1445 transitions. [2023-02-16 04:03:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2023-02-16 04:03:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:37,461 INFO L225 Difference]: With dead ends: 1018 [2023-02-16 04:03:37,461 INFO L226 Difference]: Without dead ends: 648 [2023-02-16 04:03:37,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 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:37,462 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 328 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:37,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 328 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:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-02-16 04:03:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 632. [2023-02-16 04:03:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 561 states have (on average 1.4188948306595366) internal successors, (796), 572 states have internal predecessors, (796), 46 states have call successors, (46), 14 states have call predecessors, (46), 17 states have return successors, (52), 45 states have call predecessors, (52), 44 states have call successors, (52) [2023-02-16 04:03:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 894 transitions. [2023-02-16 04:03:37,501 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 894 transitions. Word has length 50 [2023-02-16 04:03:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:37,501 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 894 transitions. [2023-02-16 04:03:37,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 894 transitions. [2023-02-16 04:03:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 04:03:37,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:37,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:37,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-16 04:03:37,503 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 72724173, now seen corresponding path program 1 times [2023-02-16 04:03:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524968512] [2023-02-16 04:03:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 04:03:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:37,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:37,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524968512] [2023-02-16 04:03:37,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524968512] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:37,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731775046] [2023-02-16 04:03:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:37,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:37,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:37,618 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:37,620 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:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 04:03:37,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:03:37,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:03:37,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731775046] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:37,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:37,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-02-16 04:03:37,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928893972] [2023-02-16 04:03:37,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:37,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 04:03:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:37,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 04:03:37,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:37,799 INFO L87 Difference]: Start difference. First operand 632 states and 894 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-16 04:03:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:38,540 INFO L93 Difference]: Finished difference Result 1837 states and 2658 transitions. [2023-02-16 04:03:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-16 04:03:38,540 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-02-16 04:03:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:38,545 INFO L225 Difference]: With dead ends: 1837 [2023-02-16 04:03:38,545 INFO L226 Difference]: Without dead ends: 1609 [2023-02-16 04:03:38,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2023-02-16 04:03:38,547 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 654 mSDsluCounter, 3702 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:38,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 4043 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:03:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2023-02-16 04:03:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 631. [2023-02-16 04:03:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 560 states have (on average 1.4071428571428573) internal successors, (788), 571 states have internal predecessors, (788), 46 states have call successors, (46), 14 states have call predecessors, (46), 17 states have return successors, (52), 45 states have call predecessors, (52), 44 states have call successors, (52) [2023-02-16 04:03:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 886 transitions. [2023-02-16 04:03:38,586 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 886 transitions. Word has length 52 [2023-02-16 04:03:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:38,586 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 886 transitions. [2023-02-16 04:03:38,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-16 04:03:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 886 transitions. [2023-02-16 04:03:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 04:03:38,587 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:38,588 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:38,602 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:38,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-16 04:03:38,793 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2108410851, now seen corresponding path program 1 times [2023-02-16 04:03:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:38,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412522573] [2023-02-16 04:03:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:38,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 04:03:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:38,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412522573] [2023-02-16 04:03:38,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412522573] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:38,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:38,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565606853] [2023-02-16 04:03:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:38,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:38,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:38,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:38,899 INFO L87 Difference]: Start difference. First operand 631 states and 886 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:38,992 INFO L93 Difference]: Finished difference Result 818 states and 1136 transitions. [2023-02-16 04:03:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:38,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2023-02-16 04:03:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:38,995 INFO L225 Difference]: With dead ends: 818 [2023-02-16 04:03:38,995 INFO L226 Difference]: Without dead ends: 714 [2023-02-16 04:03:38,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:38,996 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 111 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:38,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1051 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2023-02-16 04:03:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 652. [2023-02-16 04:03:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 579 states have (on average 1.3972366148531952) internal successors, (809), 588 states have internal predecessors, (809), 48 states have call successors, (48), 16 states have call predecessors, (48), 17 states have return successors, (52), 47 states have call predecessors, (52), 44 states have call successors, (52) [2023-02-16 04:03:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 909 transitions. [2023-02-16 04:03:39,031 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 909 transitions. Word has length 52 [2023-02-16 04:03:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:39,031 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 909 transitions. [2023-02-16 04:03:39,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 909 transitions. [2023-02-16 04:03:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 04:03:39,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:39,032 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:39,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-16 04:03:39,032 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:39,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1769180702, now seen corresponding path program 1 times [2023-02-16 04:03:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:39,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383104527] [2023-02-16 04:03:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,216 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:39,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:39,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383104527] [2023-02-16 04:03:39,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383104527] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:39,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413702369] [2023-02-16 04:03:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:39,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:39,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:39,217 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:39,219 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:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 04:03:39,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:39,490 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:39,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:39,918 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:39,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413702369] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:39,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:39,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 27 [2023-02-16 04:03:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990006550] [2023-02-16 04:03:39,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:39,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 04:03:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:39,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 04:03:39,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2023-02-16 04:03:39,921 INFO L87 Difference]: Start difference. First operand 652 states and 909 transitions. Second operand has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:41,899 INFO L93 Difference]: Finished difference Result 1667 states and 2335 transitions. [2023-02-16 04:03:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-16 04:03:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2023-02-16 04:03:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:41,904 INFO L225 Difference]: With dead ends: 1667 [2023-02-16 04:03:41,904 INFO L226 Difference]: Without dead ends: 1484 [2023-02-16 04:03:41,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=2729, Unknown=0, NotChecked=0, Total=3080 [2023-02-16 04:03:41,906 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 730 mSDsluCounter, 7959 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 8416 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:41,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 8416 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-16 04:03:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2023-02-16 04:03:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 646. [2023-02-16 04:03:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 573 states have (on average 1.3909249563699826) internal successors, (797), 582 states have internal predecessors, (797), 48 states have call successors, (48), 16 states have call predecessors, (48), 17 states have return successors, (52), 47 states have call predecessors, (52), 44 states have call successors, (52) [2023-02-16 04:03:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 897 transitions. [2023-02-16 04:03:41,954 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 897 transitions. Word has length 51 [2023-02-16 04:03:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:41,954 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 897 transitions. [2023-02-16 04:03:41,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 897 transitions. [2023-02-16 04:03:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 04:03:41,955 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:41,955 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] [2023-02-16 04:03:41,975 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:42,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-16 04:03:42,160 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2002153869, now seen corresponding path program 1 times [2023-02-16 04:03:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069021342] [2023-02-16 04:03:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:03:42,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:03:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:03:42,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:03:42,205 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 04:03:42,207 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-16 04:03:42,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-16 04:03:42,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-16 04:03:42,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-16 04:03:42,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-16 04:03:42,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-16 04:03:42,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-16 04:03:42,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-16 04:03:42,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-16 04:03:42,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-16 04:03:42,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-16 04:03:42,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-16 04:03:42,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-16 04:03:42,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-16 04:03:42,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-16 04:03:42,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-16 04:03:42,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-16 04:03:42,213 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, 1] [2023-02-16 04:03:42,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:03:42,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:03:42 BoogieIcfgContainer [2023-02-16 04:03:42,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:03:42,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:03:42,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:03:42,260 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:03:42,260 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:27" (3/4) ... [2023-02-16 04:03:42,262 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 04:03:42,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:03:42,262 INFO L158 Benchmark]: Toolchain (without parser) took 15097.77ms. Allocated memory was 121.6MB in the beginning and 186.6MB in the end (delta: 65.0MB). Free memory was 73.2MB in the beginning and 106.7MB in the end (delta: -33.5MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2023-02-16 04:03:42,264 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 92.3MB. Free memory was 65.3MB in the beginning and 65.2MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:42,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.81ms. Allocated memory is still 121.6MB. Free memory was 73.2MB in the beginning and 92.3MB in the end (delta: -19.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 04:03:42,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.11ms. Allocated memory is still 121.6MB. Free memory was 92.3MB in the beginning and 90.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:03:42,264 INFO L158 Benchmark]: Boogie Preprocessor took 41.07ms. Allocated memory is still 121.6MB. Free memory was 90.9MB in the beginning and 89.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:42,264 INFO L158 Benchmark]: RCFGBuilder took 408.00ms. Allocated memory is still 121.6MB. Free memory was 88.9MB in the beginning and 68.7MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-16 04:03:42,266 INFO L158 Benchmark]: TraceAbstraction took 14353.84ms. Allocated memory was 121.6MB in the beginning and 186.6MB in the end (delta: 65.0MB). Free memory was 67.9MB in the beginning and 107.8MB in the end (delta: -39.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-02-16 04:03:42,266 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 186.6MB. Free memory was 107.8MB in the beginning and 106.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:42,273 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.13ms. Allocated memory is still 92.3MB. Free memory was 65.3MB in the beginning and 65.2MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.81ms. Allocated memory is still 121.6MB. Free memory was 73.2MB in the beginning and 92.3MB in the end (delta: -19.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.11ms. Allocated memory is still 121.6MB. Free memory was 92.3MB in the beginning and 90.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.07ms. Allocated memory is still 121.6MB. Free memory was 90.9MB in the beginning and 89.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 408.00ms. Allocated memory is still 121.6MB. Free memory was 88.9MB in the beginning and 68.7MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14353.84ms. Allocated memory was 121.6MB in the beginning and 186.6MB in the end (delta: 65.0MB). Free memory was 67.9MB in the beginning and 107.8MB in the end (delta: -39.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 186.6MB. Free memory was 107.8MB in the beginning and 106.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76, 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_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-127, eb=-128] [L241] 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] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L241] zero = base2flt(0, 0) [L242] 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] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=16777217] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L29] COND FALSE !(! m) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L57] COND TRUE 1 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] EXPR e + 128 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-128, \old(m)=16777217, __retres4=16777217, e=-128, m=16777217, res=16777217] [L80] return (__retres4); VAL [\old(e)=-128, \old(m)=16777217, \result=-36028797002186751, __retres4=16777217, e=-128, m=16777217, res=16777217] [L243] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=-36028797002186751, ea=-127, eb=-128, ma=16777216, mb=16777217, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=16777216, \old(b)=16777217] [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)=16777217, a=16777216, b=16777217] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L101] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] [L109] (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, 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 4 procedures, 106 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5352 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5247 mSDsluCounter, 37615 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33238 mSDsCounter, 636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6605 IncrementalHoareTripleChecker+Invalid, 7241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 636 mSolverCounterUnsat, 4377 mSDtfsCounter, 6605 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1147 GetRequests, 802 SyntacticMatches, 8 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=25, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 4083 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1571 ConstructedInterpolants, 0 QuantifiedInterpolants, 6150 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 43 InterpolantComputations, 19 PerfectInterpolantSequences, 520/644 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:42,293 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_4-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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:03:44,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:03:44,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:03:44,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:03:44,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:03:44,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:03:44,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:03:44,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:03:44,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:03:44,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:03:44,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:03:44,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:03:44,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:03:44,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:03:44,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:03:44,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:03:44,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:03:44,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:03:44,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:03:44,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:03:44,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:03:44,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:03:44,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:03:44,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:03:44,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:03:44,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:03:44,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:03:44,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:03:44,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:03:44,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:03:44,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:03:44,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:03:44,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:03:44,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:03:44,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:03:44,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:03:44,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:03:44,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:03:44,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:03:44,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:03:44,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:03:44,098 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:44,124 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:03:44,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:03:44,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:03:44,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:03:44,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:03:44,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:03:44,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:03:44,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:03:44,127 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:03:44,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:03:44,128 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:03:44,128 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:03:44,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:03:44,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:03:44,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:03:44,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:03:44,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:03:44,129 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 04:03:44,129 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 04:03:44,130 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:03:44,130 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 04:03:44,130 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:03:44,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:03:44,130 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:03:44,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:03:44,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:03:44,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:03:44,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:03:44,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:44,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:03:44,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:03:44,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:03:44,132 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 04:03:44,132 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:44,132 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:03:44,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:03:44,132 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:03:44,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:03:44,133 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 04:03:44,133 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:03:44,133 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2023-02-16 04:03:44,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:03:44,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:03:44,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:03:44,400 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:03:44,400 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:03:44,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2023-02-16 04:03:45,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:03:45,571 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:03:45,571 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2023-02-16 04:03:45,583 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebd14ff2/7406c136e1674f65bfda904233e58fd6/FLAGa626cb73a [2023-02-16 04:03:45,598 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebd14ff2/7406c136e1674f65bfda904233e58fd6 [2023-02-16 04:03:45,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:03:45,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:03:45,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:45,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:03:45,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:03:45,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:45" (1/1) ... [2023-02-16 04:03:45,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f6468f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:45, skipping insertion in model container [2023-02-16 04:03:45,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:45" (1/1) ... [2023-02-16 04:03:45,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:03:45,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:03:45,753 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_4-3a.c.cil.c[730,743] [2023-02-16 04:03:45,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:45,822 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:03:45,832 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_4-3a.c.cil.c[730,743] [2023-02-16 04:03:45,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:45,875 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:03:45,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:45 WrapperNode [2023-02-16 04:03:45,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:45,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:45,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:03:45,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:03:45,882 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:45" (1/1) ... [2023-02-16 04:03:45,895 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:45" (1/1) ... [2023-02-16 04:03:45,909 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2023-02-16 04:03:45,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:45,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:03:45,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:03:45,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:03:45,915 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:45" (1/1) ... [2023-02-16 04:03:45,916 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:45" (1/1) ... [2023-02-16 04:03:45,927 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:45" (1/1) ... [2023-02-16 04:03:45,928 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:45" (1/1) ... [2023-02-16 04:03:45,933 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:45" (1/1) ... [2023-02-16 04:03:45,935 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:45" (1/1) ... [2023-02-16 04:03:45,936 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:45" (1/1) ... [2023-02-16 04:03:45,949 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:45" (1/1) ... [2023-02-16 04:03:45,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:03:45,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:03:45,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:03:45,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:03:45,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:45" (1/1) ... [2023-02-16 04:03:45,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:45,976 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:45,982 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:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:03:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 04:03:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-16 04:03:46,002 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-16 04:03:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:03:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:03:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-02-16 04:03:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-02-16 04:03:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 04:03:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 04:03:46,067 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:03:46,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:03:46,282 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:03:46,286 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:03:46,287 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:03:46,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:46 BoogieIcfgContainer [2023-02-16 04:03:46,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:03:46,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:03:46,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:03:46,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:03:46,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:03:45" (1/3) ... [2023-02-16 04:03:46,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113d16e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:46, skipping insertion in model container [2023-02-16 04:03:46,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:45" (2/3) ... [2023-02-16 04:03:46,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113d16e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:46, skipping insertion in model container [2023-02-16 04:03:46,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:46" (3/3) ... [2023-02-16 04:03:46,294 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2023-02-16 04:03:46,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:03:46,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-16 04:03:46,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:03:46,358 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;@4c6ac52b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:03:46,359 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-16 04:03:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 71 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-16 04:03:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:46,367 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:46,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:46,369 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:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash 773389610, now seen corresponding path program 1 times [2023-02-16 04:03:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:46,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132665646] [2023-02-16 04:03:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:46,386 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:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:46,389 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:46,390 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:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:46,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 04:03:46,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:46,476 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:46,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:46,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:46,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132665646] [2023-02-16 04:03:46,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132665646] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:46,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:46,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-16 04:03:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404047630] [2023-02-16 04:03:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:46,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 04:03:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:46,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 04:03:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 04:03:46,510 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 71 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 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:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:46,544 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2023-02-16 04:03:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 04:03:46,546 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:46,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:46,553 INFO L225 Difference]: With dead ends: 156 [2023-02-16 04:03:46,553 INFO L226 Difference]: Without dead ends: 65 [2023-02-16 04:03:46,555 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:46,559 INFO L413 NwaCegarLoop]: 93 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, 93 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:46,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 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:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-16 04:03:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-16 04:03:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 54 states have internal predecessors, (65), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2023-02-16 04:03:46,599 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 9 [2023-02-16 04:03:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:46,600 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2023-02-16 04:03:46,600 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:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2023-02-16 04:03:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:46,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:46,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:46,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:46,813 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:46,813 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:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:46,814 INFO L85 PathProgramCache]: Analyzing trace with hash 772448344, now seen corresponding path program 1 times [2023-02-16 04:03:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:46,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401453350] [2023-02-16 04:03:46,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:46,814 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:46,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:46,816 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:46,818 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:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:46,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:46,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:46,907 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:46,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:46,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:46,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401453350] [2023-02-16 04:03:46,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401453350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:46,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:46,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102441023] [2023-02-16 04:03:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:46,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:46,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:46,916 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:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:46,972 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2023-02-16 04:03:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:03:46,972 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:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:46,974 INFO L225 Difference]: With dead ends: 135 [2023-02-16 04:03:46,975 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 04:03:46,975 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:46,990 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:46,990 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:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 04:03:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-16 04:03:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 58 states have internal predecessors, (69), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2023-02-16 04:03:47,000 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 9 [2023-02-16 04:03:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:47,001 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2023-02-16 04:03:47,003 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:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2023-02-16 04:03:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 04:03:47,004 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:47,004 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:47,011 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:47,210 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:47,210 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:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1921948498, now seen corresponding path program 1 times [2023-02-16 04:03:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:47,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671137574] [2023-02-16 04:03:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:47,212 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:47,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:47,213 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:47,215 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:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:47,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:47,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:47,271 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:47,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:47,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:47,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671137574] [2023-02-16 04:03:47,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671137574] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:47,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:47,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502172568] [2023-02-16 04:03:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:47,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:47,277 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:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:47,302 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2023-02-16 04:03:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:47,303 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:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:47,304 INFO L225 Difference]: With dead ends: 73 [2023-02-16 04:03:47,304 INFO L226 Difference]: Without dead ends: 72 [2023-02-16 04:03:47,305 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:47,305 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:47,306 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:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-16 04:03:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-02-16 04:03:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 57 states have internal predecessors, (68), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2023-02-16 04:03:47,311 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 16 [2023-02-16 04:03:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:47,311 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2023-02-16 04:03:47,311 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:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2023-02-16 04:03:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 04:03:47,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:47,312 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:47,321 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:47,518 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:47,518 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:47,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash 730880598, now seen corresponding path program 1 times [2023-02-16 04:03:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:47,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073150087] [2023-02-16 04:03:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:47,524 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:47,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:47,525 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:47,527 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:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:47,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:47,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:47,574 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:47,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:47,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:47,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073150087] [2023-02-16 04:03:47,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073150087] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:47,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:47,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204484396] [2023-02-16 04:03:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:47,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:47,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:47,580 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:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:47,607 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2023-02-16 04:03:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:47,607 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:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:47,608 INFO L225 Difference]: With dead ends: 72 [2023-02-16 04:03:47,608 INFO L226 Difference]: Without dead ends: 71 [2023-02-16 04:03:47,608 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:47,609 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:47,609 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:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-16 04:03:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-02-16 04:03:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2023-02-16 04:03:47,615 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2023-02-16 04:03:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:47,615 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2023-02-16 04:03:47,615 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:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2023-02-16 04:03:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 04:03:47,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:47,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:47,634 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:47,832 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:47,833 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:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 730948124, now seen corresponding path program 1 times [2023-02-16 04:03:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:47,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242087091] [2023-02-16 04:03:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:47,835 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:47,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:47,840 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:47,842 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:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:47,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:47,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:47,914 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:47,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:47,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:47,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242087091] [2023-02-16 04:03:47,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242087091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:47,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:47,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533472847] [2023-02-16 04:03:47,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:47,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:47,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:47,916 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:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:47,997 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2023-02-16 04:03:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:47,998 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:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:47,998 INFO L225 Difference]: With dead ends: 84 [2023-02-16 04:03:47,998 INFO L226 Difference]: Without dead ends: 83 [2023-02-16 04:03:47,999 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:47,999 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:47,999 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:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-16 04:03:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2023-02-16 04:03:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 61 states have internal predecessors, (73), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2023-02-16 04:03:48,006 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 18 [2023-02-16 04:03:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:48,007 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2023-02-16 04:03:48,007 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:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2023-02-16 04:03:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 04:03:48,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:48,008 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:48,014 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:48,214 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:48,214 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:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 33110864, now seen corresponding path program 1 times [2023-02-16 04:03:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:48,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103815679] [2023-02-16 04:03:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:48,215 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:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:48,216 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:48,218 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:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:48,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:48,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:48,769 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:48,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:48,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:48,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103815679] [2023-02-16 04:03:48,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103815679] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:48,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:48,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 04:03:48,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333971511] [2023-02-16 04:03:48,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:48,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:48,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:48,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:48,771 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:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:50,801 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2023-02-16 04:03:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 04:03:50,801 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:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:50,802 INFO L225 Difference]: With dead ends: 89 [2023-02-16 04:03:50,802 INFO L226 Difference]: Without dead ends: 88 [2023-02-16 04:03:50,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:50,803 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:50,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 304 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-16 04:03:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-16 04:03:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2023-02-16 04:03:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 55 states have internal predecessors, (66), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 04:03:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-02-16 04:03:50,810 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 21 [2023-02-16 04:03:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:50,810 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-02-16 04:03:50,810 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:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2023-02-16 04:03:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 04:03:50,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:50,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] [2023-02-16 04:03:50,825 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:51,018 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:51,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:51,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1763431449, now seen corresponding path program 1 times [2023-02-16 04:03:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:51,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682425255] [2023-02-16 04:03:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:51,019 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:51,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:51,020 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:51,022 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:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:51,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 04:03:51,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:51,099 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:51,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:51,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682425255] [2023-02-16 04:03:51,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682425255] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:51,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:51,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393617339] [2023-02-16 04:03:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:51,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:51,102 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:51,177 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2023-02-16 04:03:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-02-16 04:03:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:51,178 INFO L225 Difference]: With dead ends: 117 [2023-02-16 04:03:51,178 INFO L226 Difference]: Without dead ends: 83 [2023-02-16 04:03:51,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:51,179 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:51,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 479 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-16 04:03:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2023-02-16 04:03:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 64 states have internal predecessors, (74), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-16 04:03:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2023-02-16 04:03:51,188 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 37 [2023-02-16 04:03:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:51,188 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2023-02-16 04:03:51,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2023-02-16 04:03:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 04:03:51,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:51,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:51,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:51,396 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:51,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:51,397 INFO L85 PathProgramCache]: Analyzing trace with hash -184106620, now seen corresponding path program 1 times [2023-02-16 04:03:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:51,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488997295] [2023-02-16 04:03:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:51,398 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:51,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:51,399 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:51,399 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:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:51,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 04:03:51,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:51,485 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:51,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:51,540 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:51,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488997295] [2023-02-16 04:03:51,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488997295] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:51,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:51,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-16 04:03:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217867090] [2023-02-16 04:03:51,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:51,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:51,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:51,542 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:51,603 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2023-02-16 04:03:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2023-02-16 04:03:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:51,605 INFO L225 Difference]: With dead ends: 125 [2023-02-16 04:03:51,605 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 04:03:51,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:51,606 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 10 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:51,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 526 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 04:03:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-02-16 04:03:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 66 states have internal predecessors, (76), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-16 04:03:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2023-02-16 04:03:51,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 45 [2023-02-16 04:03:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:51,614 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2023-02-16 04:03:51,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2023-02-16 04:03:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 04:03:51,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:51,615 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] [2023-02-16 04:03:51,628 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:51,822 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:51,822 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:51,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1036359320, now seen corresponding path program 1 times [2023-02-16 04:03:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:51,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165235009] [2023-02-16 04:03:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:51,823 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:51,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:51,824 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:51,825 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:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:51,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:51,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:51,912 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:51,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:51,954 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:51,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:51,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165235009] [2023-02-16 04:03:51,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165235009] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:51,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:51,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-02-16 04:03:51,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911854358] [2023-02-16 04:03:51,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:51,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:51,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:51,956 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:52,047 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2023-02-16 04:03:52,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:52,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2023-02-16 04:03:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:52,049 INFO L225 Difference]: With dead ends: 124 [2023-02-16 04:03:52,049 INFO L226 Difference]: Without dead ends: 81 [2023-02-16 04:03:52,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:52,050 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:52,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 606 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-16 04:03:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-02-16 04:03:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 64 states have internal predecessors, (74), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-16 04:03:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2023-02-16 04:03:52,056 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 41 [2023-02-16 04:03:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:52,056 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2023-02-16 04:03:52,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2023-02-16 04:03:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 04:03:52,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:52,057 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] [2023-02-16 04:03:52,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:52,264 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:52,264 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1099402567, now seen corresponding path program 2 times [2023-02-16 04:03:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:52,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71736584] [2023-02-16 04:03:52,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:03:52,265 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:52,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:52,266 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:52,268 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:52,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 04:03:52,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:03:52,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:52,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:52,367 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:52,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:52,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:52,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71736584] [2023-02-16 04:03:52,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71736584] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:52,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:52,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794150350] [2023-02-16 04:03:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:52,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 04:03:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 04:03:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:52,370 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:52,591 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2023-02-16 04:03:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 04:03:52,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2023-02-16 04:03:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:52,593 INFO L225 Difference]: With dead ends: 169 [2023-02-16 04:03:52,593 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 04:03:52,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:52,594 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 77 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:52,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 866 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 04:03:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2023-02-16 04:03:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 87 states have internal predecessors, (101), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-02-16 04:03:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2023-02-16 04:03:52,606 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 45 [2023-02-16 04:03:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:52,606 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2023-02-16 04:03:52,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2023-02-16 04:03:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 04:03:52,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:52,607 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] [2023-02-16 04:03:52,621 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:52,813 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:52,814 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -278258631, now seen corresponding path program 1 times [2023-02-16 04:03:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:52,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423666204] [2023-02-16 04:03:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:52,814 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:52,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:52,815 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:52,816 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:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:52,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 04:03:52,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:52,927 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:52,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:52,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:52,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423666204] [2023-02-16 04:03:52,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423666204] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:52,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:52,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 04:03:52,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527862974] [2023-02-16 04:03:52,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:52,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 04:03:52,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:52,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 04:03:52,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:52,930 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:53,060 INFO L93 Difference]: Finished difference Result 222 states and 277 transitions. [2023-02-16 04:03:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:53,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2023-02-16 04:03:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:53,061 INFO L225 Difference]: With dead ends: 222 [2023-02-16 04:03:53,062 INFO L226 Difference]: Without dead ends: 165 [2023-02-16 04:03:53,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:53,062 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:53,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 864 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-16 04:03:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2023-02-16 04:03:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.225) internal successors, (147), 125 states have internal predecessors, (147), 22 states have call successors, (22), 8 states have call predecessors, (22), 9 states have return successors, (25), 21 states have call predecessors, (25), 20 states have call successors, (25) [2023-02-16 04:03:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 194 transitions. [2023-02-16 04:03:53,074 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 194 transitions. Word has length 46 [2023-02-16 04:03:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:53,074 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 194 transitions. [2023-02-16 04:03:53,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 194 transitions. [2023-02-16 04:03:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 04:03:53,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:53,075 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] [2023-02-16 04:03:53,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:53,281 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:53,282 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:53,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -865064645, now seen corresponding path program 1 times [2023-02-16 04:03:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:53,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568259067] [2023-02-16 04:03:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:53,283 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:53,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:53,283 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:53,284 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:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:53,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 04:03:53,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:53,443 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:53,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:53,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:53,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568259067] [2023-02-16 04:03:53,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568259067] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:53,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:53,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 04:03:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945708609] [2023-02-16 04:03:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:53,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 04:03:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:53,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 04:03:53,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:53,446 INFO L87 Difference]: Start difference. First operand 155 states and 194 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:53,627 INFO L93 Difference]: Finished difference Result 173 states and 210 transitions. [2023-02-16 04:03:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 04:03:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2023-02-16 04:03:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:53,629 INFO L225 Difference]: With dead ends: 173 [2023-02-16 04:03:53,629 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 04:03:53,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:53,630 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 67 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:53,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 730 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 04:03:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-02-16 04:03:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 88 states have internal predecessors, (102), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-16 04:03:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2023-02-16 04:03:53,636 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 46 [2023-02-16 04:03:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:53,636 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2023-02-16 04:03:53,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2023-02-16 04:03:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 04:03:53,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:53,638 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:53,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:53,844 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:53,844 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1835217457, now seen corresponding path program 1 times [2023-02-16 04:03:53,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:53,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802917025] [2023-02-16 04:03:53,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:53,845 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:53,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:53,846 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:53,846 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:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:53,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 04:03:53,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:53,940 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:53,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:54,055 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:54,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802917025] [2023-02-16 04:03:54,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802917025] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:54,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:54,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-02-16 04:03:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062732890] [2023-02-16 04:03:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:54,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:54,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:54,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:54,056 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:54,130 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2023-02-16 04:03:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:03:54,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2023-02-16 04:03:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:54,132 INFO L225 Difference]: With dead ends: 114 [2023-02-16 04:03:54,132 INFO L226 Difference]: Without dead ends: 113 [2023-02-16 04:03:54,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:54,133 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:54,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 234 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-16 04:03:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-02-16 04:03:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 87 states have internal predecessors, (101), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-16 04:03:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2023-02-16 04:03:54,142 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 47 [2023-02-16 04:03:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:54,142 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2023-02-16 04:03:54,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2023-02-16 04:03:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 04:03:54,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:54,143 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] [2023-02-16 04:03:54,165 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 (14)] Ended with exit code 0 [2023-02-16 04:03:54,349 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:54,350 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1057166479, now seen corresponding path program 1 times [2023-02-16 04:03:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:54,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568824325] [2023-02-16 04:03:54,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:54,350 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:54,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:54,351 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:54,352 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:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:54,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 04:03:54,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:54,454 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:54,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:54,557 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:54,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:54,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568824325] [2023-02-16 04:03:54,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568824325] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:54,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:54,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2023-02-16 04:03:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397151816] [2023-02-16 04:03:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:54,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:54,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:54,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:54,558 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:54,649 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2023-02-16 04:03:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:54,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2023-02-16 04:03:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:54,651 INFO L225 Difference]: With dead ends: 121 [2023-02-16 04:03:54,651 INFO L226 Difference]: Without dead ends: 120 [2023-02-16 04:03:54,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:54,651 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:54,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 177 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-16 04:03:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2023-02-16 04:03:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 86 states have internal predecessors, (99), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-16 04:03:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2023-02-16 04:03:54,660 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 48 [2023-02-16 04:03:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:54,661 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2023-02-16 04:03:54,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2023-02-16 04:03:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 04:03:54,662 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:54,662 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] [2023-02-16 04:03:54,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:54,868 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:54,868 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:54,869 INFO L85 PathProgramCache]: Analyzing trace with hash 476613900, now seen corresponding path program 1 times [2023-02-16 04:03:54,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:54,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239315850] [2023-02-16 04:03:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:54,869 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:54,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:54,870 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:54,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-16 04:03:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:54,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 04:03:54,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:55,026 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:55,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:55,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239315850] [2023-02-16 04:03:55,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239315850] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773026744] [2023-02-16 04:03:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:55,212 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:55,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 04:03:55,214 INFO L229 MonitoredProcess]: Starting monitored process 17 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:55,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-02-16 04:03:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:55,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 04:03:55,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:55,285 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:55,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:55,318 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:55,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773026744] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:55,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:55,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 14 [2023-02-16 04:03:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777776574] [2023-02-16 04:03:55,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:55,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 04:03:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:55,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 04:03:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-02-16 04:03:55,320 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 04:03:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:55,584 INFO L93 Difference]: Finished difference Result 188 states and 230 transitions. [2023-02-16 04:03:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 04:03:55,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 59 [2023-02-16 04:03:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:55,585 INFO L225 Difference]: With dead ends: 188 [2023-02-16 04:03:55,585 INFO L226 Difference]: Without dead ends: 156 [2023-02-16 04:03:55,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2023-02-16 04:03:55,586 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 65 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:55,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1007 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-16 04:03:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2023-02-16 04:03:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 110 states have internal predecessors, (128), 19 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (22), 18 states have call predecessors, (22), 18 states have call successors, (22) [2023-02-16 04:03:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2023-02-16 04:03:55,598 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 59 [2023-02-16 04:03:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:55,598 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2023-02-16 04:03:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 04:03:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2023-02-16 04:03:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-16 04:03:55,599 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:55,600 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:55,608 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:55,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-02-16 04:03:56,006 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:56,007 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1914867570, now seen corresponding path program 1 times [2023-02-16 04:03:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:56,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326966381] [2023-02-16 04:03:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:56,007 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:56,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:56,009 INFO L229 MonitoredProcess]: Starting monitored process 18 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:56,010 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 (18)] Waiting until timeout for monitored process [2023-02-16 04:03:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:56,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:56,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:56,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:56,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:56,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326966381] [2023-02-16 04:03:56,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326966381] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:56,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:56,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383756] [2023-02-16 04:03:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:56,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:56,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:56,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:56,106 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:56,182 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2023-02-16 04:03:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:56,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2023-02-16 04:03:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:56,184 INFO L225 Difference]: With dead ends: 184 [2023-02-16 04:03:56,184 INFO L226 Difference]: Without dead ends: 134 [2023-02-16 04:03:56,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:56,184 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:56,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 568 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-16 04:03:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2023-02-16 04:03:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 101 states have internal predecessors, (118), 18 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-02-16 04:03:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2023-02-16 04:03:56,196 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 61 [2023-02-16 04:03:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:56,196 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2023-02-16 04:03:56,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2023-02-16 04:03:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-16 04:03:56,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:56,198 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-02-16 04:03:56,206 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 (18)] Ended with exit code 0 [2023-02-16 04:03:56,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:56,405 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1482705623, now seen corresponding path program 1 times [2023-02-16 04:03:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:56,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893536360] [2023-02-16 04:03:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:56,406 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:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:56,407 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:56,407 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:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:56,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 04:03:56,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 04:03:56,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 04:03:56,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:56,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893536360] [2023-02-16 04:03:56,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893536360] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:56,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:56,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-16 04:03:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965458879] [2023-02-16 04:03:56,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:56,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:56,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:56,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:56,545 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-16 04:03:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:56,674 INFO L93 Difference]: Finished difference Result 219 states and 266 transitions. [2023-02-16 04:03:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2023-02-16 04:03:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:56,677 INFO L225 Difference]: With dead ends: 219 [2023-02-16 04:03:56,677 INFO L226 Difference]: Without dead ends: 174 [2023-02-16 04:03:56,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:56,677 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 60 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:56,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 623 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-16 04:03:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2023-02-16 04:03:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 102 states have internal predecessors, (118), 18 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-02-16 04:03:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2023-02-16 04:03:56,686 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 67 [2023-02-16 04:03:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:56,686 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2023-02-16 04:03:56,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-16 04:03:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2023-02-16 04:03:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-16 04:03:56,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:56,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:56,697 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:56,894 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:56,895 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:56,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1594801001, now seen corresponding path program 1 times [2023-02-16 04:03:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:56,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887376700] [2023-02-16 04:03:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:56,896 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:56,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:56,897 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:56,901 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:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:56,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 04:03:56,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 04:03:57,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 04:03:57,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:57,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887376700] [2023-02-16 04:03:57,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887376700] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:57,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:57,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-16 04:03:57,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83079740] [2023-02-16 04:03:57,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:57,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 04:03:57,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:57,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 04:03:57,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-02-16 04:03:57,155 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-02-16 04:03:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:57,529 INFO L93 Difference]: Finished difference Result 237 states and 289 transitions. [2023-02-16 04:03:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 04:03:57,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 67 [2023-02-16 04:03:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:57,530 INFO L225 Difference]: With dead ends: 237 [2023-02-16 04:03:57,530 INFO L226 Difference]: Without dead ends: 198 [2023-02-16 04:03:57,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2023-02-16 04:03:57,531 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 201 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:57,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1123 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-16 04:03:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2023-02-16 04:03:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 122 states have internal predecessors, (139), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2023-02-16 04:03:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 184 transitions. [2023-02-16 04:03:57,540 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 184 transitions. Word has length 67 [2023-02-16 04:03:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:57,541 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 184 transitions. [2023-02-16 04:03:57,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-02-16 04:03:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 184 transitions. [2023-02-16 04:03:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-16 04:03:57,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:57,542 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] [2023-02-16 04:03:57,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:57,749 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:57,749 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 522989730, now seen corresponding path program 1 times [2023-02-16 04:03:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:57,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826667429] [2023-02-16 04:03:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:57,750 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:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:57,751 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:57,754 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:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:57,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:57,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:57,814 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:57,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:57,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:57,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826667429] [2023-02-16 04:03:57,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826667429] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:57,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:57,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075102671] [2023-02-16 04:03:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:57,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:57,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:57,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:57,817 INFO L87 Difference]: Start difference. First operand 151 states and 184 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 04:03:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:57,848 INFO L93 Difference]: Finished difference Result 166 states and 201 transitions. [2023-02-16 04:03:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:57,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-02-16 04:03:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:57,850 INFO L225 Difference]: With dead ends: 166 [2023-02-16 04:03:57,850 INFO L226 Difference]: Without dead ends: 160 [2023-02-16 04:03:57,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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:57,850 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:57,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-16 04:03:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2023-02-16 04:03:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.139344262295082) internal successors, (139), 124 states have internal predecessors, (139), 23 states have call successors, (23), 7 states have call predecessors, (23), 8 states have return successors, (24), 22 states have call predecessors, (24), 21 states have call successors, (24) [2023-02-16 04:03:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 186 transitions. [2023-02-16 04:03:57,864 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 186 transitions. Word has length 61 [2023-02-16 04:03:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:57,865 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 186 transitions. [2023-02-16 04:03:57,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 04:03:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 186 transitions. [2023-02-16 04:03:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-16 04:03:57,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:57,866 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] [2023-02-16 04:03:57,873 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:58,072 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:58,073 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1788417681, now seen corresponding path program 1 times [2023-02-16 04:03:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:58,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101802700] [2023-02-16 04:03:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:58,074 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:58,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:58,075 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:58,077 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:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:58,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 04:03:58,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:58,173 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:58,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:58,278 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:58,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:58,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101802700] [2023-02-16 04:03:58,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101802700] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:58,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:58,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-16 04:03:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601488168] [2023-02-16 04:03:58,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:58,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 04:03:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 04:03:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-02-16 04:03:58,280 INFO L87 Difference]: Start difference. First operand 154 states and 186 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 04:03:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:58,416 INFO L93 Difference]: Finished difference Result 204 states and 242 transitions. [2023-02-16 04:03:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 67 [2023-02-16 04:03:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:58,418 INFO L225 Difference]: With dead ends: 204 [2023-02-16 04:03:58,418 INFO L226 Difference]: Without dead ends: 156 [2023-02-16 04:03:58,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-16 04:03:58,418 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:58,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 921 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-16 04:03:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2023-02-16 04:03:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 117 states have (on average 1.1282051282051282) internal successors, (132), 119 states have internal predecessors, (132), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2023-02-16 04:03:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2023-02-16 04:03:58,430 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 67 [2023-02-16 04:03:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:58,430 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2023-02-16 04:03:58,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-16 04:03:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2023-02-16 04:03:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-16 04:03:58,431 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:58,431 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] [2023-02-16 04:03:58,438 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:58,638 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:58,638 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:58,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1556235369, now seen corresponding path program 1 times [2023-02-16 04:03:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:58,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645359929] [2023-02-16 04:03:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:58,639 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:58,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:58,640 INFO L229 MonitoredProcess]: Starting monitored process 23 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:58,641 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 (23)] Waiting until timeout for monitored process [2023-02-16 04:03:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:58,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:03:58,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:58,728 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:58,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:58,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:58,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645359929] [2023-02-16 04:03:58,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645359929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:58,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:58,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981027484] [2023-02-16 04:03:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:58,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:58,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:58,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:58,730 INFO L87 Difference]: Start difference. First operand 148 states and 177 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:59,141 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2023-02-16 04:03:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:03:59,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2023-02-16 04:03:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:59,142 INFO L225 Difference]: With dead ends: 160 [2023-02-16 04:03:59,142 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 04:03:59,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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:59,143 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:59,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 192 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:03:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 04:03:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 04:03:59,144 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:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 04:03:59,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2023-02-16 04:03:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:59,144 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 04:03:59,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 04:03:59,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 04:03:59,146 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-16 04:03:59,146 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-16 04:03:59,146 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-16 04:03:59,146 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-16 04:03:59,146 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-16 04:03:59,146 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-16 04:03:59,146 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-16 04:03:59,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-16 04:03:59,154 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 (23)] Ended with exit code 0 [2023-02-16 04:03:59,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:59,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 04:04:06,663 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-16 04:04:06,664 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-16 04:04:06,664 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-16 04:04:06,664 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-02-16 04:04:06,664 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:04:06,664 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:04:06,664 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-16 04:04:06,664 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-16 04:04:06,664 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-02-16 04:04:06,664 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-16 04:04:06,665 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-02-16 04:04:06,665 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-16 04:04:06,665 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-16 04:04:06,665 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-16 04:04:06,665 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:04:06,665 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-16 04:04:06,665 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-16 04:04:06,665 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-16 04:04:06,665 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-16 04:04:06,665 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-16 04:04:06,665 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-16 04:04:06,666 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-16 04:04:06,666 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-16 04:04:06,666 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:04:06,666 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-16 04:04:06,666 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 04:04:06,666 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 254) no Hoare annotation was computed. [2023-02-16 04:04:06,666 INFO L899 garLoopResultBuilder]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2023-02-16 04:04:06,666 INFO L902 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: true [2023-02-16 04:04:06,666 INFO L899 garLoopResultBuilder]: For program point L244-1(line 244) no Hoare annotation was computed. [2023-02-16 04:04:06,667 INFO L902 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: true [2023-02-16 04:04:06,667 INFO L899 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2023-02-16 04:04:06,667 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 04:04:06,667 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 225 263) the Hoare annotation is: true [2023-02-16 04:04:06,667 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 04:04:06,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 04:04:06,667 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 256) no Hoare annotation was computed. [2023-02-16 04:04:06,667 INFO L902 garLoopResultBuilder]: At program point L245(line 245) the Hoare annotation is: true [2023-02-16 04:04:06,667 INFO L902 garLoopResultBuilder]: At program point L247-2(lines 247 256) the Hoare annotation is: true [2023-02-16 04:04:06,668 INFO L899 garLoopResultBuilder]: For program point L245-1(line 245) no Hoare annotation was computed. [2023-02-16 04:04:06,668 INFO L902 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: true [2023-02-16 04:04:06,668 INFO L899 garLoopResultBuilder]: For program point L243-1(line 243) no Hoare annotation was computed. [2023-02-16 04:04:06,668 INFO L902 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: true [2023-02-16 04:04:06,668 INFO L899 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2023-02-16 04:04:06,668 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-02-16 04:04:06,668 INFO L899 garLoopResultBuilder]: For program point addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 112) no Hoare annotation was computed. [2023-02-16 04:04:06,668 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 137) no Hoare annotation was computed. [2023-02-16 04:04:06,671 INFO L895 garLoopResultBuilder]: At program point L126-2(lines 126 137) the Hoare annotation is: (let ((.cse0 (= addflt_~a |addflt_#in~a|)) (.cse6 (bvadd ((_ sign_extend 1) addflt_~ea~0) (bvneg ((_ sign_extend 1) addflt_~eb~0)))) (.cse8 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32)))) (.cse2 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32))))) (.cse7 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32))))) (and (or .cse0 (bvult |addflt_#in~a| |addflt_#in~b|)) (let ((.cse1 (let ((.cse3 (bvsle (_ bv6442450944 33) .cse6)) (.cse4 (not (bvult addflt_~a addflt_~b))) (.cse5 (or (= (_ bv0 32) |addflt_#in~b|) (not (= (_ bv0 32) addflt_~b))))) (or (and .cse3 .cse4 .cse0 .cse5) (and .cse3 .cse4 (= addflt_~b |addflt_#in~a|) .cse5))))) (or (and .cse1 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv127 32)) (bvlshr addflt_~a (_ bv24 32))))) (and .cse1 .cse2))) (or .cse7 .cse8 (= addflt_~eb~0 (_ bv127 32))) (or (and (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32)) (= addflt_~ea~0 (_ bv127 32)) (bvsle .cse6 (_ bv2147483647 33))) .cse8) (not (= |addflt_#in~b| (_ bv0 32))) (or (and (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) .cse2 (= addflt_~b |addflt_#in~b|)) .cse7))) [2023-02-16 04:04:06,671 INFO L899 garLoopResultBuilder]: For program point addfltFINAL(lines 83 147) no Hoare annotation was computed. [2023-02-16 04:04:06,671 INFO L899 garLoopResultBuilder]: For program point addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2023-02-16 04:04:06,671 INFO L895 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (let ((.cse0 (= addflt_~a |addflt_#in~a|)) (.cse6 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (.cse7 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (or .cse0 (bvult |addflt_#in~a| |addflt_#in~b|)) (let ((.cse5 ((_ sign_extend 1) addflt_~ea~0))) (let ((.cse1 (not (bvult addflt_~a addflt_~b))) (.cse2 (bvsle (bvadd .cse5 (bvneg ((_ sign_extend 1) (bvadd (bvlshr addflt_~b (_ bv24 32)) (_ bv4294967168 32))))) (_ bv2147483647 33))) (.cse3 (bvsle (bvadd .cse5 (bvneg ((_ sign_extend 1) addflt_~eb~0))) (_ bv2147483647 33))) (.cse4 (or (= (_ bv0 32) |addflt_#in~b|) (not (= (_ bv0 32) addflt_~b))))) (or (and .cse1 .cse2 .cse0 .cse3 .cse4) (and .cse1 .cse2 (= addflt_~b |addflt_#in~a|) .cse3 .cse4)))) (or .cse6 .cse7 (= addflt_~eb~0 (_ bv127 32))) (or .cse6 (and (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) (= addflt_~b |addflt_#in~b|))) (not (= |addflt_#in~b| (_ bv0 32))) (or (and (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32)) (= addflt_~ea~0 (_ bv127 32))) .cse7) (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32)))))) [2023-02-16 04:04:06,671 INFO L899 garLoopResultBuilder]: For program point L114-1(line 114) no Hoare annotation was computed. [2023-02-16 04:04:06,671 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2023-02-16 04:04:06,671 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 132) no Hoare annotation was computed. [2023-02-16 04:04:06,672 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 100) no Hoare annotation was computed. [2023-02-16 04:04:06,672 INFO L899 garLoopResultBuilder]: For program point addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 112) no Hoare annotation was computed. [2023-02-16 04:04:06,672 INFO L899 garLoopResultBuilder]: For program point L94-2(lines 93 146) no Hoare annotation was computed. [2023-02-16 04:04:06,672 INFO L899 garLoopResultBuilder]: For program point addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2023-02-16 04:04:06,672 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-02-16 04:04:06,672 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-02-16 04:04:06,672 INFO L895 garLoopResultBuilder]: At program point L144(lines 93 146) the Hoare annotation is: (let ((.cse8 (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))) (.cse11 (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (let ((.cse5 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32))))) (.cse1 (= (_ bv0 32) |addflt_#in~a|)) (.cse7 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) (.cse4 (= addflt_~b |addflt_#in~b|)) (.cse10 (not .cse11)) (.cse9 (not .cse8)) (.cse3 (= addflt_~b (_ bv0 32)))) (and (let ((.cse2 (= addflt_~b |addflt_#in~a|))) (let ((.cse0 (let ((.cse6 (not (bvult addflt_~a addflt_~b)))) (or (and .cse6 (= addflt_~a |addflt_#in~a|) (not (= (_ bv0 32) addflt_~b))) (and .cse6 .cse2))))) (or (and .cse0 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv127 32)) (bvlshr addflt_~a (_ bv24 32))))) (and .cse1 .cse2) (and .cse3 .cse4) (and .cse0 .cse5)))) (or (and .cse7 .cse5 .cse8) .cse9 (and .cse7 .cse1 .cse8)) (or .cse10 (and .cse7 .cse11 .cse3) (and .cse7 .cse11 (= addflt_~ea~0 (_ bv127 32)) .cse4)) (or .cse10 (= addflt_~eb~0 (_ bv127 32)) .cse9) (or .cse3 (not (= |addflt_#in~b| (_ bv0 32))))))) [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 115) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L895 garLoopResultBuilder]: At program point L116(line 116) the Hoare annotation is: (let ((.cse1 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (.cse0 (= addflt_~a |addflt_#in~a|)) (.cse2 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (or .cse0 (bvult |addflt_#in~a| |addflt_#in~b|)) (or .cse1 .cse2 (= addflt_~eb~0 (_ bv127 32))) (or .cse1 (and (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) (= addflt_~b |addflt_#in~b|))) (not (= |addflt_#in~b| (_ bv0 32))) (let ((.cse9 ((_ sign_extend 1) addflt_~ea~0))) (let ((.cse8 (bvadd .cse9 (bvneg ((_ sign_extend 1) addflt_~eb~0))))) (let ((.cse3 (bvsle (_ bv6442450944 33) .cse8)) (.cse4 (not (bvult addflt_~a addflt_~b))) (.cse5 (bvsle (bvadd .cse9 (bvneg ((_ sign_extend 1) (bvadd (bvlshr addflt_~b (_ bv24 32)) (_ bv4294967168 32))))) (_ bv2147483647 33))) (.cse6 (bvsle .cse8 (_ bv2147483647 33))) (.cse7 (or (= (_ bv0 32) |addflt_#in~b|) (not (= (_ bv0 32) addflt_~b))))) (or (and .cse3 .cse4 .cse5 .cse0 .cse6 .cse7) (and .cse3 .cse4 .cse5 .cse6 (= addflt_~b |addflt_#in~a|) .cse7))))) (or (and (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32)) (= addflt_~ea~0 (_ bv127 32))) .cse2) (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32)))))) [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point L116-1(line 116) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point L112-1(line 112) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point L141-1(line 141) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 83 147) the Hoare annotation is: true [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point L133-1(line 133) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2023-02-16 04:04:06,673 INFO L899 garLoopResultBuilder]: For program point addfltEXIT(lines 83 147) no Hoare annotation was computed. [2023-02-16 04:04:06,674 INFO L899 garLoopResultBuilder]: For program point addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 115) no Hoare annotation was computed. [2023-02-16 04:04:06,674 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2023-02-16 04:04:06,674 INFO L899 garLoopResultBuilder]: For program point addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2023-02-16 04:04:06,674 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-02-16 04:04:06,674 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-16 04:04:06,674 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-16 04:04:06,681 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-16 04:04:06,681 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-16 04:04:06,681 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-16 04:04:06,683 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] [2023-02-16 04:04:06,685 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:04:06,694 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:04:06,695 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:04:06,695 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:04:06,699 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:04:06,699 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:04:06,700 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:04:06,701 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:04:06,701 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:04:06,701 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:04:06,702 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:04:06,702 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:04:06,702 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:04:06,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,712 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,712 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,714 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:04:06,718 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:04:06,718 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:04:06,719 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:04:06,719 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:04:06,719 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:04:06,720 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:04:06,720 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:04:06,720 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:04:06,720 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:04:06,720 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:04:06,720 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:04:06,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:04:06 BoogieIcfgContainer [2023-02-16 04:04:06,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:04:06,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:04:06,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:04:06,722 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:04:06,722 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:46" (3/4) ... [2023-02-16 04:04:06,724 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 04:04:06,728 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-16 04:04:06,729 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2023-02-16 04:04:06,729 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-16 04:04:06,735 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-02-16 04:04:06,735 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-16 04:04:06,735 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 04:04:06,736 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 04:04:06,751 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:04:06,752 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:04:06,752 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:04:06,752 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:04:06,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!~bvult64(a, b) && a == \old(a)) && !(0bv32 == b)) || (!~bvult64(a, b) && b == \old(a))) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 127bv32) == ~bvlshr64(addflt_~a, 24bv32))) || (0bv32 == \old(a) && b == \old(a))) || (b == 0bv32 && b == \old(b))) || ((((!~bvult64(a, b) && a == \old(a)) && !(0bv32 == b)) || (!~bvult64(a, b) && b == \old(a))) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32)))) && ((((~bvadd128(a, 1bv32) == 0bv32 && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32))) && ~bvadd128(\old(b), 1bv32) == 0bv32) || !(~bvadd128(\old(b), 1bv32) == 0bv32)) || ((~bvadd128(a, 1bv32) == 0bv32 && 0bv32 == \old(a)) && ~bvadd128(\old(b), 1bv32) == 0bv32))) && ((!(~bvadd128(\old(a), 1bv32) == 0bv32) || ((~bvadd128(a, 1bv32) == 0bv32 && ~bvadd128(\old(a), 1bv32) == 0bv32) && b == 0bv32)) || (((~bvadd128(a, 1bv32) == 0bv32 && ~bvadd128(\old(a), 1bv32) == 0bv32) && ea == 127bv32) && b == \old(b)))) && ((!(~bvadd128(\old(a), 1bv32) == 0bv32) || eb == 127bv32) || !(~bvadd128(\old(b), 1bv32) == 0bv32))) && (b == 0bv32 || !(\old(b) == 0bv32)) [2023-02-16 04:04:06,772 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 04:04:06,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:04:06,773 INFO L158 Benchmark]: Toolchain (without parser) took 21171.61ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 64.8MB in the beginning and 77.1MB in the end (delta: -12.4MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2023-02-16 04:04:06,773 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:04:06,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.21ms. Allocated memory is still 88.1MB. Free memory was 64.5MB in the beginning and 51.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 04:04:06,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.26ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 49.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:04:06,777 INFO L158 Benchmark]: Boogie Preprocessor took 41.55ms. Allocated memory is still 88.1MB. Free memory was 49.5MB in the beginning and 47.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:04:06,777 INFO L158 Benchmark]: RCFGBuilder took 336.63ms. Allocated memory is still 88.1MB. Free memory was 47.8MB in the beginning and 58.5MB in the end (delta: -10.7MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2023-02-16 04:04:06,778 INFO L158 Benchmark]: TraceAbstraction took 20431.92ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 58.0MB in the beginning and 81.3MB in the end (delta: -23.4MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2023-02-16 04:04:06,778 INFO L158 Benchmark]: Witness Printer took 51.07ms. Allocated memory is still 107.0MB. Free memory was 81.3MB in the beginning and 77.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 04:04:06,785 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 60.8MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.21ms. Allocated memory is still 88.1MB. Free memory was 64.5MB in the beginning and 51.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.26ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 49.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.55ms. Allocated memory is still 88.1MB. Free memory was 49.5MB in the beginning and 47.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 336.63ms. Allocated memory is still 88.1MB. Free memory was 47.8MB in the beginning and 58.5MB in the end (delta: -10.7MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20431.92ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 58.0MB in the beginning and 81.3MB in the end (delta: -23.4MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. * Witness Printer took 51.07ms. Allocated memory is still 107.0MB. Free memory was 81.3MB in the beginning and 77.1MB 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[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,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 4 procedures, 84 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 865 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 10120 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8355 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2298 IncrementalHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 1765 mSDtfsCounter, 2298 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1437 GetRequests, 1246 SyntacticMatches, 7 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=11, InterpolantAutomatonStates: 167, 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, 21 MinimizatonAttempts, 254 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 231 PreInvPairs, 401 NumberOfFragments, 782 HoareAnnotationTreeSize, 231 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 28657 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 956 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1367 ConstructedInterpolants, 47 QuantifiedInterpolants, 2657 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1808 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 485/524 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:04:06,801 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:04:06,801 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:04:06,801 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:04:06,801 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:04:06,801 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:04:06,801 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:04:06,802 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:04:06,802 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:04:06,802 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:04:06,803 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:04:06,803 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:04:06,803 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: 93]: Loop Invariant [2023-02-16 04:04:06,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-16 04:04:06,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] Derived loop invariant: ((((((((((!~bvult64(a, b) && a == \old(a)) && !(0bv32 == b)) || (!~bvult64(a, b) && b == \old(a))) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 127bv32) == ~bvlshr64(addflt_~a, 24bv32))) || (0bv32 == \old(a) && b == \old(a))) || (b == 0bv32 && b == \old(b))) || ((((!~bvult64(a, b) && a == \old(a)) && !(0bv32 == b)) || (!~bvult64(a, b) && b == \old(a))) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32)))) && ((((~bvadd128(a, 1bv32) == 0bv32 && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32))) && ~bvadd128(\old(b), 1bv32) == 0bv32) || !(~bvadd128(\old(b), 1bv32) == 0bv32)) || ((~bvadd128(a, 1bv32) == 0bv32 && 0bv32 == \old(a)) && ~bvadd128(\old(b), 1bv32) == 0bv32))) && ((!(~bvadd128(\old(a), 1bv32) == 0bv32) || ((~bvadd128(a, 1bv32) == 0bv32 && ~bvadd128(\old(a), 1bv32) == 0bv32) && b == 0bv32)) || (((~bvadd128(a, 1bv32) == 0bv32 && ~bvadd128(\old(a), 1bv32) == 0bv32) && ea == 127bv32) && b == \old(b)))) && ((!(~bvadd128(\old(a), 1bv32) == 0bv32) || eb == 127bv32) || !(~bvadd128(\old(b), 1bv32) == 0bv32))) && (b == 0bv32 || !(\old(b) == 0bv32)) - InvariantResult [Line: 37]: Loop Invariant [2023-02-16 04:04:06,806 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:04:06,807 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:04:06,807 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:04:06,807 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:04:06,807 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:04:06,807 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:04:06,807 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:04:06,808 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:04:06,808 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:04:06,808 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:04:06,808 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:04:06,808 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))) RESULT: Ultimate proved your program to be correct! [2023-02-16 04:04:06,821 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