./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:53:57,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:53:57,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:53:57,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:53:57,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:53:57,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:53:57,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:53:57,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:53:57,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:53:57,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:53:57,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:53:57,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:53:57,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:53:57,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:53:57,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:53:57,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:53:57,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:53:57,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:53:57,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:53:57,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:53:57,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:53:57,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:53:57,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:53:57,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:53:57,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:53:57,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:53:57,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:53:57,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:53:57,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:53:57,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:53:57,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:53:57,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:53:57,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:53:57,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:53:57,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:53:57,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:53:57,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:53:57,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:53:57,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:53:57,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:53:57,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:53:57,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-15 01:53:57,881 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:53:57,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:53:57,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:53:57,882 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:53:57,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:53:57,883 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:53:57,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:53:57,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:53:57,883 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:53:57,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:53:57,884 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:53:57,884 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:53:57,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:53:57,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:53:57,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:53:57,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 01:53:57,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:53:57,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 01:53:57,885 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 01:53:57,885 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:53:57,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 01:53:57,886 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:53:57,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 01:53:57,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:53:57,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:53:57,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:53:57,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:53:57,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:53:57,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:53:57,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 01:53:57,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:53:57,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:53:57,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:53:57,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 01:53:57,888 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:53:57,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:53:57,888 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:53:57,888 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2023-02-15 01:53:58,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:53:58,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:53:58,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:53:58,153 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:53:58,154 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:53:58,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2023-02-15 01:53:59,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:53:59,396 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:53:59,396 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2023-02-15 01:53:59,401 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbb52b46/5012dc04724a42f09ee38a2eac6f76e0/FLAG3ad01c96d [2023-02-15 01:53:59,411 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbb52b46/5012dc04724a42f09ee38a2eac6f76e0 [2023-02-15 01:53:59,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:53:59,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:53:59,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:53:59,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:53:59,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:53:59,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d9ab5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59, skipping insertion in model container [2023-02-15 01:53:59,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:53:59,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:53:59,553 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2023-02-15 01:53:59,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:53:59,634 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:53:59,643 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2023-02-15 01:53:59,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:53:59,700 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:53:59,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59 WrapperNode [2023-02-15 01:53:59,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:53:59,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:53:59,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:53:59,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:53:59,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,750 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2023-02-15 01:53:59,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:53:59,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:53:59,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:53:59,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:53:59,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,785 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:53:59,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:53:59,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:53:59,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:53:59,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:53:59,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:53:59,812 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-15 01:53:59,831 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-15 01:53:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:53:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:53:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 01:53:59,843 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 01:53:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:53:59,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:53:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 01:53:59,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 01:53:59,910 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:53:59,911 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:54:00,393 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:54:00,399 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:54:00,399 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 01:54:00,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:00 BoogieIcfgContainer [2023-02-15 01:54:00,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:54:00,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:54:00,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:54:00,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:54:00,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:53:59" (1/3) ... [2023-02-15 01:54:00,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e5db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:54:00, skipping insertion in model container [2023-02-15 01:54:00,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59" (2/3) ... [2023-02-15 01:54:00,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e5db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:54:00, skipping insertion in model container [2023-02-15 01:54:00,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:00" (3/3) ... [2023-02-15 01:54:00,419 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2023-02-15 01:54:00,433 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:54:00,434 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 01:54:00,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:54:00,511 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;@34e1d186, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:54:00,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 01:54:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 96 states have (on average 1.6875) internal successors, (162), 114 states have internal predecessors, (162), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:54:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:54:00,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:00,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:00,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1224848007, now seen corresponding path program 1 times [2023-02-15 01:54:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:00,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489688841] [2023-02-15 01:54:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:00,785 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-15 01:54:00,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:00,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489688841] [2023-02-15 01:54:00,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489688841] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:00,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:00,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:54:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437306535] [2023-02-15 01:54:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:00,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:00,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:00,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:00,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:00,828 INFO L87 Difference]: Start difference. First operand has 124 states, 96 states have (on average 1.6875) internal successors, (162), 114 states have internal predecessors, (162), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:54:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:00,928 INFO L93 Difference]: Finished difference Result 293 states and 445 transitions. [2023-02-15 01:54:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:00,933 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-15 01:54:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:00,944 INFO L225 Difference]: With dead ends: 293 [2023-02-15 01:54:00,944 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 01:54:00,950 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-15 01:54:00,954 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 83 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:00,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 475 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 01:54:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2023-02-15 01:54:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 121 states have internal predecessors, (165), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2023-02-15 01:54:00,997 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 9 [2023-02-15 01:54:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:00,997 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2023-02-15 01:54:00,999 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-15 01:54:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2023-02-15 01:54:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:54:01,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:01,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:54:01,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash 782574087, now seen corresponding path program 1 times [2023-02-15 01:54:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901328652] [2023-02-15 01:54:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,087 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-15 01:54:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901328652] [2023-02-15 01:54:01,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901328652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828545431] [2023-02-15 01:54:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:01,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:01,090 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:54:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,229 INFO L93 Difference]: Finished difference Result 251 states and 329 transitions. [2023-02-15 01:54:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:01,230 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-15 01:54:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,234 INFO L225 Difference]: With dead ends: 251 [2023-02-15 01:54:01,234 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 01:54:01,235 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-15 01:54:01,236 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 146 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:01,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 345 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 01:54:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 140. [2023-02-15 01:54:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 130 states have internal predecessors, (177), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2023-02-15 01:54:01,250 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 14 [2023-02-15 01:54:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,250 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2023-02-15 01:54:01,250 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-15 01:54:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2023-02-15 01:54:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:54:01,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,251 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:01,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:54:01,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2114092376, now seen corresponding path program 1 times [2023-02-15 01:54:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958150260] [2023-02-15 01:54:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,305 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-15 01:54:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958150260] [2023-02-15 01:54:01,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958150260] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:54:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961125875] [2023-02-15 01:54:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:54:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:54:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:54:01,310 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:54:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,345 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2023-02-15 01:54:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:54:01,346 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-15 01:54:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,348 INFO L225 Difference]: With dead ends: 146 [2023-02-15 01:54:01,348 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 01:54:01,351 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-15 01:54:01,356 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:01,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 01:54:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2023-02-15 01:54:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.5) internal successors, (174), 128 states have internal predecessors, (174), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 186 transitions. [2023-02-15 01:54:01,376 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 186 transitions. Word has length 16 [2023-02-15 01:54:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,377 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 186 transitions. [2023-02-15 01:54:01,377 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-15 01:54:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 186 transitions. [2023-02-15 01:54:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 01:54:01,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:01,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:54:01,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:01,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1510006967, now seen corresponding path program 1 times [2023-02-15 01:54:01,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027508898] [2023-02-15 01:54:01,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,475 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-15 01:54:01,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027508898] [2023-02-15 01:54:01,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027508898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137041755] [2023-02-15 01:54:01,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:01,477 INFO L87 Difference]: Start difference. First operand 138 states and 186 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:54:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,573 INFO L93 Difference]: Finished difference Result 164 states and 213 transitions. [2023-02-15 01:54:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:01,574 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-15 01:54:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,576 INFO L225 Difference]: With dead ends: 164 [2023-02-15 01:54:01,576 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 01:54:01,576 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-15 01:54:01,579 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 105 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:01,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 436 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 01:54:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 138. [2023-02-15 01:54:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.4827586206896552) internal successors, (172), 128 states have internal predecessors, (172), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2023-02-15 01:54:01,606 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 15 [2023-02-15 01:54:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,607 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2023-02-15 01:54:01,607 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-15 01:54:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2023-02-15 01:54:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 01:54:01,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,608 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:01,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:54:01,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:01,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1140981629, now seen corresponding path program 1 times [2023-02-15 01:54:01,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388737235] [2023-02-15 01:54:01,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,658 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-15 01:54:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388737235] [2023-02-15 01:54:01,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388737235] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787640175] [2023-02-15 01:54:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:01,660 INFO L87 Difference]: Start difference. First operand 138 states and 184 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:54:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,731 INFO L93 Difference]: Finished difference Result 196 states and 260 transitions. [2023-02-15 01:54:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:01,731 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-15 01:54:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,733 INFO L225 Difference]: With dead ends: 196 [2023-02-15 01:54:01,735 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 01:54:01,735 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-15 01:54:01,736 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 147 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:01,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 334 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 01:54:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2023-02-15 01:54:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 155 states have internal predecessors, (215), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 227 transitions. [2023-02-15 01:54:01,775 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 227 transitions. Word has length 17 [2023-02-15 01:54:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,779 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 227 transitions. [2023-02-15 01:54:01,779 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-15 01:54:01,779 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 227 transitions. [2023-02-15 01:54:01,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 01:54:01,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,794 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:01,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:54:01,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:01,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1112354273, now seen corresponding path program 1 times [2023-02-15 01:54:01,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135536835] [2023-02-15 01:54:01,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,876 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-15 01:54:01,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135536835] [2023-02-15 01:54:01,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135536835] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:01,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105602065] [2023-02-15 01:54:01,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:01,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:01,878 INFO L87 Difference]: Start difference. First operand 166 states and 227 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:54:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,946 INFO L93 Difference]: Finished difference Result 194 states and 259 transitions. [2023-02-15 01:54:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:01,946 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-15 01:54:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,948 INFO L225 Difference]: With dead ends: 194 [2023-02-15 01:54:01,948 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 01:54:01,949 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-15 01:54:01,952 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 145 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:01,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 335 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 01:54:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2023-02-15 01:54:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 148 states have (on average 1.4797297297297298) internal successors, (219), 159 states have internal predecessors, (219), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 231 transitions. [2023-02-15 01:54:01,964 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 231 transitions. Word has length 17 [2023-02-15 01:54:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,965 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 231 transitions. [2023-02-15 01:54:01,965 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-15 01:54:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2023-02-15 01:54:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 01:54:01,969 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,969 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:01,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:54:01,970 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -229959118, now seen corresponding path program 1 times [2023-02-15 01:54:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667315415] [2023-02-15 01:54:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,039 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-15 01:54:02,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:02,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667315415] [2023-02-15 01:54:02,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667315415] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:02,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110279869] [2023-02-15 01:54:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:02,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:02,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:02,055 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-15 01:54:02,057 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-15 01:54:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:54:02,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:02,157 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-15 01:54:02,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:02,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110279869] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:02,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:54:02,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-15 01:54:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889955672] [2023-02-15 01:54:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:02,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:02,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:54:02,159 INFO L87 Difference]: Start difference. First operand 170 states and 231 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:54:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:02,206 INFO L93 Difference]: Finished difference Result 210 states and 282 transitions. [2023-02-15 01:54:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:02,206 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-15 01:54:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:02,207 INFO L225 Difference]: With dead ends: 210 [2023-02-15 01:54:02,207 INFO L226 Difference]: Without dead ends: 209 [2023-02-15 01:54:02,207 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-15 01:54:02,208 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 16 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:02,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 343 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-15 01:54:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2023-02-15 01:54:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 154 states have internal predecessors, (211), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2023-02-15 01:54:02,216 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 223 transitions. Word has length 17 [2023-02-15 01:54:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:02,216 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 223 transitions. [2023-02-15 01:54:02,217 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-15 01:54:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 223 transitions. [2023-02-15 01:54:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 01:54:02,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:02,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:02,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:02,422 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-15 01:54:02,422 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:02,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1188804043, now seen corresponding path program 1 times [2023-02-15 01:54:02,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:02,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516481669] [2023-02-15 01:54:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:02,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,446 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-15 01:54:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:02,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516481669] [2023-02-15 01:54:02,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516481669] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:02,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:02,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:54:02,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308643008] [2023-02-15 01:54:02,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:02,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:02,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:02,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:02,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:02,448 INFO L87 Difference]: Start difference. First operand 165 states and 223 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:54:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:02,484 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2023-02-15 01:54:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:02,484 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-15 01:54:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:02,487 INFO L225 Difference]: With dead ends: 211 [2023-02-15 01:54:02,487 INFO L226 Difference]: Without dead ends: 210 [2023-02-15 01:54:02,487 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-15 01:54:02,488 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 21 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:02,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 235 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-15 01:54:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2023-02-15 01:54:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 154 states have internal predecessors, (209), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2023-02-15 01:54:02,497 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 19 [2023-02-15 01:54:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:02,497 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2023-02-15 01:54:02,497 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-15 01:54:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2023-02-15 01:54:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 01:54:02,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:02,498 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-15 01:54:02,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 01:54:02,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:02,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1608645210, now seen corresponding path program 1 times [2023-02-15 01:54:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:02,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795901971] [2023-02-15 01:54:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,558 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-15 01:54:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:02,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795901971] [2023-02-15 01:54:02,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795901971] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:02,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:02,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946534636] [2023-02-15 01:54:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:02,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:02,560 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:54:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:02,621 INFO L93 Difference]: Finished difference Result 189 states and 252 transitions. [2023-02-15 01:54:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:02,622 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-15 01:54:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:02,626 INFO L225 Difference]: With dead ends: 189 [2023-02-15 01:54:02,626 INFO L226 Difference]: Without dead ends: 187 [2023-02-15 01:54:02,626 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-15 01:54:02,628 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 139 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:02,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 336 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-15 01:54:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2023-02-15 01:54:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.4388489208633093) internal successors, (200), 148 states have internal predecessors, (200), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 212 transitions. [2023-02-15 01:54:02,636 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 212 transitions. Word has length 24 [2023-02-15 01:54:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:02,637 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 212 transitions. [2023-02-15 01:54:02,637 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-15 01:54:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 212 transitions. [2023-02-15 01:54:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 01:54:02,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:02,638 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-15 01:54:02,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 01:54:02,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1580017854, now seen corresponding path program 1 times [2023-02-15 01:54:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:02,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647379196] [2023-02-15 01:54:02,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,683 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-15 01:54:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647379196] [2023-02-15 01:54:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647379196] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:02,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573642890] [2023-02-15 01:54:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:02,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:02,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:02,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:02,685 INFO L87 Difference]: Start difference. First operand 159 states and 212 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:54:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:02,742 INFO L93 Difference]: Finished difference Result 181 states and 240 transitions. [2023-02-15 01:54:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:02,742 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-15 01:54:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:02,743 INFO L225 Difference]: With dead ends: 181 [2023-02-15 01:54:02,743 INFO L226 Difference]: Without dead ends: 179 [2023-02-15 01:54:02,743 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-15 01:54:02,744 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 138 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:02,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 334 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-15 01:54:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2023-02-15 01:54:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 139 states have internal predecessors, (188), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 200 transitions. [2023-02-15 01:54:02,751 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 200 transitions. Word has length 24 [2023-02-15 01:54:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:02,751 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 200 transitions. [2023-02-15 01:54:02,751 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-15 01:54:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 200 transitions. [2023-02-15 01:54:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 01:54:02,752 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:02,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:02,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 01:54:02,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash 880395004, now seen corresponding path program 1 times [2023-02-15 01:54:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:02,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552314993] [2023-02-15 01:54:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:54:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,884 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-15 01:54:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:02,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552314993] [2023-02-15 01:54:02,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552314993] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:02,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560038273] [2023-02-15 01:54:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:02,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:02,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:02,890 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-15 01:54:02,892 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-15 01:54:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 01:54:02,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:02,987 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-15 01:54:02,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:03,097 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-15 01:54:03,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560038273] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:03,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:03,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2023-02-15 01:54:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966327003] [2023-02-15 01:54:03,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:03,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 01:54:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:03,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 01:54:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:54:03,099 INFO L87 Difference]: Start difference. First operand 150 states and 200 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:54:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:03,415 INFO L93 Difference]: Finished difference Result 413 states and 542 transitions. [2023-02-15 01:54:03,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:54:03,416 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2023-02-15 01:54:03,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:03,417 INFO L225 Difference]: With dead ends: 413 [2023-02-15 01:54:03,417 INFO L226 Difference]: Without dead ends: 246 [2023-02-15 01:54:03,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2023-02-15 01:54:03,419 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 282 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:03,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1121 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:54:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-15 01:54:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 118. [2023-02-15 01:54:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.39) internal successors, (139), 107 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2023-02-15 01:54:03,432 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 31 [2023-02-15 01:54:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:03,432 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2023-02-15 01:54:03,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:54:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2023-02-15 01:54:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 01:54:03,434 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:03,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:03,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 01:54:03,641 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-15 01:54:03,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:03,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1437005267, now seen corresponding path program 1 times [2023-02-15 01:54:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:03,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756203252] [2023-02-15 01:54:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:54:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,760 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-15 01:54:03,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:03,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756203252] [2023-02-15 01:54:03,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756203252] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:03,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:03,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:54:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194684745] [2023-02-15 01:54:03,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:03,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:54:03,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:03,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:54:03,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:54:03,761 INFO L87 Difference]: Start difference. First operand 118 states and 151 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:03,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:03,859 INFO L93 Difference]: Finished difference Result 272 states and 342 transitions. [2023-02-15 01:54:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:54:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-02-15 01:54:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:03,860 INFO L225 Difference]: With dead ends: 272 [2023-02-15 01:54:03,860 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 01:54:03,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:54:03,861 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 123 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:03,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 823 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 01:54:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 118. [2023-02-15 01:54:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.37) internal successors, (137), 107 states have internal predecessors, (137), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2023-02-15 01:54:03,870 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 36 [2023-02-15 01:54:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:03,871 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2023-02-15 01:54:03,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2023-02-15 01:54:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:54:03,872 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:03,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:03,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 01:54:03,872 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1977986268, now seen corresponding path program 2 times [2023-02-15 01:54:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:03,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775888904] [2023-02-15 01:54:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:54:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,006 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-15 01:54:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:04,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775888904] [2023-02-15 01:54:04,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775888904] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:04,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:04,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:54:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600344793] [2023-02-15 01:54:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:04,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:54:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:54:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:54:04,009 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:04,164 INFO L93 Difference]: Finished difference Result 398 states and 499 transitions. [2023-02-15 01:54:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:54:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-15 01:54:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:04,166 INFO L225 Difference]: With dead ends: 398 [2023-02-15 01:54:04,166 INFO L226 Difference]: Without dead ends: 354 [2023-02-15 01:54:04,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:54:04,167 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 327 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:04,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 904 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-02-15 01:54:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 146. [2023-02-15 01:54:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 134 states have internal predecessors, (175), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 01:54:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2023-02-15 01:54:04,175 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 40 [2023-02-15 01:54:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:04,175 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2023-02-15 01:54:04,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2023-02-15 01:54:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:54:04,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:04,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:04,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 01:54:04,176 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1977988190, now seen corresponding path program 1 times [2023-02-15 01:54:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:04,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884774191] [2023-02-15 01:54:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:54:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 01:54:04,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:04,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884774191] [2023-02-15 01:54:04,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884774191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:04,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626622923] [2023-02-15 01:54:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:04,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:04,268 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-15 01:54:04,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:54:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 01:54:04,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:04,392 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-15 01:54:04,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:04,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626622923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:04,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:54:04,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2023-02-15 01:54:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456595295] [2023-02-15 01:54:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:54:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:54:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:54:04,395 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:54:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:04,513 INFO L93 Difference]: Finished difference Result 328 states and 427 transitions. [2023-02-15 01:54:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:54:04,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-02-15 01:54:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:04,514 INFO L225 Difference]: With dead ends: 328 [2023-02-15 01:54:04,514 INFO L226 Difference]: Without dead ends: 253 [2023-02-15 01:54:04,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:54:04,515 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 202 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:04,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 723 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-15 01:54:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 173. [2023-02-15 01:54:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 158 states have internal predecessors, (203), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 01:54:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 220 transitions. [2023-02-15 01:54:04,523 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 220 transitions. Word has length 40 [2023-02-15 01:54:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:04,524 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 220 transitions. [2023-02-15 01:54:04,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:54:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 220 transitions. [2023-02-15 01:54:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:54:04,525 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:04,525 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] [2023-02-15 01:54:04,532 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-15 01:54:04,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:04,752 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash -282142285, now seen corresponding path program 1 times [2023-02-15 01:54:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:04,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263564884] [2023-02-15 01:54:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 01:54:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 01:54:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:04,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263564884] [2023-02-15 01:54:04,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263564884] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:04,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101241269] [2023-02-15 01:54:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:04,878 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-15 01:54:04,880 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-15 01:54:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 01:54:04,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:54:05,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:05,181 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-15 01:54:05,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101241269] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:05,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:54:05,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 11] total 19 [2023-02-15 01:54:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59712709] [2023-02-15 01:54:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:05,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:54:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:54:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-02-15 01:54:05,183 INFO L87 Difference]: Start difference. First operand 173 states and 220 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:05,337 INFO L93 Difference]: Finished difference Result 338 states and 424 transitions. [2023-02-15 01:54:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:54:05,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-15 01:54:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:05,339 INFO L225 Difference]: With dead ends: 338 [2023-02-15 01:54:05,339 INFO L226 Difference]: Without dead ends: 274 [2023-02-15 01:54:05,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2023-02-15 01:54:05,341 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 103 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:05,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 924 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-15 01:54:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 173. [2023-02-15 01:54:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 158 states have internal predecessors, (202), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 01:54:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 219 transitions. [2023-02-15 01:54:05,355 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 219 transitions. Word has length 45 [2023-02-15 01:54:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:05,356 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 219 transitions. [2023-02-15 01:54:05,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 219 transitions. [2023-02-15 01:54:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 01:54:05,357 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:05,357 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-15 01:54:05,367 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-15 01:54:05,563 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,SelfDestructingSolverStorable14 [2023-02-15 01:54:05,563 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash 739484049, now seen corresponding path program 1 times [2023-02-15 01:54:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:05,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111750124] [2023-02-15 01:54:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:05,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:54:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:05,715 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-15 01:54:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111750124] [2023-02-15 01:54:05,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111750124] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:05,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:05,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 01:54:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064934112] [2023-02-15 01:54:05,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:05,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:54:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:05,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:54:05,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:54:05,717 INFO L87 Difference]: Start difference. First operand 173 states and 219 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:05,902 INFO L93 Difference]: Finished difference Result 465 states and 585 transitions. [2023-02-15 01:54:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:54:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2023-02-15 01:54:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:05,905 INFO L225 Difference]: With dead ends: 465 [2023-02-15 01:54:05,905 INFO L226 Difference]: Without dead ends: 421 [2023-02-15 01:54:05,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-15 01:54:05,906 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 384 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:05,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 952 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-02-15 01:54:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 184. [2023-02-15 01:54:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 162 states have (on average 1.3271604938271604) internal successors, (215), 167 states have internal predecessors, (215), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 01:54:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 234 transitions. [2023-02-15 01:54:05,921 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 234 transitions. Word has length 47 [2023-02-15 01:54:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:05,921 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 234 transitions. [2023-02-15 01:54:05,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 234 transitions. [2023-02-15 01:54:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 01:54:05,922 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:05,922 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-15 01:54:05,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:54:05,922 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash 739485971, now seen corresponding path program 1 times [2023-02-15 01:54:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:05,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003794827] [2023-02-15 01:54:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:06,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:54:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 01:54:06,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:06,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003794827] [2023-02-15 01:54:06,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003794827] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:06,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047446928] [2023-02-15 01:54:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:06,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:06,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:06,121 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-15 01:54:06,160 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-15 01:54:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:06,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 01:54:06,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 01:54:06,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 01:54:06,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047446928] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:06,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:06,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 18 [2023-02-15 01:54:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100546155] [2023-02-15 01:54:06,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:06,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:54:06,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:06,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:54:06,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-02-15 01:54:06,333 INFO L87 Difference]: Start difference. First operand 184 states and 234 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 01:54:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:06,657 INFO L93 Difference]: Finished difference Result 384 states and 492 transitions. [2023-02-15 01:54:06,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 01:54:06,658 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2023-02-15 01:54:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:06,660 INFO L225 Difference]: With dead ends: 384 [2023-02-15 01:54:06,660 INFO L226 Difference]: Without dead ends: 289 [2023-02-15 01:54:06,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2023-02-15 01:54:06,661 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 275 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:06,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1030 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:54:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-15 01:54:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 181. [2023-02-15 01:54:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 165 states have internal predecessors, (205), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 11 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 01:54:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 224 transitions. [2023-02-15 01:54:06,680 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 224 transitions. Word has length 47 [2023-02-15 01:54:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:06,680 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 224 transitions. [2023-02-15 01:54:06,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 01:54:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 224 transitions. [2023-02-15 01:54:06,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:54:06,681 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:06,681 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-15 01:54:06,701 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-15 01:54:06,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 01:54:06,905 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:06,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1455073041, now seen corresponding path program 1 times [2023-02-15 01:54:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:06,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879419541] [2023-02-15 01:54:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:54:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:54:07,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:07,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879419541] [2023-02-15 01:54:07,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879419541] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:07,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:07,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:54:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891784919] [2023-02-15 01:54:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:07,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:54:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:54:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:54:07,159 INFO L87 Difference]: Start difference. First operand 181 states and 224 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:07,547 INFO L93 Difference]: Finished difference Result 482 states and 601 transitions. [2023-02-15 01:54:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 01:54:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-15 01:54:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:07,549 INFO L225 Difference]: With dead ends: 482 [2023-02-15 01:54:07,549 INFO L226 Difference]: Without dead ends: 480 [2023-02-15 01:54:07,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2023-02-15 01:54:07,550 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 382 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:07,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1727 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:54:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-02-15 01:54:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 220. [2023-02-15 01:54:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 7 states have call successors, (7), 4 states have call predecessors, (7), 8 states have return successors, (14), 13 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-15 01:54:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 277 transitions. [2023-02-15 01:54:07,566 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 277 transitions. Word has length 49 [2023-02-15 01:54:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:07,566 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 277 transitions. [2023-02-15 01:54:07,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 277 transitions. [2023-02-15 01:54:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:54:07,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:07,567 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-15 01:54:07,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 01:54:07,567 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1397814739, now seen corresponding path program 1 times [2023-02-15 01:54:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:07,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334478429] [2023-02-15 01:54:07,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:54:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,689 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-15 01:54:07,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334478429] [2023-02-15 01:54:07,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334478429] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104169714] [2023-02-15 01:54:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:07,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:07,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:07,705 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-15 01:54:07,706 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-15 01:54:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:07,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 01:54:07,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:07,816 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-15 01:54:07,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:07,961 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-15 01:54:07,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104169714] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:07,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:07,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-02-15 01:54:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706985019] [2023-02-15 01:54:07,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:07,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:54:07,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:07,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:54:07,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:54:07,963 INFO L87 Difference]: Start difference. First operand 220 states and 277 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:54:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:08,121 INFO L93 Difference]: Finished difference Result 424 states and 538 transitions. [2023-02-15 01:54:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:54:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2023-02-15 01:54:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:08,123 INFO L225 Difference]: With dead ends: 424 [2023-02-15 01:54:08,123 INFO L226 Difference]: Without dead ends: 353 [2023-02-15 01:54:08,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:54:08,124 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 251 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:08,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 729 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-02-15 01:54:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 246. [2023-02-15 01:54:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 223 states have (on average 1.2780269058295963) internal successors, (285), 228 states have internal predecessors, (285), 7 states have call successors, (7), 4 states have call predecessors, (7), 8 states have return successors, (14), 13 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-15 01:54:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 306 transitions. [2023-02-15 01:54:08,138 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 306 transitions. Word has length 49 [2023-02-15 01:54:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:08,138 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 306 transitions. [2023-02-15 01:54:08,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:54:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 306 transitions. [2023-02-15 01:54:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:54:08,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:08,139 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-15 01:54:08,155 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-15 01:54:08,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:08,344 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1622585003, now seen corresponding path program 2 times [2023-02-15 01:54:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:08,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402197442] [2023-02-15 01:54:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:08,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 01:54:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 01:54:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:08,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402197442] [2023-02-15 01:54:08,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402197442] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:08,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296734572] [2023-02-15 01:54:08,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:54:08,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:08,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:08,499 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-15 01:54:08,501 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-15 01:54:08,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 01:54:08,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:54:08,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 01:54:08,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:08,615 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-15 01:54:08,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:08,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296734572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:08,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:54:08,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2023-02-15 01:54:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701882960] [2023-02-15 01:54:08,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:08,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:54:08,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:08,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:54:08,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:54:08,617 INFO L87 Difference]: Start difference. First operand 246 states and 306 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:08,681 INFO L93 Difference]: Finished difference Result 457 states and 568 transitions. [2023-02-15 01:54:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:54:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-15 01:54:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:08,683 INFO L225 Difference]: With dead ends: 457 [2023-02-15 01:54:08,683 INFO L226 Difference]: Without dead ends: 378 [2023-02-15 01:54:08,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-02-15 01:54:08,684 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 159 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:08,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 603 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-02-15 01:54:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 252. [2023-02-15 01:54:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 229 states have (on average 1.2707423580786026) internal successors, (291), 233 states have internal predecessors, (291), 7 states have call successors, (7), 4 states have call predecessors, (7), 8 states have return successors, (14), 14 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-15 01:54:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 312 transitions. [2023-02-15 01:54:08,703 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 312 transitions. Word has length 49 [2023-02-15 01:54:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:08,704 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 312 transitions. [2023-02-15 01:54:08,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 312 transitions. [2023-02-15 01:54:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:54:08,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:08,704 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-15 01:54:08,715 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-15 01:54:08,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:08,910 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:08,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1992323923, now seen corresponding path program 1 times [2023-02-15 01:54:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:08,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401130053] [2023-02-15 01:54:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 01:54:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,059 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-15 01:54:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:09,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401130053] [2023-02-15 01:54:09,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401130053] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:09,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:09,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:54:09,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466464691] [2023-02-15 01:54:09,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:09,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:54:09,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:09,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:54:09,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:54:09,062 INFO L87 Difference]: Start difference. First operand 252 states and 312 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:09,232 INFO L93 Difference]: Finished difference Result 470 states and 579 transitions. [2023-02-15 01:54:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:54:09,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-15 01:54:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:09,235 INFO L225 Difference]: With dead ends: 470 [2023-02-15 01:54:09,235 INFO L226 Difference]: Without dead ends: 436 [2023-02-15 01:54:09,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:54:09,235 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 217 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:09,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1127 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-02-15 01:54:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 263. [2023-02-15 01:54:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 240 states have (on average 1.2791666666666666) internal successors, (307), 244 states have internal predecessors, (307), 7 states have call successors, (7), 4 states have call predecessors, (7), 8 states have return successors, (14), 14 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-15 01:54:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 328 transitions. [2023-02-15 01:54:09,263 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 328 transitions. Word has length 49 [2023-02-15 01:54:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:09,264 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 328 transitions. [2023-02-15 01:54:09,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 328 transitions. [2023-02-15 01:54:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:54:09,264 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:09,264 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-15 01:54:09,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 01:54:09,265 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2049582225, now seen corresponding path program 1 times [2023-02-15 01:54:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:09,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63759895] [2023-02-15 01:54:09,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:09,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 01:54:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,496 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-15 01:54:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:09,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63759895] [2023-02-15 01:54:09,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63759895] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:09,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462060996] [2023-02-15 01:54:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:09,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:09,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:09,498 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-15 01:54:09,539 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-15 01:54:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:09,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 01:54:09,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:09,782 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-15 01:54:09,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:10,201 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-15 01:54:10,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462060996] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:10,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:10,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2023-02-15 01:54:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741775768] [2023-02-15 01:54:10,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:10,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 01:54:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:10,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 01:54:10,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2023-02-15 01:54:10,203 INFO L87 Difference]: Start difference. First operand 263 states and 328 transitions. Second operand has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 19 states have internal predecessors, (85), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 01:54:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:11,052 INFO L93 Difference]: Finished difference Result 828 states and 1039 transitions. [2023-02-15 01:54:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 01:54:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 19 states have internal predecessors, (85), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2023-02-15 01:54:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:11,057 INFO L225 Difference]: With dead ends: 828 [2023-02-15 01:54:11,057 INFO L226 Difference]: Without dead ends: 761 [2023-02-15 01:54:11,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 01:54:11,059 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 739 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:11,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2303 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 01:54:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2023-02-15 01:54:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 322. [2023-02-15 01:54:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 297 states have (on average 1.2895622895622896) internal successors, (383), 298 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (19), 19 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-15 01:54:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 410 transitions. [2023-02-15 01:54:11,079 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 410 transitions. Word has length 49 [2023-02-15 01:54:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:11,079 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 410 transitions. [2023-02-15 01:54:11,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 19 states have internal predecessors, (85), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 01:54:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 410 transitions. [2023-02-15 01:54:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 01:54:11,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:11,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:11,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 01:54:11,286 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,SelfDestructingSolverStorable21 [2023-02-15 01:54:11,286 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1621632943, now seen corresponding path program 1 times [2023-02-15 01:54:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890143126] [2023-02-15 01:54:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 01:54:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,355 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-15 01:54:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890143126] [2023-02-15 01:54:11,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890143126] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906597012] [2023-02-15 01:54:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:11,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:11,357 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-15 01:54:11,359 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-15 01:54:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:54:11,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:54:11,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:11,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906597012] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:11,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:54:11,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-15 01:54:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081498287] [2023-02-15 01:54:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:11,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:11,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:11,423 INFO L87 Difference]: Start difference. First operand 322 states and 410 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:54:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:11,455 INFO L93 Difference]: Finished difference Result 579 states and 741 transitions. [2023-02-15 01:54:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2023-02-15 01:54:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:11,457 INFO L225 Difference]: With dead ends: 579 [2023-02-15 01:54:11,457 INFO L226 Difference]: Without dead ends: 354 [2023-02-15 01:54:11,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:11,458 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 4 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:11,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 310 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-02-15 01:54:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 338. [2023-02-15 01:54:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 313 states have (on average 1.2747603833865815) internal successors, (399), 314 states have internal predecessors, (399), 8 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (19), 19 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-15 01:54:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 426 transitions. [2023-02-15 01:54:11,480 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 426 transitions. Word has length 50 [2023-02-15 01:54:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:11,480 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 426 transitions. [2023-02-15 01:54:11,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:54:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 426 transitions. [2023-02-15 01:54:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:54:11,481 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:11,481 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-15 01:54:11,486 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-15 01:54:11,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:11,686 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash -443554453, now seen corresponding path program 1 times [2023-02-15 01:54:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:11,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258859444] [2023-02-15 01:54:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:54:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:54:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:11,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258859444] [2023-02-15 01:54:11,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258859444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:11,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291978307] [2023-02-15 01:54:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:11,975 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:11,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 01:54:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:12,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 01:54:12,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 01:54:12,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:12,740 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-15 01:54:12,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291978307] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:12,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:12,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2023-02-15 01:54:12,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101519371] [2023-02-15 01:54:12,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:12,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 01:54:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:12,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 01:54:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1366, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 01:54:12,742 INFO L87 Difference]: Start difference. First operand 338 states and 426 transitions. Second operand has 39 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 01:54:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:14,129 INFO L93 Difference]: Finished difference Result 913 states and 1190 transitions. [2023-02-15 01:54:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 01:54:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 51 [2023-02-15 01:54:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:14,133 INFO L225 Difference]: With dead ends: 913 [2023-02-15 01:54:14,133 INFO L226 Difference]: Without dead ends: 864 [2023-02-15 01:54:14,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=342, Invalid=3690, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 01:54:14,135 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 644 mSDsluCounter, 3830 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 4008 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:14,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 4008 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 01:54:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-02-15 01:54:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 381. [2023-02-15 01:54:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 350 states have (on average 1.2685714285714285) internal successors, (444), 352 states have internal predecessors, (444), 11 states have call successors, (11), 4 states have call predecessors, (11), 12 states have return successors, (34), 24 states have call predecessors, (34), 11 states have call successors, (34) [2023-02-15 01:54:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 489 transitions. [2023-02-15 01:54:14,158 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 489 transitions. Word has length 51 [2023-02-15 01:54:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:14,158 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 489 transitions. [2023-02-15 01:54:14,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 01:54:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 489 transitions. [2023-02-15 01:54:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:54:14,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:14,160 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-15 01:54:14,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:14,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-15 01:54:14,365 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:14,365 INFO L85 PathProgramCache]: Analyzing trace with hash -420922199, now seen corresponding path program 1 times [2023-02-15 01:54:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:14,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638832741] [2023-02-15 01:54:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:14,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:14,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 01:54:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:14,534 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-15 01:54:14,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:14,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638832741] [2023-02-15 01:54:14,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638832741] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:14,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:14,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:54:14,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721670] [2023-02-15 01:54:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:54:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:54:14,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:54:14,536 INFO L87 Difference]: Start difference. First operand 381 states and 489 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:17,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 01:54:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:17,769 INFO L93 Difference]: Finished difference Result 508 states and 644 transitions. [2023-02-15 01:54:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:54:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2023-02-15 01:54:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:17,772 INFO L225 Difference]: With dead ends: 508 [2023-02-15 01:54:17,772 INFO L226 Difference]: Without dead ends: 507 [2023-02-15 01:54:17,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:54:17,773 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 257 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:17,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 891 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2023-02-15 01:54:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2023-02-15 01:54:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 379. [2023-02-15 01:54:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 348 states have (on average 1.2672413793103448) internal successors, (441), 350 states have internal predecessors, (441), 11 states have call successors, (11), 4 states have call predecessors, (11), 12 states have return successors, (34), 24 states have call predecessors, (34), 11 states have call successors, (34) [2023-02-15 01:54:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 486 transitions. [2023-02-15 01:54:17,795 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 486 transitions. Word has length 51 [2023-02-15 01:54:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:17,796 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 486 transitions. [2023-02-15 01:54:17,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 486 transitions. [2023-02-15 01:54:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 01:54:17,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:17,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:17,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 01:54:17,798 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:17,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:17,798 INFO L85 PathProgramCache]: Analyzing trace with hash -933273561, now seen corresponding path program 1 times [2023-02-15 01:54:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:17,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472757600] [2023-02-15 01:54:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:17,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 01:54:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:17,863 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-15 01:54:17,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:17,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472757600] [2023-02-15 01:54:17,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472757600] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:17,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:17,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:54:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822040483] [2023-02-15 01:54:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:17,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:54:17,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:54:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:54:17,865 INFO L87 Difference]: Start difference. First operand 379 states and 486 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:18,008 INFO L93 Difference]: Finished difference Result 560 states and 707 transitions. [2023-02-15 01:54:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:54:18,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2023-02-15 01:54:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:18,010 INFO L225 Difference]: With dead ends: 560 [2023-02-15 01:54:18,010 INFO L226 Difference]: Without dead ends: 517 [2023-02-15 01:54:18,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:54:18,011 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 333 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:18,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 636 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-02-15 01:54:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 363. [2023-02-15 01:54:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 332 states have (on average 1.2590361445783131) internal successors, (418), 334 states have internal predecessors, (418), 11 states have call successors, (11), 4 states have call predecessors, (11), 12 states have return successors, (34), 24 states have call predecessors, (34), 11 states have call successors, (34) [2023-02-15 01:54:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 463 transitions. [2023-02-15 01:54:18,030 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 463 transitions. Word has length 55 [2023-02-15 01:54:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:18,030 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 463 transitions. [2023-02-15 01:54:18,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:54:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 463 transitions. [2023-02-15 01:54:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:54:18,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:18,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, 1, 1, 1, 1, 1] [2023-02-15 01:54:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 01:54:18,032 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -568271205, now seen corresponding path program 1 times [2023-02-15 01:54:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:18,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622194636] [2023-02-15 01:54:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:18,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:18,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 01:54:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:18,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-15 01:54:18,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:18,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622194636] [2023-02-15 01:54:18,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622194636] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:18,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938552982] [2023-02-15 01:54:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:18,218 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:18,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 01:54:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:18,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 01:54:18,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:18,488 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-15 01:54:18,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:18,875 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-15 01:54:18,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938552982] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:18,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:18,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2023-02-15 01:54:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235937859] [2023-02-15 01:54:18,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:18,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 01:54:18,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 01:54:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-02-15 01:54:18,877 INFO L87 Difference]: Start difference. First operand 363 states and 463 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 01:54:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:20,398 INFO L93 Difference]: Finished difference Result 898 states and 1112 transitions. [2023-02-15 01:54:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 01:54:20,399 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 56 [2023-02-15 01:54:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:20,402 INFO L225 Difference]: With dead ends: 898 [2023-02-15 01:54:20,402 INFO L226 Difference]: Without dead ends: 865 [2023-02-15 01:54:20,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=399, Invalid=2463, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 01:54:20,404 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 840 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:20,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 3754 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 01:54:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2023-02-15 01:54:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 380. [2023-02-15 01:54:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 349 states have (on average 1.2521489971346704) internal successors, (437), 350 states have internal predecessors, (437), 11 states have call successors, (11), 4 states have call predecessors, (11), 12 states have return successors, (34), 25 states have call predecessors, (34), 11 states have call successors, (34) [2023-02-15 01:54:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 482 transitions. [2023-02-15 01:54:20,425 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 482 transitions. Word has length 56 [2023-02-15 01:54:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:20,426 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 482 transitions. [2023-02-15 01:54:20,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 01:54:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 482 transitions. [2023-02-15 01:54:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:54:20,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:20,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:20,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:20,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 01:54:20,633 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1913410720, now seen corresponding path program 1 times [2023-02-15 01:54:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:20,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461382721] [2023-02-15 01:54:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:20,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:20,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 01:54:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:54:20,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:20,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461382721] [2023-02-15 01:54:20,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461382721] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:20,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472095929] [2023-02-15 01:54:20,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:20,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:20,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:20,845 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:20,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 01:54:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:20,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 01:54:20,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 01:54:21,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 01:54:21,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472095929] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:21,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:21,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2023-02-15 01:54:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086459822] [2023-02-15 01:54:21,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:21,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 01:54:21,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:21,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 01:54:21,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 01:54:21,497 INFO L87 Difference]: Start difference. First operand 380 states and 482 transitions. Second operand has 36 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 31 states have internal predecessors, (96), 3 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-15 01:54:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:22,611 INFO L93 Difference]: Finished difference Result 884 states and 1127 transitions. [2023-02-15 01:54:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 01:54:22,611 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 31 states have internal predecessors, (96), 3 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) Word has length 56 [2023-02-15 01:54:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:22,614 INFO L225 Difference]: With dead ends: 884 [2023-02-15 01:54:22,614 INFO L226 Difference]: Without dead ends: 745 [2023-02-15 01:54:22,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=384, Invalid=2922, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 01:54:22,615 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 620 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:22,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2375 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:54:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-02-15 01:54:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 415. [2023-02-15 01:54:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 385 states have (on average 1.2311688311688311) internal successors, (474), 381 states have internal predecessors, (474), 9 states have call successors, (9), 4 states have call predecessors, (9), 13 states have return successors, (36), 29 states have call predecessors, (36), 9 states have call successors, (36) [2023-02-15 01:54:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 519 transitions. [2023-02-15 01:54:22,653 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 519 transitions. Word has length 56 [2023-02-15 01:54:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:22,653 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 519 transitions. [2023-02-15 01:54:22,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.6666666666666665) internal successors, (96), 31 states have internal predecessors, (96), 3 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-15 01:54:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 519 transitions. [2023-02-15 01:54:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:54:22,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:22,655 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:22,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:22,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 01:54:22,855 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1701498206, now seen corresponding path program 1 times [2023-02-15 01:54:22,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:22,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108939309] [2023-02-15 01:54:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:54:22,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 01:54:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:54:22,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 01:54:22,912 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 01:54:22,912 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-15 01:54:22,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-15 01:54:22,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-15 01:54:22,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-15 01:54:22,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-15 01:54:22,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-15 01:54:22,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-15 01:54:22,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-15 01:54:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-15 01:54:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-15 01:54:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-15 01:54:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-15 01:54:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-15 01:54:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-15 01:54:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-15 01:54:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-15 01:54:22,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-15 01:54:22,918 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:22,920 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:54:22,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:54:22 BoogieIcfgContainer [2023-02-15 01:54:22,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:54:22,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:54:22,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:54:22,971 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:54:22,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:00" (3/4) ... [2023-02-15 01:54:22,974 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 01:54:22,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:54:22,974 INFO L158 Benchmark]: Toolchain (without parser) took 23560.04ms. Allocated memory was 132.1MB in the beginning and 299.9MB in the end (delta: 167.8MB). Free memory was 96.2MB in the beginning and 130.2MB in the end (delta: -34.0MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. [2023-02-15 01:54:22,974 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:54:22,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.70ms. Allocated memory is still 132.1MB. Free memory was 96.2MB in the beginning and 81.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 01:54:22,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.58ms. Allocated memory is still 132.1MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:54:22,975 INFO L158 Benchmark]: Boogie Preprocessor took 37.49ms. Allocated memory is still 132.1MB. Free memory was 79.7MB in the beginning and 77.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:54:22,976 INFO L158 Benchmark]: RCFGBuilder took 610.22ms. Allocated memory is still 132.1MB. Free memory was 77.4MB in the beginning and 54.2MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-15 01:54:22,976 INFO L158 Benchmark]: TraceAbstraction took 22568.79ms. Allocated memory was 132.1MB in the beginning and 299.9MB in the end (delta: 167.8MB). Free memory was 53.3MB in the beginning and 131.2MB in the end (delta: -77.9MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2023-02-15 01:54:22,976 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 299.9MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:54:22,977 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 132.1MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.70ms. Allocated memory is still 132.1MB. Free memory was 96.2MB in the beginning and 81.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.58ms. Allocated memory is still 132.1MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.49ms. Allocated memory is still 132.1MB. Free memory was 79.7MB in the beginning and 77.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 610.22ms. Allocated memory is still 132.1MB. Free memory was 77.4MB in the beginning and 54.2MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22568.79ms. Allocated memory was 132.1MB in the beginning and 299.9MB in the end (delta: 167.8MB). Free memory was 53.3MB in the beginning and 131.2MB in the end (delta: -77.9MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 299.9MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76, overapproximation of bitwiseAnd at line 108. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-127, eb=-128] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=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=36028797035741185, __retres4=16777217, e=-128, m=16777217, res=16777217] [L253] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=36028797035741185, ea=-127, eb=-128, ma=16777216, mb=16777217, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, tmp=1, zero=0] [L263] sa = tmp VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=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 3 procedures, 124 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 29, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 7217 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7086 mSDsluCounter, 28332 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24558 mSDsCounter, 796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6733 IncrementalHoareTripleChecker+Invalid, 7530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 796 mSolverCounterUnsat, 3774 mSDtfsCounter, 6733 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1408 GetRequests, 957 SyntacticMatches, 13 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2537 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=28, InterpolantAutomatonStates: 338, 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, 28 MinimizatonAttempts, 3907 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1618 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1898 ConstructedInterpolants, 0 QuantifiedInterpolants, 8875 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1562 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 48 InterpolantComputations, 21 PerfectInterpolantSequences, 552/708 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-15 01:54:22,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:54:24,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:54:24,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:54:24,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:54:24,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:54:24,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:54:24,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:54:24,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:54:24,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:54:24,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:54:24,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:54:24,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:54:24,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:54:24,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:54:24,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:54:24,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:54:24,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:54:24,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:54:24,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:54:24,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:54:24,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:54:24,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:54:24,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:54:24,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:54:24,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:54:24,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:54:24,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:54:24,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:54:24,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:54:24,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:54:25,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:54:25,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:54:25,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:54:25,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:54:25,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:54:25,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:54:25,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:54:25,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:54:25,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:54:25,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:54:25,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:54:25,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-15 01:54:25,041 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:54:25,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:54:25,043 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:54:25,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:54:25,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:54:25,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:54:25,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:54:25,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:54:25,044 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:54:25,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:54:25,045 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:54:25,046 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:54:25,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:54:25,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:54:25,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 01:54:25,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:54:25,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 01:54:25,047 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:54:25,047 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 01:54:25,047 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 01:54:25,047 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 01:54:25,047 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:54:25,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 01:54:25,047 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:54:25,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 01:54:25,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:54:25,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:54:25,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:54:25,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:54:25,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:54:25,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:54:25,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 01:54:25,049 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 01:54:25,049 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 01:54:25,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:54:25,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 01:54:25,050 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:54:25,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:54:25,050 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 01:54:25,050 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:54:25,050 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2023-02-15 01:54:25,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:54:25,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:54:25,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:54:25,352 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:54:25,352 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:54:25,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2023-02-15 01:54:26,511 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:54:26,760 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:54:26,762 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2023-02-15 01:54:26,771 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d210e160/6c6535f13b5046319253549deb11ebb4/FLAG94a9531ad [2023-02-15 01:54:26,787 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d210e160/6c6535f13b5046319253549deb11ebb4 [2023-02-15 01:54:26,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:54:26,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:54:26,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:54:26,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:54:26,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:54:26,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:54:26" (1/1) ... [2023-02-15 01:54:26,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d023a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:26, skipping insertion in model container [2023-02-15 01:54:26,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:54:26" (1/1) ... [2023-02-15 01:54:26,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:54:26,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:54:26,946 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2023-02-15 01:54:27,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:54:27,032 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:54:27,044 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2023-02-15 01:54:27,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:54:27,110 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:54:27,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27 WrapperNode [2023-02-15 01:54:27,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:54:27,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:54:27,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:54:27,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:54:27,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,165 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2023-02-15 01:54:27,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:54:27,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:54:27,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:54:27,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:54:27,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,208 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:54:27,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:54:27,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:54:27,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:54:27,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (1/1) ... [2023-02-15 01:54:27,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:54:27,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:27,246 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-15 01:54:27,266 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-15 01:54:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:54:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 01:54:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 01:54:27,282 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 01:54:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:54:27,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:54:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 01:54:27,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 01:54:27,361 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:54:27,362 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:54:27,735 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:54:27,741 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:54:27,741 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 01:54:27,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:27 BoogieIcfgContainer [2023-02-15 01:54:27,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:54:27,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:54:27,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:54:27,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:54:27,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:54:26" (1/3) ... [2023-02-15 01:54:27,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18176808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:54:27, skipping insertion in model container [2023-02-15 01:54:27,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:27" (2/3) ... [2023-02-15 01:54:27,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18176808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:54:27, skipping insertion in model container [2023-02-15 01:54:27,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:27" (3/3) ... [2023-02-15 01:54:27,750 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2023-02-15 01:54:27,765 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:54:27,765 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 01:54:27,820 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:54:27,825 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;@63a8da9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:54:27,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 01:54:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 92 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:54:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:54:27,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:27,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:27,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:27,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:27,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1558059187, now seen corresponding path program 1 times [2023-02-15 01:54:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:27,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726581335] [2023-02-15 01:54:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:27,853 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-15 01:54:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:27,856 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-15 01:54:27,857 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-15 01:54:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:27,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 01:54:27,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:27,965 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-15 01:54:27,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:27,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:27,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726581335] [2023-02-15 01:54:27,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726581335] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:27,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:27,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 01:54:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141344627] [2023-02-15 01:54:27,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:27,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:54:27,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:27,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:54:27,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:54:27,997 INFO L87 Difference]: Start difference. First operand has 102 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 92 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:54:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:28,025 INFO L93 Difference]: Finished difference Result 192 states and 289 transitions. [2023-02-15 01:54:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:54:28,027 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-15 01:54:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:28,033 INFO L225 Difference]: With dead ends: 192 [2023-02-15 01:54:28,033 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 01:54:28,036 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-15 01:54:28,038 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:28,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 01:54:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-15 01:54:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.36) internal successors, (68), 56 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2023-02-15 01:54:28,083 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 9 [2023-02-15 01:54:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:28,084 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2023-02-15 01:54:28,085 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-15 01:54:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2023-02-15 01:54:28,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:54:28,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:28,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:28,101 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-15 01:54:28,304 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-15 01:54:28,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:28,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1559000453, now seen corresponding path program 1 times [2023-02-15 01:54:28,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:28,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410987795] [2023-02-15 01:54:28,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:28,307 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-15 01:54:28,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:28,309 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-15 01:54:28,310 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-15 01:54:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:28,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:54:28,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:28,409 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-15 01:54:28,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:28,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:28,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410987795] [2023-02-15 01:54:28,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410987795] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:28,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:28,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457552684] [2023-02-15 01:54:28,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:28,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:28,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:28,413 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-15 01:54:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:28,459 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2023-02-15 01:54:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:54:28,459 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-15 01:54:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:28,462 INFO L225 Difference]: With dead ends: 135 [2023-02-15 01:54:28,462 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 01:54:28,463 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-15 01:54:28,464 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-15 01:54:28,464 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-15 01:54:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 01:54:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-15 01:54:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 60 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2023-02-15 01:54:28,474 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 9 [2023-02-15 01:54:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:28,474 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2023-02-15 01:54:28,474 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-15 01:54:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2023-02-15 01:54:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:54:28,475 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:28,475 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:28,485 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-15 01:54:28,682 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-15 01:54:28,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1313459023, now seen corresponding path program 1 times [2023-02-15 01:54:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:28,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604192800] [2023-02-15 01:54:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:28,685 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-15 01:54:28,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:28,686 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-15 01:54:28,688 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-15 01:54:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:28,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:54:28,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:28,737 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-15 01:54:28,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:28,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:28,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604192800] [2023-02-15 01:54:28,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604192800] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:28,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:28,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:54:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184652541] [2023-02-15 01:54:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:28,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:54:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:28,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:54:28,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:54:28,740 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-15 01:54:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:28,796 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2023-02-15 01:54:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:54:28,797 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-15 01:54:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:28,799 INFO L225 Difference]: With dead ends: 73 [2023-02-15 01:54:28,801 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 01:54:28,802 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-15 01:54:28,802 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-15 01:54:28,803 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-15 01:54:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 01:54:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-02-15 01:54:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 59 states have internal predecessors, (71), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2023-02-15 01:54:28,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 16 [2023-02-15 01:54:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:28,818 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2023-02-15 01:54:28,818 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-15 01:54:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2023-02-15 01:54:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 01:54:28,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:28,820 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:28,840 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-15 01:54:29,021 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-15 01:54:29,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1373713817, now seen corresponding path program 1 times [2023-02-15 01:54:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:29,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41437989] [2023-02-15 01:54:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:29,027 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-15 01:54:29,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:29,031 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-15 01:54:29,033 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-15 01:54:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:29,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:54:29,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:29,112 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-15 01:54:29,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:29,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:29,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41437989] [2023-02-15 01:54:29,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41437989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:29,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:29,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:54:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856228655] [2023-02-15 01:54:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:29,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:54:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:54:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:54:29,120 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-15 01:54:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:29,167 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2023-02-15 01:54:29,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:54:29,168 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-15 01:54:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:29,170 INFO L225 Difference]: With dead ends: 72 [2023-02-15 01:54:29,170 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 01:54:29,170 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-15 01:54:29,171 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-15 01:54:29,174 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-15 01:54:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 01:54:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-02-15 01:54:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 58 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2023-02-15 01:54:29,184 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2023-02-15 01:54:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:29,185 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2023-02-15 01:54:29,185 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-15 01:54:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2023-02-15 01:54:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 01:54:29,186 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:29,186 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:29,195 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-15 01:54:29,394 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-15 01:54:29,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1373781343, now seen corresponding path program 1 times [2023-02-15 01:54:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:29,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464894059] [2023-02-15 01:54:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:29,402 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-15 01:54:29,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:29,403 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-15 01:54:29,409 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-15 01:54:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:29,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:54:29,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:29,567 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-15 01:54:29,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:29,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:29,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464894059] [2023-02-15 01:54:29,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464894059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:29,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:29,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:54:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236345833] [2023-02-15 01:54:29,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:29,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:29,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:29,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:29,575 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-15 01:54:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:29,886 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2023-02-15 01:54:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:29,886 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-15 01:54:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:29,887 INFO L225 Difference]: With dead ends: 84 [2023-02-15 01:54:29,887 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 01:54:29,887 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-15 01:54:29,888 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 55 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:29,888 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.3s Time] [2023-02-15 01:54:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 01:54:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2023-02-15 01:54:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 63 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2023-02-15 01:54:29,895 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 18 [2023-02-15 01:54:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:29,895 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2023-02-15 01:54:29,896 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-15 01:54:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2023-02-15 01:54:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:54:29,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:29,897 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-15 01:54:29,905 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 (6)] Ended with exit code 0 [2023-02-15 01:54:30,105 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-15 01:54:30,106 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:30,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash -581634771, now seen corresponding path program 1 times [2023-02-15 01:54:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:30,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303995980] [2023-02-15 01:54:30,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:30,106 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-15 01:54:30,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:30,109 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-15 01:54:30,111 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-15 01:54:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:30,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:54:30,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:30,791 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-15 01:54:30,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:30,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:30,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303995980] [2023-02-15 01:54:30,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303995980] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:30,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:30,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:54:30,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468486669] [2023-02-15 01:54:30,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:30,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:54:30,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:30,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:54:30,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:54:30,793 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-15 01:54:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:32,728 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2023-02-15 01:54:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:54:32,728 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-15 01:54:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:32,729 INFO L225 Difference]: With dead ends: 89 [2023-02-15 01:54:32,729 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 01:54:32,730 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-15 01:54:32,730 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:32,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 01:54:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 01:54:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2023-02-15 01:54:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 57 states have internal predecessors, (69), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-02-15 01:54:32,738 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 21 [2023-02-15 01:54:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:32,738 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-02-15 01:54:32,738 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-15 01:54:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2023-02-15 01:54:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 01:54:32,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:32,739 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:32,748 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-15 01:54:32,946 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-15 01:54:32,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -998317733, now seen corresponding path program 1 times [2023-02-15 01:54:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:32,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111923393] [2023-02-15 01:54:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:32,947 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-15 01:54:32,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:32,948 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-15 01:54:32,951 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-15 01:54:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:32,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:54:33,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 01:54:33,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 01:54:33,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:33,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111923393] [2023-02-15 01:54:33,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111923393] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:33,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:54:33,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-15 01:54:33,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270426993] [2023-02-15 01:54:33,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:33,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:54:33,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:33,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:54:33,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:54:33,091 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:54:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:33,133 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2023-02-15 01:54:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:33,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-02-15 01:54:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:33,134 INFO L225 Difference]: With dead ends: 102 [2023-02-15 01:54:33,134 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 01:54:33,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:54:33,135 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 33 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:33,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 292 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 01:54:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-02-15 01:54:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 57 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2023-02-15 01:54:33,141 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 38 [2023-02-15 01:54:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:33,142 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2023-02-15 01:54:33,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:54:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2023-02-15 01:54:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 01:54:33,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:33,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:33,152 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-15 01:54:33,350 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-15 01:54:33,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1701001285, now seen corresponding path program 1 times [2023-02-15 01:54:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:33,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154186057] [2023-02-15 01:54:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:33,352 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-15 01:54:33,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:33,353 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-15 01:54:33,356 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-15 01:54:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:33,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:54:33,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:33,426 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-15 01:54:33,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:33,458 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-15 01:54:33,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154186057] [2023-02-15 01:54:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154186057] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:33,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:54:33,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-15 01:54:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516560980] [2023-02-15 01:54:33,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:33,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:54:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:33,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:54:33,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:54:33,461 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:54:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:33,497 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2023-02-15 01:54:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2023-02-15 01:54:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:33,498 INFO L225 Difference]: With dead ends: 137 [2023-02-15 01:54:33,498 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 01:54:33,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:54:33,499 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 31 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:33,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 481 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 01:54:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2023-02-15 01:54:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 63 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 01:54:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2023-02-15 01:54:33,507 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 42 [2023-02-15 01:54:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:33,507 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2023-02-15 01:54:33,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:54:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2023-02-15 01:54:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 01:54:33,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:33,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:33,523 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-15 01:54:33,716 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-15 01:54:33,717 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 599821305, now seen corresponding path program 1 times [2023-02-15 01:54:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:33,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236902463] [2023-02-15 01:54:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:33,718 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-15 01:54:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:33,719 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-15 01:54:33,761 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-15 01:54:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:33,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:54:33,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:33,826 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-15 01:54:33,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:33,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:33,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236902463] [2023-02-15 01:54:33,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236902463] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:33,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:33,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:54:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620380969] [2023-02-15 01:54:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:33,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:54:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:54:33,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:54:33,830 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:54:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:33,876 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2023-02-15 01:54:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-02-15 01:54:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:33,877 INFO L225 Difference]: With dead ends: 140 [2023-02-15 01:54:33,877 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 01:54:33,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:54:33,878 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 28 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:33,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 351 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 01:54:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2023-02-15 01:54:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 70 states have internal predecessors, (83), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 01:54:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2023-02-15 01:54:33,886 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 42 [2023-02-15 01:54:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:33,886 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2023-02-15 01:54:33,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:54:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2023-02-15 01:54:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 01:54:33,887 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:33,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:33,896 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-15 01:54:34,094 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-15 01:54:34,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash -680042373, now seen corresponding path program 1 times [2023-02-15 01:54:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:34,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838147906] [2023-02-15 01:54:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:34,096 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-15 01:54:34,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:34,097 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-15 01:54:34,099 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-15 01:54:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:34,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 01:54:34,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:34,186 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-15 01:54:34,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:34,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:34,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838147906] [2023-02-15 01:54:34,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838147906] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:34,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:34,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:54:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297053486] [2023-02-15 01:54:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:34,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:54:34,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:54:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:54:34,189 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:54:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:34,246 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2023-02-15 01:54:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:54:34,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-02-15 01:54:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:34,248 INFO L225 Difference]: With dead ends: 115 [2023-02-15 01:54:34,248 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 01:54:34,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:54:34,249 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:34,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 399 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 01:54:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-15 01:54:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 63 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 01:54:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2023-02-15 01:54:34,255 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 42 [2023-02-15 01:54:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:34,256 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2023-02-15 01:54:34,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:54:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2023-02-15 01:54:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:54:34,257 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:34,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:34,264 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-15 01:54:34,464 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-15 01:54:34,464 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1554538856, now seen corresponding path program 1 times [2023-02-15 01:54:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:34,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531457522] [2023-02-15 01:54:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:34,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:54:34,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:34,467 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-15 01:54:34,472 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-15 01:54:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:34,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:54:34,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:34,578 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-15 01:54:34,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:34,624 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-15 01:54:34,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:34,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531457522] [2023-02-15 01:54:34,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531457522] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:34,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:54:34,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-15 01:54:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646667218] [2023-02-15 01:54:34,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:34,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:54:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:54:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:54:34,627 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:54:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:34,702 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2023-02-15 01:54:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:54:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2023-02-15 01:54:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:34,703 INFO L225 Difference]: With dead ends: 109 [2023-02-15 01:54:34,703 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 01:54:34,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:54:34,704 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:34,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 527 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 01:54:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-15 01:54:34,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 57 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2023-02-15 01:54:34,715 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 46 [2023-02-15 01:54:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:34,715 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2023-02-15 01:54:34,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:54:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2023-02-15 01:54:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 01:54:34,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:34,716 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:34,741 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-15 01:54:34,925 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-15 01:54:34,926 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1609276837, now seen corresponding path program 1 times [2023-02-15 01:54:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:34,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930587910] [2023-02-15 01:54:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:34,927 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-15 01:54:34,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:34,941 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-15 01:54:34,942 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-15 01:54:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:34,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 01:54:34,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:35,094 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-15 01:54:35,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:35,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:35,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930587910] [2023-02-15 01:54:35,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930587910] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:35,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:35,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 01:54:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755276619] [2023-02-15 01:54:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:35,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:54:35,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:54:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:54:35,097 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:54:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:35,231 INFO L93 Difference]: Finished difference Result 163 states and 190 transitions. [2023-02-15 01:54:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:54:35,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2023-02-15 01:54:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:35,233 INFO L225 Difference]: With dead ends: 163 [2023-02-15 01:54:35,233 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 01:54:35,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:54:35,234 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 103 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:35,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 579 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 01:54:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2023-02-15 01:54:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.196969696969697) internal successors, (79), 69 states have internal predecessors, (79), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 01:54:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2023-02-15 01:54:35,242 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 50 [2023-02-15 01:54:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:35,242 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2023-02-15 01:54:35,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:54:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2023-02-15 01:54:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 01:54:35,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:35,243 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:35,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-02-15 01:54:35,450 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-15 01:54:35,451 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1351111399, now seen corresponding path program 1 times [2023-02-15 01:54:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:35,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981757566] [2023-02-15 01:54:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:35,452 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-15 01:54:35,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:35,455 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-15 01:54:35,456 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-15 01:54:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:35,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 01:54:35,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:35,633 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-15 01:54:35,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:35,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:35,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981757566] [2023-02-15 01:54:35,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981757566] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:35,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:35,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:54:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640755447] [2023-02-15 01:54:35,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:35,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:54:35,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:54:35,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:54:35,635 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:54:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:35,896 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2023-02-15 01:54:35,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:54:35,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2023-02-15 01:54:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:35,897 INFO L225 Difference]: With dead ends: 144 [2023-02-15 01:54:35,898 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 01:54:35,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:54:35,898 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 79 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:35,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 799 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:54:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 01:54:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2023-02-15 01:54:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 61 states have internal predecessors, (68), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-15 01:54:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2023-02-15 01:54:35,905 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 50 [2023-02-15 01:54:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:35,905 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2023-02-15 01:54:35,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:54:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2023-02-15 01:54:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 01:54:35,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:35,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:35,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:36,113 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-15 01:54:36,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash -181865359, now seen corresponding path program 1 times [2023-02-15 01:54:36,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:36,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009155444] [2023-02-15 01:54:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:36,114 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-15 01:54:36,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:36,121 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-15 01:54:36,153 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-15 01:54:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:36,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 01:54:36,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:36,222 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-15 01:54:36,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:36,371 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-15 01:54:36,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:36,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009155444] [2023-02-15 01:54:36,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009155444] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:36,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:54:36,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-02-15 01:54:36,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560503647] [2023-02-15 01:54:36,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:36,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:36,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:54:36,372 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 01:54:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:36,442 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-02-15 01:54:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:54:36,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2023-02-15 01:54:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:36,443 INFO L225 Difference]: With dead ends: 72 [2023-02-15 01:54:36,443 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 01:54:36,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:54:36,444 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:36,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 01:54:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-02-15 01:54:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 60 states have internal predecessors, (67), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-15 01:54:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2023-02-15 01:54:36,452 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 52 [2023-02-15 01:54:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:36,453 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2023-02-15 01:54:36,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 01:54:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2023-02-15 01:54:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 01:54:36,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:36,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:36,464 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-15 01:54:36,662 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-15 01:54:36,663 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1342858669, now seen corresponding path program 1 times [2023-02-15 01:54:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:36,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880855510] [2023-02-15 01:54:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:36,664 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-15 01:54:36,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:36,674 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-15 01:54:36,675 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-15 01:54:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:36,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 01:54:36,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:36,759 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-15 01:54:36,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:36,907 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-15 01:54:36,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:36,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880855510] [2023-02-15 01:54:36,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880855510] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:36,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:54:36,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-02-15 01:54:36,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864619359] [2023-02-15 01:54:36,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:36,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:36,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:36,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:54:36,910 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:54:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:36,998 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2023-02-15 01:54:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:36,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2023-02-15 01:54:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:36,999 INFO L225 Difference]: With dead ends: 76 [2023-02-15 01:54:36,999 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 01:54:36,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:54:37,000 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:37,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 166 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 01:54:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2023-02-15 01:54:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-15 01:54:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2023-02-15 01:54:37,005 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 53 [2023-02-15 01:54:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:37,006 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2023-02-15 01:54:37,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:54:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2023-02-15 01:54:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 01:54:37,006 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:37,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:37,032 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 (16)] Ended with exit code 0 [2023-02-15 01:54:37,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:54:37,218 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2145100703, now seen corresponding path program 1 times [2023-02-15 01:54:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:37,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531172691] [2023-02-15 01:54:37,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:37,219 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-15 01:54:37,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:37,221 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:54:37,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 01:54:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:37,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 01:54:37,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:37,389 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-15 01:54:37,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:37,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:37,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531172691] [2023-02-15 01:54:37,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531172691] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:37,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701865957] [2023-02-15 01:54:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:37,569 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:54:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:54:37,571 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 01:54:37,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-15 01:54:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:37,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 01:54:37,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:37,653 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-15 01:54:37,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:37,697 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-15 01:54:37,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [701865957] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:37,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:37,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 13 [2023-02-15 01:54:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294554627] [2023-02-15 01:54:37,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:37,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:54:37,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:37,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:54:37,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-02-15 01:54:37,699 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 01:54:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:38,030 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2023-02-15 01:54:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:54:38,030 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 64 [2023-02-15 01:54:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:38,031 INFO L225 Difference]: With dead ends: 128 [2023-02-15 01:54:38,031 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 01:54:38,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2023-02-15 01:54:38,032 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 54 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:38,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 913 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:54:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 01:54:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2023-02-15 01:54:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.139240506329114) internal successors, (90), 80 states have internal predecessors, (90), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-15 01:54:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2023-02-15 01:54:38,037 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 64 [2023-02-15 01:54:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:38,038 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2023-02-15 01:54:38,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 01:54:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2023-02-15 01:54:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 01:54:38,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:38,038 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:38,065 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 (17)] Ended with exit code 0 [2023-02-15 01:54:38,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:38,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 01:54:38,448 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:38,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2017228173, now seen corresponding path program 2 times [2023-02-15 01:54:38,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:38,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100667733] [2023-02-15 01:54:38,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:54:38,449 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-15 01:54:38,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:38,451 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-15 01:54:38,453 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-15 01:54:38,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 01:54:38,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:54:38,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:54:38,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 01:54:38,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:38,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:38,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100667733] [2023-02-15 01:54:38,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100667733] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:38,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:38,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 01:54:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183810204] [2023-02-15 01:54:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:38,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:54:38,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:54:38,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:54:38,558 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 01:54:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:38,751 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2023-02-15 01:54:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:54:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2023-02-15 01:54:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:38,752 INFO L225 Difference]: With dead ends: 149 [2023-02-15 01:54:38,752 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 01:54:38,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:54:38,753 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:38,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 521 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 01:54:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-15 01:54:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.139240506329114) internal successors, (90), 80 states have internal predecessors, (90), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-15 01:54:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2023-02-15 01:54:38,760 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 64 [2023-02-15 01:54:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:38,760 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2023-02-15 01:54:38,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 01:54:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2023-02-15 01:54:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 01:54:38,761 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:38,761 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:38,771 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-15 01:54:38,961 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-15 01:54:38,962 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -353543927, now seen corresponding path program 1 times [2023-02-15 01:54:38,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:38,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127265197] [2023-02-15 01:54:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:38,963 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-15 01:54:38,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:38,964 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-15 01:54:38,967 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-15 01:54:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:39,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:54:39,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:39,069 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-15 01:54:39,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:39,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127265197] [2023-02-15 01:54:39,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127265197] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:39,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:39,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:54:39,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680515941] [2023-02-15 01:54:39,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:39,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:54:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:39,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:54:39,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:54:39,071 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 01:54:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:39,098 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2023-02-15 01:54:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:54:39,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2023-02-15 01:54:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:39,099 INFO L225 Difference]: With dead ends: 99 [2023-02-15 01:54:39,100 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 01:54:39,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:54:39,100 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:39,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:54:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 01:54:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2023-02-15 01:54:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 66 states have internal predecessors, (75), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 01:54:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2023-02-15 01:54:39,115 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 66 [2023-02-15 01:54:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:39,115 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2023-02-15 01:54:39,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 01:54:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2023-02-15 01:54:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 01:54:39,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:39,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:39,137 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-15 01:54:39,323 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-15 01:54:39,323 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1874504783, now seen corresponding path program 1 times [2023-02-15 01:54:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:39,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291296396] [2023-02-15 01:54:39,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:39,324 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-15 01:54:39,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:39,337 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-15 01:54:39,340 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-15 01:54:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:39,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 01:54:39,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:39,446 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-15 01:54:39,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:39,539 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-15 01:54:39,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:39,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291296396] [2023-02-15 01:54:39,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291296396] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:39,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:54:39,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-15 01:54:39,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525154278] [2023-02-15 01:54:39,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:39,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:54:39,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:39,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:54:39,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:54:39,542 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 01:54:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:39,649 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2023-02-15 01:54:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:54:39,650 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 72 [2023-02-15 01:54:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:39,651 INFO L225 Difference]: With dead ends: 102 [2023-02-15 01:54:39,651 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 01:54:39,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:54:39,651 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:39,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 544 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:54:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 01:54:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-15 01:54:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:54:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-02-15 01:54:39,656 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 72 [2023-02-15 01:54:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:39,656 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-02-15 01:54:39,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 01:54:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-02-15 01:54:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 01:54:39,657 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:39,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:39,664 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-15 01:54:39,864 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-15 01:54:39,864 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 01:54:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash 281509725, now seen corresponding path program 1 times [2023-02-15 01:54:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:54:39,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140222671] [2023-02-15 01:54:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:39,865 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-15 01:54:39,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:54:39,867 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-15 01:54:39,869 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-15 01:54:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:39,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:54:39,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:39,998 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-15 01:54:39,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:54:39,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:54:39,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140222671] [2023-02-15 01:54:39,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140222671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:39,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:39,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:54:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572915912] [2023-02-15 01:54:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:39,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:39,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:54:40,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:40,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:40,000 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:54:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:40,336 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-02-15 01:54:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:40,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2023-02-15 01:54:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:40,337 INFO L225 Difference]: With dead ends: 64 [2023-02-15 01:54:40,337 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 01:54:40,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-15 01:54:40,339 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:40,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:54:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 01:54:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 01:54:40,354 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-15 01:54:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 01:54:40,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2023-02-15 01:54:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:40,355 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 01:54:40,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 01:54:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 01:54:40,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 01:54:40,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-15 01:54:40,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-15 01:54:40,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-15 01:54:40,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-15 01:54:40,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-15 01:54:40,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-15 01:54:40,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-15 01:54:40,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-15 01:54:40,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-15 01:54:40,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-15 01:54:40,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-15 01:54:40,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-15 01:54:40,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-15 01:54:40,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-15 01:54:40,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-15 01:54:40,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-15 01:54:40,376 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-15 01:54:40,574 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-15 01:54:40,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 01:54:43,259 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-15 01:54:43,259 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-15 01:54:43,259 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-15 01:54:43,259 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-02-15 01:54:43,259 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_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (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|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 01:54:43,260 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_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (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|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-15 01:54:43,260 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_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (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|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) (and (= base2flt_~m (_ bv0 32)) (= base2flt_~__retres4~0 (_ bv0 32))) .cse0))) [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-15 01:54:43,260 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-15 01:54:43,260 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-15 01:54:43,261 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_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (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|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L258-2(lines 258 262) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 112) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 137) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L895 garLoopResultBuilder]: At program point L126-2(lines 126 137) the Hoare annotation is: (let ((.cse0 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) |ULTIMATE.start_addflt_~ea~0#1|) (bvneg ((_ sign_extend 1) |ULTIMATE.start_addflt_~eb~0#1|))))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|))) (or (and .cse0 .cse1 (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)) (bvadd (_ bv127 32) |ULTIMATE.start_addflt_~ea~0#1|)))) (and (= (bvadd |ULTIMATE.start_addflt_~a#1| (_ bv1 32)) (_ bv0 32)) (bvult (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv4294967169 32)) (_ bv32 32)) (= (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (_ bv0 32)) .cse0 .cse1) (and (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)) (bvadd (_ bv128 32) |ULTIMATE.start_addflt_~ea~0#1|))) .cse0 .cse1))) [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 287) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L283-2(lines 283 287) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L899 garLoopResultBuilder]: For program point L333-2(lines 333 337) no Hoare annotation was computed. [2023-02-15 01:54:43,261 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 225 356) the Hoare annotation is: true [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 132) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 100) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L94-2(lines 93 146) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L317-1(lines 315 349) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L902 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: true [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L251-1(line 251) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L902 garLoopResultBuilder]: At program point L144(lines 93 146) the Hoare annotation is: true [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 272) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L268-2(lines 268 272) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L902 garLoopResultBuilder]: At program point L293-1(lines 293 302) the Hoare annotation is: true [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2023-02-15 01:54:43,262 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2023-02-15 01:54:43,262 INFO L899 garLoopResultBuilder]: For program point L252-1(line 252) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L112-1(line 112) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L895 garLoopResultBuilder]: At program point L253(line 253) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L253-1(line 253) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 311) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L278-1(lines 249 355) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L902 garLoopResultBuilder]: At program point addflt_returnLabel#1(lines 83 147) the Hoare annotation is: true [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 324) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L320-2(lines 320 324) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L279(lines 279 308) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L895 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (and (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)) (bvadd (_ bv128 32) |ULTIMATE.start_addflt_~ea~0#1|))) (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) (bvsle (bvadd ((_ sign_extend 1) |ULTIMATE.start_addflt_~ea~0#1|) (bvneg ((_ sign_extend 1) |ULTIMATE.start_addflt_~eb~0#1|))) (_ bv2147483647 33))) [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L114-1(line 114) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 300) no Hoare annotation was computed. [2023-02-15 01:54:43,263 INFO L899 garLoopResultBuilder]: For program point L296-2(lines 296 300) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 264) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L255-2(lines 249 355) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 115) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L280(lines 280 289) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L902 garLoopResultBuilder]: At program point L280-2(lines 280 289) the Hoare annotation is: true [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 339) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L330-2(lines 329 345) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 115) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L895 garLoopResultBuilder]: At program point L116(line 116) the Hoare annotation is: (let ((.cse0 (bvadd ((_ sign_extend 1) |ULTIMATE.start_addflt_~ea~0#1|) (bvneg ((_ sign_extend 1) |ULTIMATE.start_addflt_~eb~0#1|))))) (and (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)) (bvadd (_ bv128 32) |ULTIMATE.start_addflt_~ea~0#1|))) (bvsle (_ bv6442450944 33) .cse0) (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) (bvsle .cse0 (_ bv2147483647 33)))) [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L116-1(line 116) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2023-02-15 01:54:43,264 INFO L899 garLoopResultBuilder]: For program point L141-1(line 141) no Hoare annotation was computed. [2023-02-15 01:54:43,272 INFO L899 garLoopResultBuilder]: For program point L265-1(lines 265 274) no Hoare annotation was computed. [2023-02-15 01:54:43,272 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2023-02-15 01:54:43,272 INFO L899 garLoopResultBuilder]: For program point L133-1(line 133) no Hoare annotation was computed. [2023-02-15 01:54:43,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 112) no Hoare annotation was computed. [2023-02-15 01:54:43,272 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 351) no Hoare annotation was computed. [2023-02-15 01:54:43,272 INFO L899 garLoopResultBuilder]: For program point L315-1(lines 315 351) no Hoare annotation was computed. [2023-02-15 01:54:43,272 INFO L902 garLoopResultBuilder]: At program point L340-1(lines 327 345) the Hoare annotation is: true [2023-02-15 01:54:43,272 INFO L902 garLoopResultBuilder]: At program point $Ultimate##48(lines 317 326) the Hoare annotation is: true [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point L291(lines 279 306) no Hoare annotation was computed. [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-15 01:54:43,273 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-15 01:54:43,274 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-15 01:54:43,278 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:43,285 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:54:43,305 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-15 01:54:43,321 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-15 01:54:43,322 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-15 01:54:43,326 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-15 01:54:43,326 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-15 01:54:43,326 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-15 01:54:43,327 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-15 01:54:43,328 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-15 01:54:43,328 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-15 01:54:43,329 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-15 01:54:43,329 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-15 01:54:43,329 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-15 01:54:43,334 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-15 01:54:43,335 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-15 01:54:43,335 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-15 01:54:43,335 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-15 01:54:43,335 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-15 01:54:43,336 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-15 01:54:43,337 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-15 01:54:43,337 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-15 01:54:43,338 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-15 01:54:43,338 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-15 01:54:43,338 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-15 01:54:43,338 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-15 01:54:43,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:54:43 BoogieIcfgContainer [2023-02-15 01:54:43,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:54:43,340 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:54:43,340 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:54:43,340 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:54:43,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:27" (3/4) ... [2023-02-15 01:54:43,343 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 01:54:43,348 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-15 01:54:43,355 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 01:54:43,369 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-02-15 01:54:43,369 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-15 01:54:43,369 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 01:54:43,370 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 01:54:43,389 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && ((!(\old(m) == 0bv32) || (m == 0bv32 && __retres4 == 0bv32)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 01:54:43,389 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 01:54:43,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 01:54:43,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 01:54:43,419 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 01:54:43,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:54:43,420 INFO L158 Benchmark]: Toolchain (without parser) took 16627.46ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 83.6MB in the beginning and 74.7MB in the end (delta: 8.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-02-15 01:54:43,420 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 47.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:54:43,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.88ms. Allocated memory is still 107.0MB. Free memory was 83.3MB in the beginning and 68.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 01:54:43,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.46ms. Allocated memory is still 107.0MB. Free memory was 68.2MB in the beginning and 66.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:54:43,421 INFO L158 Benchmark]: Boogie Preprocessor took 49.81ms. Allocated memory is still 107.0MB. Free memory was 66.2MB in the beginning and 64.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:54:43,422 INFO L158 Benchmark]: RCFGBuilder took 526.54ms. Allocated memory is still 107.0MB. Free memory was 64.3MB in the beginning and 73.7MB in the end (delta: -9.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-02-15 01:54:43,422 INFO L158 Benchmark]: TraceAbstraction took 15594.45ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 73.3MB in the beginning and 80.0MB in the end (delta: -6.7MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2023-02-15 01:54:43,423 INFO L158 Benchmark]: Witness Printer took 79.41ms. Allocated memory is still 146.8MB. Free memory was 80.0MB in the beginning and 74.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-15 01:54:43,427 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 73.4MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 47.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.88ms. Allocated memory is still 107.0MB. Free memory was 83.3MB in the beginning and 68.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.46ms. Allocated memory is still 107.0MB. Free memory was 68.2MB in the beginning and 66.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.81ms. Allocated memory is still 107.0MB. Free memory was 66.2MB in the beginning and 64.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 526.54ms. Allocated memory is still 107.0MB. Free memory was 64.3MB in the beginning and 73.7MB in the end (delta: -9.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15594.45ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 73.3MB in the beginning and 80.0MB in the end (delta: -6.7MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. * Witness Printer took 79.41ms. Allocated memory is still 146.8MB. Free memory was 80.0MB in the beginning and 74.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 102 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 7042 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5498 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1453 IncrementalHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1544 mSDtfsCounter, 1453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1302 GetRequests, 1167 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 210 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 110 PreInvPairs, 153 NumberOfFragments, 235 HoareAnnotationTreeSize, 110 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 9014 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 910 NumberOfCodeBlocks, 883 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1249 ConstructedInterpolants, 47 QuantifiedInterpolants, 2713 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1689 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 399/444 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-15 01:54:43,450 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-15 01:54:43,450 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-15 01:54:43,451 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-15 01:54:43,451 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-15 01:54:43,452 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-15 01:54:43,452 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: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 28]: Loop Invariant [2023-02-15 01:54:43,454 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-15 01:54:43,454 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-15 01:54:43,454 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-15 01:54:43,454 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-15 01:54:43,454 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-15 01:54:43,455 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: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && ((!(\old(m) == 0bv32) || (m == 0bv32 && __retres4 == 0bv32)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant [2023-02-15 01:54:43,456 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-15 01:54:43,456 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-15 01:54:43,457 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-15 01:54:43,457 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-15 01:54:43,457 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-15 01:54:43,457 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: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 57]: Loop Invariant [2023-02-15 01:54:43,459 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-15 01:54:43,459 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-15 01:54:43,459 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-15 01:54:43,460 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-15 01:54:43,460 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-15 01:54:43,460 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: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-15 01:54:43,478 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