./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:03:07,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:03:07,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:03:08,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:03:08,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:03:08,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:03:08,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:03:08,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:03:08,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:03:08,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:03:08,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:03:08,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:03:08,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:03:08,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:03:08,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:03:08,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:03:08,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:03:08,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:03:08,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:03:08,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:03:08,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:03:08,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:03:08,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:03:08,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:03:08,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:03:08,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:03:08,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:03:08,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:03:08,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:03:08,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:03:08,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:03:08,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:03:08,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:03:08,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:03:08,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:03:08,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:03:08,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:03:08,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:03:08,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:03:08,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:03:08,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:03:08,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-16 04:03:08,071 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:03:08,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:03:08,072 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:03:08,072 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:03:08,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:03:08,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:03:08,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:03:08,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:03:08,073 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:03:08,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:03:08,074 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:03:08,074 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:03:08,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 04:03:08,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:03:08,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:03:08,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:03:08,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:03:08,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:03:08,075 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:03:08,076 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:03:08,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:03:08,076 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:03:08,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:03:08,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:03:08,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:03:08,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:03:08,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:08,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:03:08,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:03:08,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:03:08,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 04:03:08,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 04:03:08,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:03:08,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:03:08,078 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:03:08,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:03:08,079 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:03:08,079 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2023-02-16 04:03:08,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:03:08,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:03:08,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:03:08,302 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:03:08,303 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:03:08,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2023-02-16 04:03:09,280 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:03:09,468 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:03:09,468 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2023-02-16 04:03:09,474 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9592c2d04/3893e2485a634e979bbce56be716731a/FLAG05c5f2fcf [2023-02-16 04:03:09,489 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9592c2d04/3893e2485a634e979bbce56be716731a [2023-02-16 04:03:09,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:03:09,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:03:09,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:09,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:03:09,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:03:09,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1dfded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09, skipping insertion in model container [2023-02-16 04:03:09,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:03:09,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:03:09,648 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-2a.c.cil.c[755,768] [2023-02-16 04:03:09,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:09,721 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:03:09,731 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-2a.c.cil.c[755,768] [2023-02-16 04:03:09,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:09,776 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:03:09,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09 WrapperNode [2023-02-16 04:03:09,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:09,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:09,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:03:09,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:03:09,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,821 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 212 [2023-02-16 04:03:09,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:09,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:03:09,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:03:09,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:03:09,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,858 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:03:09,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:03:09,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:03:09,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:03:09,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (1/1) ... [2023-02-16 04:03:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:09,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:09,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 04:03:09,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 04:03:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:03:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 04:03:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-16 04:03:09,929 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-16 04:03:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:03:09,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:03:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 04:03:09,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 04:03:10,004 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:03:10,006 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:03:10,409 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:03:10,416 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:03:10,417 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:03:10,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:10 BoogieIcfgContainer [2023-02-16 04:03:10,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:03:10,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:03:10,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:03:10,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:03:10,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:03:09" (1/3) ... [2023-02-16 04:03:10,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5e07ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:10, skipping insertion in model container [2023-02-16 04:03:10,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:09" (2/3) ... [2023-02-16 04:03:10,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5e07ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:10, skipping insertion in model container [2023-02-16 04:03:10,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:10" (3/3) ... [2023-02-16 04:03:10,425 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2023-02-16 04:03:10,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:03:10,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-16 04:03:10,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:03:10,480 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;@1686ba04, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:03:10,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-16 04:03:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 97 states have (on average 1.690721649484536) internal successors, (164), 115 states have internal predecessors, (164), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-16 04:03:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:10,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:10,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:10,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1082296898, now seen corresponding path program 1 times [2023-02-16 04:03:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696576090] [2023-02-16 04:03:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:10,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696576090] [2023-02-16 04:03:10,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696576090] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:10,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:10,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042514934] [2023-02-16 04:03:10,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:10,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:10,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:10,737 INFO L87 Difference]: Start difference. First operand has 124 states, 97 states have (on average 1.690721649484536) internal successors, (164), 115 states have internal predecessors, (164), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:10,843 INFO L93 Difference]: Finished difference Result 293 states and 444 transitions. [2023-02-16 04:03:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:10,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-16 04:03:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:10,858 INFO L225 Difference]: With dead ends: 293 [2023-02-16 04:03:10,858 INFO L226 Difference]: Without dead ends: 141 [2023-02-16 04:03:10,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:10,869 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 83 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:10,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 472 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-16 04:03:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2023-02-16 04:03:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.5229357798165137) internal successors, (166), 122 states have internal predecessors, (166), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 176 transitions. [2023-02-16 04:03:10,925 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 176 transitions. Word has length 9 [2023-02-16 04:03:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:10,926 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 176 transitions. [2023-02-16 04:03:10,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 176 transitions. [2023-02-16 04:03:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 04:03:10,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:10,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:10,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 04:03:10,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1427987682, now seen corresponding path program 1 times [2023-02-16 04:03:10,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:10,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359339099] [2023-02-16 04:03:10,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:10,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:11,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:11,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359339099] [2023-02-16 04:03:11,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359339099] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:11,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:11,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:11,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383156967] [2023-02-16 04:03:11,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:11,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:11,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:11,046 INFO L87 Difference]: Start difference. First operand 131 states and 176 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:11,146 INFO L93 Difference]: Finished difference Result 251 states and 327 transitions. [2023-02-16 04:03:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:11,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-16 04:03:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:11,149 INFO L225 Difference]: With dead ends: 251 [2023-02-16 04:03:11,149 INFO L226 Difference]: Without dead ends: 159 [2023-02-16 04:03:11,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:11,150 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 128 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:11,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 427 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-16 04:03:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 140. [2023-02-16 04:03:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.5084745762711864) internal successors, (178), 131 states have internal predecessors, (178), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 188 transitions. [2023-02-16 04:03:11,159 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 188 transitions. Word has length 14 [2023-02-16 04:03:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:11,159 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 188 transitions. [2023-02-16 04:03:11,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 188 transitions. [2023-02-16 04:03:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 04:03:11,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:11,160 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:11,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 04:03:11,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash -718487363, now seen corresponding path program 1 times [2023-02-16 04:03:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:11,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554286382] [2023-02-16 04:03:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:03:11,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:11,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554286382] [2023-02-16 04:03:11,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554286382] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:11,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:11,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:11,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911391190] [2023-02-16 04:03:11,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:11,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:11,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:11,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:11,207 INFO L87 Difference]: Start difference. First operand 140 states and 188 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:11,242 INFO L93 Difference]: Finished difference Result 146 states and 195 transitions. [2023-02-16 04:03:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-16 04:03:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:11,244 INFO L225 Difference]: With dead ends: 146 [2023-02-16 04:03:11,244 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 04:03:11,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:11,245 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:11,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 217 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 04:03:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2023-02-16 04:03:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.4957264957264957) internal successors, (175), 129 states have internal predecessors, (175), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 185 transitions. [2023-02-16 04:03:11,253 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 185 transitions. Word has length 16 [2023-02-16 04:03:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:11,253 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 185 transitions. [2023-02-16 04:03:11,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 185 transitions. [2023-02-16 04:03:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 04:03:11,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:11,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:11,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 04:03:11,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:11,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1317945294, now seen corresponding path program 1 times [2023-02-16 04:03:11,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:11,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693067623] [2023-02-16 04:03:11,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:11,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:11,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693067623] [2023-02-16 04:03:11,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693067623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:11,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:11,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129049025] [2023-02-16 04:03:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:11,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:11,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:11,339 INFO L87 Difference]: Start difference. First operand 138 states and 185 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:11,419 INFO L93 Difference]: Finished difference Result 164 states and 212 transitions. [2023-02-16 04:03:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:11,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-16 04:03:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:11,421 INFO L225 Difference]: With dead ends: 164 [2023-02-16 04:03:11,421 INFO L226 Difference]: Without dead ends: 162 [2023-02-16 04:03:11,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:11,424 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 105 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:11,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 432 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-16 04:03:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 138. [2023-02-16 04:03:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.4786324786324787) internal successors, (173), 129 states have internal predecessors, (173), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 183 transitions. [2023-02-16 04:03:11,443 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 183 transitions. Word has length 15 [2023-02-16 04:03:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:11,444 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 183 transitions. [2023-02-16 04:03:11,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 183 transitions. [2023-02-16 04:03:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:11,445 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:11,445 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:11,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 04:03:11,446 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:11,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:11,447 INFO L85 PathProgramCache]: Analyzing trace with hash -769644360, now seen corresponding path program 1 times [2023-02-16 04:03:11,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:11,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416228867] [2023-02-16 04:03:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416228867] [2023-02-16 04:03:11,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416228867] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:11,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:11,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:11,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248872568] [2023-02-16 04:03:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:11,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:11,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:11,585 INFO L87 Difference]: Start difference. First operand 138 states and 183 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:11,656 INFO L93 Difference]: Finished difference Result 196 states and 259 transitions. [2023-02-16 04:03:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-16 04:03:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:11,670 INFO L225 Difference]: With dead ends: 196 [2023-02-16 04:03:11,670 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 04:03:11,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:11,671 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 148 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:11,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 330 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 04:03:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2023-02-16 04:03:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.5) internal successors, (216), 156 states have internal predecessors, (216), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2023-02-16 04:03:11,679 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 17 [2023-02-16 04:03:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:11,679 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2023-02-16 04:03:11,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2023-02-16 04:03:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:11,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:11,680 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:11,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 04:03:11,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -798271716, now seen corresponding path program 1 times [2023-02-16 04:03:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:11,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893590348] [2023-02-16 04:03:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:11,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:11,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893590348] [2023-02-16 04:03:11,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893590348] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:11,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:11,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:11,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315134360] [2023-02-16 04:03:11,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:11,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:11,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:11,735 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:11,792 INFO L93 Difference]: Finished difference Result 194 states and 258 transitions. [2023-02-16 04:03:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:11,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-16 04:03:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:11,795 INFO L225 Difference]: With dead ends: 194 [2023-02-16 04:03:11,795 INFO L226 Difference]: Without dead ends: 191 [2023-02-16 04:03:11,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:11,797 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 146 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:11,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 331 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-16 04:03:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2023-02-16 04:03:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.476510067114094) internal successors, (220), 160 states have internal predecessors, (220), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2023-02-16 04:03:11,816 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 17 [2023-02-16 04:03:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:11,817 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2023-02-16 04:03:11,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2023-02-16 04:03:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:03:11,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:11,820 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:11,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 04:03:11,821 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134665, now seen corresponding path program 1 times [2023-02-16 04:03:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:11,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478699554] [2023-02-16 04:03:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:11,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:11,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:11,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478699554] [2023-02-16 04:03:11,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478699554] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:11,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885773140] [2023-02-16 04:03:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:11,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:11,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:11,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:11,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 04:03:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:11,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:11,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:11,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:11,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885773140] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:11,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:11,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-16 04:03:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325779068] [2023-02-16 04:03:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:11,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:11,991 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:12,021 INFO L93 Difference]: Finished difference Result 210 states and 281 transitions. [2023-02-16 04:03:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:12,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 04:03:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:12,024 INFO L225 Difference]: With dead ends: 210 [2023-02-16 04:03:12,024 INFO L226 Difference]: Without dead ends: 209 [2023-02-16 04:03:12,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:12,025 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 17 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:12,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 240 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-16 04:03:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2023-02-16 04:03:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 144 states have (on average 1.4722222222222223) internal successors, (212), 155 states have internal predecessors, (212), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2023-02-16 04:03:12,035 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 17 [2023-02-16 04:03:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:12,035 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2023-02-16 04:03:12,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2023-02-16 04:03:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 04:03:12,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,037 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,045 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-16 04:03:12,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:12,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash -634582064, now seen corresponding path program 1 times [2023-02-16 04:03:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637384232] [2023-02-16 04:03:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:03:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637384232] [2023-02-16 04:03:12,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637384232] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:12,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:12,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014417004] [2023-02-16 04:03:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:12,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:12,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:12,279 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:12,329 INFO L93 Difference]: Finished difference Result 211 states and 280 transitions. [2023-02-16 04:03:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:12,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 04:03:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:12,331 INFO L225 Difference]: With dead ends: 211 [2023-02-16 04:03:12,331 INFO L226 Difference]: Without dead ends: 210 [2023-02-16 04:03:12,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:12,331 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 17 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:12,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 330 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-16 04:03:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2023-02-16 04:03:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 144 states have (on average 1.4583333333333333) internal successors, (210), 155 states have internal predecessors, (210), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2023-02-16 04:03:12,337 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 19 [2023-02-16 04:03:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:12,338 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2023-02-16 04:03:12,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2023-02-16 04:03:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 04:03:12,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,339 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 04:03:12,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,339 INFO L85 PathProgramCache]: Analyzing trace with hash 569253557, now seen corresponding path program 1 times [2023-02-16 04:03:12,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272713597] [2023-02-16 04:03:12,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 04:03:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272713597] [2023-02-16 04:03:12,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272713597] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:12,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:12,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442769369] [2023-02-16 04:03:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:12,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:12,386 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:12,436 INFO L93 Difference]: Finished difference Result 189 states and 251 transitions. [2023-02-16 04:03:12,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:12,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-16 04:03:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:12,437 INFO L225 Difference]: With dead ends: 189 [2023-02-16 04:03:12,437 INFO L226 Difference]: Without dead ends: 187 [2023-02-16 04:03:12,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:12,438 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 140 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:12,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 332 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-16 04:03:12,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2023-02-16 04:03:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.4357142857142857) internal successors, (201), 149 states have internal predecessors, (201), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 211 transitions. [2023-02-16 04:03:12,445 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 211 transitions. Word has length 24 [2023-02-16 04:03:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:12,445 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 211 transitions. [2023-02-16 04:03:12,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 211 transitions. [2023-02-16 04:03:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 04:03:12,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,446 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 04:03:12,447 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 540626201, now seen corresponding path program 1 times [2023-02-16 04:03:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299224246] [2023-02-16 04:03:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 04:03:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299224246] [2023-02-16 04:03:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299224246] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:12,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:12,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880884234] [2023-02-16 04:03:12,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:12,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:12,506 INFO L87 Difference]: Start difference. First operand 159 states and 211 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:12,566 INFO L93 Difference]: Finished difference Result 181 states and 239 transitions. [2023-02-16 04:03:12,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:12,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-16 04:03:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:12,568 INFO L225 Difference]: With dead ends: 181 [2023-02-16 04:03:12,568 INFO L226 Difference]: Without dead ends: 179 [2023-02-16 04:03:12,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:12,569 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 139 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:12,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 330 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-16 04:03:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2023-02-16 04:03:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.4210526315789473) internal successors, (189), 140 states have internal predecessors, (189), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 199 transitions. [2023-02-16 04:03:12,576 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 199 transitions. Word has length 24 [2023-02-16 04:03:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:12,576 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 199 transitions. [2023-02-16 04:03:12,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 199 transitions. [2023-02-16 04:03:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 04:03:12,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 04:03:12,578 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1447606308, now seen corresponding path program 1 times [2023-02-16 04:03:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326858528] [2023-02-16 04:03:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-16 04:03:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326858528] [2023-02-16 04:03:12,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326858528] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:12,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186294179] [2023-02-16 04:03:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:12,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:12,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 04:03:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 04:03:12,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 04:03:12,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:12,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186294179] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:12,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:12,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2023-02-16 04:03:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751828810] [2023-02-16 04:03:12,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 04:03:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 04:03:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:12,919 INFO L87 Difference]: Start difference. First operand 150 states and 199 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,207 INFO L93 Difference]: Finished difference Result 413 states and 537 transitions. [2023-02-16 04:03:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 04:03:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2023-02-16 04:03:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,209 INFO L225 Difference]: With dead ends: 413 [2023-02-16 04:03:13,209 INFO L226 Difference]: Without dead ends: 246 [2023-02-16 04:03:13,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2023-02-16 04:03:13,210 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 282 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1085 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-16 04:03:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 118. [2023-02-16 04:03:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.386138613861386) internal successors, (140), 108 states have internal predecessors, (140), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2023-02-16 04:03:13,217 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 31 [2023-02-16 04:03:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,217 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2023-02-16 04:03:13,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 04:03:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2023-02-16 04:03:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 04:03:13,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:13,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-16 04:03:13,426 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:13,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,426 INFO L85 PathProgramCache]: Analyzing trace with hash -263788851, now seen corresponding path program 1 times [2023-02-16 04:03:13,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130188427] [2023-02-16 04:03:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130188427] [2023-02-16 04:03:13,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130188427] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770927823] [2023-02-16 04:03:13,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:13,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:13,501 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,573 INFO L93 Difference]: Finished difference Result 272 states and 337 transitions. [2023-02-16 04:03:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-02-16 04:03:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,575 INFO L225 Difference]: With dead ends: 272 [2023-02-16 04:03:13,575 INFO L226 Difference]: Without dead ends: 207 [2023-02-16 04:03:13,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:13,576 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 140 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 712 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-16 04:03:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 118. [2023-02-16 04:03:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 108 states have internal predecessors, (138), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2023-02-16 04:03:13,581 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 36 [2023-02-16 04:03:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,582 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2023-02-16 04:03:13,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2023-02-16 04:03:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 04:03:13,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 04:03:13,583 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1233298428, now seen corresponding path program 2 times [2023-02-16 04:03:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962944695] [2023-02-16 04:03:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:13,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962944695] [2023-02-16 04:03:13,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962944695] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269897522] [2023-02-16 04:03:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:13,645 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,741 INFO L93 Difference]: Finished difference Result 265 states and 327 transitions. [2023-02-16 04:03:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:13,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-16 04:03:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,743 INFO L225 Difference]: With dead ends: 265 [2023-02-16 04:03:13,743 INFO L226 Difference]: Without dead ends: 219 [2023-02-16 04:03:13,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:13,744 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 192 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 847 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-16 04:03:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 146. [2023-02-16 04:03:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.359375) internal successors, (174), 135 states have internal predecessors, (174), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 04:03:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2023-02-16 04:03:13,750 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 40 [2023-02-16 04:03:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,750 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2023-02-16 04:03:13,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2023-02-16 04:03:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 04:03:13,751 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 04:03:13,752 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1233300350, now seen corresponding path program 1 times [2023-02-16 04:03:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179271659] [2023-02-16 04:03:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179271659] [2023-02-16 04:03:13,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179271659] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 04:03:13,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652671134] [2023-02-16 04:03:13,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:13,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:13,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:13,862 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,996 INFO L93 Difference]: Finished difference Result 354 states and 436 transitions. [2023-02-16 04:03:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:13,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-16 04:03:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,998 INFO L225 Difference]: With dead ends: 354 [2023-02-16 04:03:13,998 INFO L226 Difference]: Without dead ends: 292 [2023-02-16 04:03:13,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:13,999 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 325 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 772 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-02-16 04:03:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2023-02-16 04:03:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.3515625) internal successors, (173), 135 states have internal predecessors, (173), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 04:03:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2023-02-16 04:03:14,006 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 40 [2023-02-16 04:03:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:14,006 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2023-02-16 04:03:14,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2023-02-16 04:03:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 04:03:14,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:14,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:14,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 04:03:14,008 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:14,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash 711400920, now seen corresponding path program 1 times [2023-02-16 04:03:14,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:14,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433241498] [2023-02-16 04:03:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:14,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433241498] [2023-02-16 04:03:14,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433241498] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924402057] [2023-02-16 04:03:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:14,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:14,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:14,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 04:03:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 04:03:14,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:14,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:14,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924402057] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:14,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:14,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 9 [2023-02-16 04:03:14,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274820698] [2023-02-16 04:03:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:14,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:14,223 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:14,291 INFO L93 Difference]: Finished difference Result 345 states and 433 transitions. [2023-02-16 04:03:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2023-02-16 04:03:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:14,293 INFO L225 Difference]: With dead ends: 345 [2023-02-16 04:03:14,293 INFO L226 Difference]: Without dead ends: 270 [2023-02-16 04:03:14,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:14,293 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 120 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:14,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 718 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-16 04:03:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 155. [2023-02-16 04:03:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 141 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 04:03:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 195 transitions. [2023-02-16 04:03:14,301 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 195 transitions. Word has length 42 [2023-02-16 04:03:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:14,301 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 195 transitions. [2023-02-16 04:03:14,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 195 transitions. [2023-02-16 04:03:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 04:03:14,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:14,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:14,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:14,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:14,508 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 669185758, now seen corresponding path program 1 times [2023-02-16 04:03:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:14,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68898804] [2023-02-16 04:03:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:14,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68898804] [2023-02-16 04:03:14,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68898804] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:14,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444821664] [2023-02-16 04:03:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:14,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:14,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 04:03:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 04:03:14,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:14,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:14,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444821664] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:14,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:14,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2023-02-16 04:03:14,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30831100] [2023-02-16 04:03:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:14,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:14,791 INFO L87 Difference]: Start difference. First operand 155 states and 195 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:14,869 INFO L93 Difference]: Finished difference Result 395 states and 487 transitions. [2023-02-16 04:03:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2023-02-16 04:03:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:14,870 INFO L225 Difference]: With dead ends: 395 [2023-02-16 04:03:14,870 INFO L226 Difference]: Without dead ends: 332 [2023-02-16 04:03:14,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:14,871 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 308 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:14,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 808 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-02-16 04:03:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 159. [2023-02-16 04:03:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.330935251798561) internal successors, (185), 145 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 04:03:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 200 transitions. [2023-02-16 04:03:14,880 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 200 transitions. Word has length 44 [2023-02-16 04:03:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:14,880 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 200 transitions. [2023-02-16 04:03:14,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 200 transitions. [2023-02-16 04:03:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 04:03:14,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:14,881 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:14,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 04:03:15,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-16 04:03:15,086 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash -10872612, now seen corresponding path program 1 times [2023-02-16 04:03:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089039328] [2023-02-16 04:03:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 04:03:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089039328] [2023-02-16 04:03:15,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089039328] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447718741] [2023-02-16 04:03:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:15,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:15,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 04:03:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 04:03:15,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:15,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:15,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447718741] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:15,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:15,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-02-16 04:03:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430834127] [2023-02-16 04:03:15,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:15,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 04:03:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:15,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 04:03:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:15,468 INFO L87 Difference]: Start difference. First operand 159 states and 200 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,598 INFO L93 Difference]: Finished difference Result 330 states and 411 transitions. [2023-02-16 04:03:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:15,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2023-02-16 04:03:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,599 INFO L225 Difference]: With dead ends: 330 [2023-02-16 04:03:15,600 INFO L226 Difference]: Without dead ends: 270 [2023-02-16 04:03:15,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:15,600 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 291 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 772 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-16 04:03:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2023-02-16 04:03:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 155 states have (on average 1.3225806451612903) internal successors, (205), 161 states have internal predecessors, (205), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 04:03:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 220 transitions. [2023-02-16 04:03:15,608 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 220 transitions. Word has length 44 [2023-02-16 04:03:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,608 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 220 transitions. [2023-02-16 04:03:15,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 220 transitions. [2023-02-16 04:03:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 04:03:15,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:15,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-16 04:03:15,814 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash -364203325, now seen corresponding path program 1 times [2023-02-16 04:03:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132013849] [2023-02-16 04:03:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:15,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:15,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132013849] [2023-02-16 04:03:15,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132013849] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:15,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733113422] [2023-02-16 04:03:15,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:15,943 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:15,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 04:03:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 04:03:15,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 04:03:16,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:16,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733113422] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:16,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:16,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 17 [2023-02-16 04:03:16,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499106939] [2023-02-16 04:03:16,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:16,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 04:03:16,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:16,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 04:03:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-02-16 04:03:16,119 INFO L87 Difference]: Start difference. First operand 175 states and 220 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 04:03:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:16,354 INFO L93 Difference]: Finished difference Result 331 states and 410 transitions. [2023-02-16 04:03:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 04:03:16,354 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 47 [2023-02-16 04:03:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:16,355 INFO L225 Difference]: With dead ends: 331 [2023-02-16 04:03:16,355 INFO L226 Difference]: Without dead ends: 248 [2023-02-16 04:03:16,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-02-16 04:03:16,356 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 335 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:16,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 882 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-16 04:03:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 172. [2023-02-16 04:03:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 158 states have internal predecessors, (196), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 04:03:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 211 transitions. [2023-02-16 04:03:16,366 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 211 transitions. Word has length 47 [2023-02-16 04:03:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:16,367 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 211 transitions. [2023-02-16 04:03:16,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 04:03:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 211 transitions. [2023-02-16 04:03:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 04:03:16,367 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:16,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:16,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-16 04:03:16,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-16 04:03:16,573 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1420566279, now seen corresponding path program 1 times [2023-02-16 04:03:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:16,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682609549] [2023-02-16 04:03:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:16,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:16,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682609549] [2023-02-16 04:03:16,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682609549] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:16,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018185158] [2023-02-16 04:03:16,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:16,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:16,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:16,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:16,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 04:03:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 04:03:16,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 04:03:17,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018185158] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:17,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:17,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 13] total 28 [2023-02-16 04:03:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117336362] [2023-02-16 04:03:17,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:17,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 04:03:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 04:03:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2023-02-16 04:03:17,273 INFO L87 Difference]: Start difference. First operand 172 states and 211 transitions. Second operand has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 23 states have internal predecessors, (84), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:18,285 INFO L93 Difference]: Finished difference Result 783 states and 963 transitions. [2023-02-16 04:03:18,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-16 04:03:18,286 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 23 states have internal predecessors, (84), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2023-02-16 04:03:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:18,288 INFO L225 Difference]: With dead ends: 783 [2023-02-16 04:03:18,288 INFO L226 Difference]: Without dead ends: 737 [2023-02-16 04:03:18,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=2573, Unknown=0, NotChecked=0, Total=2862 [2023-02-16 04:03:18,290 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 757 mSDsluCounter, 4550 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 4873 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:18,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 4873 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 04:03:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2023-02-16 04:03:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 224. [2023-02-16 04:03:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 200 states have (on average 1.28) internal successors, (256), 205 states have internal predecessors, (256), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (15), 14 states have call predecessors, (15), 8 states have call successors, (15) [2023-02-16 04:03:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 279 transitions. [2023-02-16 04:03:18,313 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 279 transitions. Word has length 49 [2023-02-16 04:03:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:18,313 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 279 transitions. [2023-02-16 04:03:18,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.230769230769231) internal successors, (84), 23 states have internal predecessors, (84), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 279 transitions. [2023-02-16 04:03:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 04:03:18,314 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:18,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:18,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:18,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:18,521 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1337688143, now seen corresponding path program 1 times [2023-02-16 04:03:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:18,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814666068] [2023-02-16 04:03:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-16 04:03:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:18,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814666068] [2023-02-16 04:03:18,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814666068] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557057469] [2023-02-16 04:03:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:18,565 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:18,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 04:03:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:18,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 04:03:18,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:18,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557057469] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:18,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:18,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-16 04:03:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575734383] [2023-02-16 04:03:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:18,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:18,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:18,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:18,619 INFO L87 Difference]: Start difference. First operand 224 states and 279 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:18,665 INFO L93 Difference]: Finished difference Result 386 states and 485 transitions. [2023-02-16 04:03:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:18,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2023-02-16 04:03:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:18,667 INFO L225 Difference]: With dead ends: 386 [2023-02-16 04:03:18,667 INFO L226 Difference]: Without dead ends: 248 [2023-02-16 04:03:18,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:18,668 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 4 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:18,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 307 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-16 04:03:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2023-02-16 04:03:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 212 states have (on average 1.2641509433962264) internal successors, (268), 217 states have internal predecessors, (268), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (15), 14 states have call predecessors, (15), 8 states have call successors, (15) [2023-02-16 04:03:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 291 transitions. [2023-02-16 04:03:18,678 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 291 transitions. Word has length 50 [2023-02-16 04:03:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:18,679 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 291 transitions. [2023-02-16 04:03:18,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 04:03:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 291 transitions. [2023-02-16 04:03:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 04:03:18,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:18,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:18,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:18,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:18,885 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1922597599, now seen corresponding path program 1 times [2023-02-16 04:03:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:18,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118259215] [2023-02-16 04:03:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:19,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:19,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:19,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-16 04:03:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118259215] [2023-02-16 04:03:19,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118259215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912124150] [2023-02-16 04:03:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:19,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:19,145 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:19,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 04:03:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:19,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 04:03:19,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:19,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:19,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912124150] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:19,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:19,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2023-02-16 04:03:19,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64510747] [2023-02-16 04:03:19,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:19,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 04:03:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 04:03:19,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2023-02-16 04:03:19,719 INFO L87 Difference]: Start difference. First operand 236 states and 291 transitions. Second operand has 37 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 04:03:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:20,813 INFO L93 Difference]: Finished difference Result 734 states and 947 transitions. [2023-02-16 04:03:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-16 04:03:20,813 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 51 [2023-02-16 04:03:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:20,815 INFO L225 Difference]: With dead ends: 734 [2023-02-16 04:03:20,815 INFO L226 Difference]: Without dead ends: 686 [2023-02-16 04:03:20,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=333, Invalid=3449, Unknown=0, NotChecked=0, Total=3782 [2023-02-16 04:03:20,817 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 575 mSDsluCounter, 4611 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 4823 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:20,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 4823 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 04:03:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2023-02-16 04:03:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 234. [2023-02-16 04:03:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 210 states have (on average 1.2714285714285714) internal successors, (267), 216 states have internal predecessors, (267), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) [2023-02-16 04:03:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2023-02-16 04:03:20,837 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 51 [2023-02-16 04:03:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:20,837 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2023-02-16 04:03:20,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-16 04:03:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2023-02-16 04:03:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 04:03:20,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:20,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:20,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:21,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:21,043 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1899965345, now seen corresponding path program 1 times [2023-02-16 04:03:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:21,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160829335] [2023-02-16 04:03:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:21,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:21,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-16 04:03:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:21,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160829335] [2023-02-16 04:03:21,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160829335] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:21,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:21,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 04:03:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382227482] [2023-02-16 04:03:21,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:21,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:21,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:21,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:21,212 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:23,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-16 04:03:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:23,118 INFO L93 Difference]: Finished difference Result 344 states and 420 transitions. [2023-02-16 04:03:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:03:23,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2023-02-16 04:03:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:23,120 INFO L225 Difference]: With dead ends: 344 [2023-02-16 04:03:23,120 INFO L226 Difference]: Without dead ends: 343 [2023-02-16 04:03:23,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:23,120 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 261 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:23,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 873 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-16 04:03:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-02-16 04:03:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 232. [2023-02-16 04:03:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 208 states have (on average 1.2692307692307692) internal successors, (264), 214 states have internal predecessors, (264), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) [2023-02-16 04:03:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 287 transitions. [2023-02-16 04:03:23,131 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 287 transitions. Word has length 51 [2023-02-16 04:03:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:23,132 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 287 transitions. [2023-02-16 04:03:23,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 287 transitions. [2023-02-16 04:03:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-16 04:03:23,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:23,132 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:23,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 04:03:23,133 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2046715374, now seen corresponding path program 1 times [2023-02-16 04:03:23,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:23,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307219956] [2023-02-16 04:03:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:23,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:23,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307219956] [2023-02-16 04:03:23,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307219956] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:23,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:23,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 04:03:23,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899153418] [2023-02-16 04:03:23,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:23,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 04:03:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:23,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 04:03:23,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:23,289 INFO L87 Difference]: Start difference. First operand 232 states and 287 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:23,679 INFO L93 Difference]: Finished difference Result 549 states and 682 transitions. [2023-02-16 04:03:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 04:03:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2023-02-16 04:03:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:23,682 INFO L225 Difference]: With dead ends: 549 [2023-02-16 04:03:23,682 INFO L226 Difference]: Without dead ends: 547 [2023-02-16 04:03:23,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2023-02-16 04:03:23,683 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 279 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:23,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2016 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2023-02-16 04:03:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 294. [2023-02-16 04:03:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 269 states have (on average 1.2825278810408922) internal successors, (345), 273 states have internal predecessors, (345), 8 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (19), 16 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-16 04:03:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 372 transitions. [2023-02-16 04:03:23,700 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 372 transitions. Word has length 54 [2023-02-16 04:03:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:23,700 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 372 transitions. [2023-02-16 04:03:23,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 372 transitions. [2023-02-16 04:03:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 04:03:23,701 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:23,701 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:23,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-16 04:03:23,702 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash 672944997, now seen corresponding path program 1 times [2023-02-16 04:03:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:23,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175893904] [2023-02-16 04:03:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:23,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175893904] [2023-02-16 04:03:23,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175893904] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:23,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198377428] [2023-02-16 04:03:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:23,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:23,874 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:23,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 04:03:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:23,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 04:03:23,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:24,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:24,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198377428] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:24,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:24,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2023-02-16 04:03:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879052126] [2023-02-16 04:03:24,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:24,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 04:03:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:24,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 04:03:24,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-02-16 04:03:24,556 INFO L87 Difference]: Start difference. First operand 294 states and 372 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:26,182 INFO L93 Difference]: Finished difference Result 1017 states and 1250 transitions. [2023-02-16 04:03:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-16 04:03:26,182 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 56 [2023-02-16 04:03:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:26,185 INFO L225 Difference]: With dead ends: 1017 [2023-02-16 04:03:26,185 INFO L226 Difference]: Without dead ends: 966 [2023-02-16 04:03:26,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=544, Invalid=2996, Unknown=0, NotChecked=0, Total=3540 [2023-02-16 04:03:26,186 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1100 mSDsluCounter, 2982 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:26,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 3330 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 04:03:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-02-16 04:03:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 309. [2023-02-16 04:03:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 284 states have (on average 1.2816901408450705) internal successors, (364), 287 states have internal predecessors, (364), 8 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (19), 17 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-16 04:03:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 391 transitions. [2023-02-16 04:03:26,203 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 391 transitions. Word has length 56 [2023-02-16 04:03:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:26,203 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 391 transitions. [2023-02-16 04:03:26,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 22 states have internal predecessors, (106), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 391 transitions. [2023-02-16 04:03:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 04:03:26,204 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:26,205 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:26,219 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-16 04:03:26,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-16 04:03:26,410 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:26,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash -124023212, now seen corresponding path program 1 times [2023-02-16 04:03:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:26,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462731942] [2023-02-16 04:03:26,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:26,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:26,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:26,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 04:03:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:03:26,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:26,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462731942] [2023-02-16 04:03:26,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462731942] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:26,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083825522] [2023-02-16 04:03:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:26,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:26,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:26,607 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:03:26,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 04:03:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:26,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-16 04:03:26,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 04:03:26,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 04:03:27,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083825522] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:27,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:27,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2023-02-16 04:03:27,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383789945] [2023-02-16 04:03:27,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:27,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 04:03:27,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:27,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 04:03:27,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2023-02-16 04:03:27,115 INFO L87 Difference]: Start difference. First operand 309 states and 391 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 04:03:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:28,234 INFO L93 Difference]: Finished difference Result 771 states and 992 transitions. [2023-02-16 04:03:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-16 04:03:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) Word has length 56 [2023-02-16 04:03:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:28,237 INFO L225 Difference]: With dead ends: 771 [2023-02-16 04:03:28,237 INFO L226 Difference]: Without dead ends: 662 [2023-02-16 04:03:28,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=2727, Unknown=0, NotChecked=0, Total=3080 [2023-02-16 04:03:28,239 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 457 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:28,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 2926 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:03:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-02-16 04:03:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 362. [2023-02-16 04:03:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 335 states have (on average 1.2656716417910447) internal successors, (424), 334 states have internal predecessors, (424), 8 states have call successors, (8), 4 states have call predecessors, (8), 11 states have return successors, (27), 23 states have call predecessors, (27), 8 states have call successors, (27) [2023-02-16 04:03:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 459 transitions. [2023-02-16 04:03:28,269 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 459 transitions. Word has length 56 [2023-02-16 04:03:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:28,270 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 459 transitions. [2023-02-16 04:03:28,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-16 04:03:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 459 transitions. [2023-02-16 04:03:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 04:03:28,271 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:28,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:28,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:28,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-16 04:03:28,476 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash -804081582, now seen corresponding path program 1 times [2023-02-16 04:03:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:28,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049942461] [2023-02-16 04:03:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:03:28,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:03:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:03:28,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:03:28,529 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 04:03:28,530 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-16 04:03:28,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-16 04:03:28,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-16 04:03:28,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-16 04:03:28,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-16 04:03:28,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-16 04:03:28,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-16 04:03:28,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-16 04:03:28,534 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:28,536 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:03:28,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:03:28 BoogieIcfgContainer [2023-02-16 04:03:28,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:03:28,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:03:28,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:03:28,571 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:03:28,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:10" (3/4) ... [2023-02-16 04:03:28,574 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 04:03:28,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:03:28,575 INFO L158 Benchmark]: Toolchain (without parser) took 19082.28ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 101.5MB in the beginning and 152.2MB in the end (delta: -50.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-16 04:03:28,575 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:28,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.60ms. Allocated memory is still 138.4MB. Free memory was 101.5MB in the beginning and 87.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 04:03:28,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.81ms. Allocated memory is still 138.4MB. Free memory was 87.2MB in the beginning and 84.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 04:03:28,576 INFO L158 Benchmark]: Boogie Preprocessor took 42.12ms. Allocated memory is still 138.4MB. Free memory was 84.7MB in the beginning and 83.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:28,576 INFO L158 Benchmark]: RCFGBuilder took 554.18ms. Allocated memory is still 138.4MB. Free memory was 83.0MB in the beginning and 59.5MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-02-16 04:03:28,578 INFO L158 Benchmark]: TraceAbstraction took 18150.19ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 58.6MB in the beginning and 153.3MB in the end (delta: -94.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:28,578 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 211.8MB. Free memory was 153.3MB in the beginning and 152.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:28,583 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 109.1MB. Free memory is still 60.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.60ms. Allocated memory is still 138.4MB. Free memory was 101.5MB in the beginning and 87.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.81ms. Allocated memory is still 138.4MB. Free memory was 87.2MB in the beginning and 84.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.12ms. Allocated memory is still 138.4MB. Free memory was 84.7MB in the beginning and 83.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 554.18ms. Allocated memory is still 138.4MB. Free memory was 83.0MB in the beginning and 59.5MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18150.19ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 58.6MB in the beginning and 153.3MB in the end (delta: -94.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 211.8MB. Free memory was 153.3MB in the beginning and 152.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 77, overapproximation of bitwiseAnd at line 109. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=-127, eb=-128] [L252] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L252] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L252] zero = base2flt(0, 0) [L253] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L30] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L58] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L78] EXPR e + 128 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L78] res = m | ((unsigned int ) (e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L81] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L253] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, zero=0] [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=33554431] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L30] COND FALSE !(! m) VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L58] COND TRUE 1 VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L78] EXPR e + 128 VAL [\old(e)=-128, \old(m)=33554431, e=-128, m=33554431] [L78] res = m | ((unsigned int ) (e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=-128, \old(m)=33554431, __retres4=33554431, e=-128, m=33554431, res=33554431] [L81] return (__retres4); VAL [\old(e)=-128, \old(m)=33554431, \result=36028797052518399, __retres4=33554431, e=-128, m=33554431, res=33554431] [L254] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=36028797052518399, ea=-127, eb=-128, ma=16777216, mb=33554431, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, tmp=1, zero=0] [L264] sa = tmp VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, sa=1, tmp=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, sa=1, tmp=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, sa=1, tmp=1, tmp___0=1, zero=0] [L274] sb = tmp___0 VAL [a=16777216, b=33554431, ea=-127, eb=-128, ma=16777216, mb=33554431, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=33554431, a=16777216, b=33554431] [L95] COND TRUE a < b [L96] tmp = a [L97] a = b [L98] b = tmp VAL [\old(a)=16777216, \old(b)=33554431, a=33554431, b=16777216, tmp=16777216] [L102] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=33554431, a=33554431, b=16777216, tmp=16777216] [L109] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=33554431, a=33554431, b=16777216, ma=0, tmp=16777216] [L110] (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=33554431, a=33554431, b=16777216, ma=0, tmp=16777216] - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: 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: 18.1s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6456 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6353 mSDsluCounter, 29185 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25661 mSDsCounter, 635 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6356 IncrementalHoareTripleChecker+Invalid, 6991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 635 mSolverCounterUnsat, 3524 mSDtfsCounter, 6356 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1261 GetRequests, 843 SyntacticMatches, 17 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2947 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=25, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 3448 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1406 NumberOfCodeBlocks, 1406 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1641 ConstructedInterpolants, 0 QuantifiedInterpolants, 7647 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 43 InterpolantComputations, 18 PerfectInterpolantSequences, 504/630 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-16 04:03:28,604 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-2a.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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:03:30,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:03:30,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:03:30,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:03:30,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:03:30,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:03:30,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:03:30,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:03:30,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:03:30,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:03:30,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:03:30,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:03:30,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:03:30,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:03:30,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:03:30,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:03:30,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:03:30,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:03:30,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:03:30,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:03:30,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:03:30,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:03:30,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:03:30,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:03:30,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:03:30,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:03:30,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:03:30,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:03:30,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:03:30,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:03:30,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:03:30,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:03:30,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:03:30,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:03:30,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:03:30,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:03:30,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:03:30,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:03:30,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:03:30,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:03:30,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:03:30,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-16 04:03:30,471 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:03:30,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:03:30,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:03:30,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:03:30,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:03:30,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:03:30,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:03:30,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:03:30,474 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:03:30,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:03:30,475 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:03:30,475 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:03:30,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:03:30,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:03:30,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:03:30,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:03:30,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:03:30,476 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 04:03:30,476 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 04:03:30,476 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:03:30,477 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 04:03:30,477 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:03:30,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:03:30,477 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:03:30,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:03:30,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:03:30,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:03:30,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:03:30,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:30,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:03:30,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:03:30,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:03:30,478 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 04:03:30,479 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:30,479 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:03:30,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:03:30,479 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:03:30,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:03:30,479 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 04:03:30,480 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:03:30,480 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2023-02-16 04:03:30,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:03:30,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:03:30,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:03:30,741 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:03:30,742 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:03:30,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2023-02-16 04:03:31,709 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:03:31,909 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:03:31,911 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2023-02-16 04:03:31,919 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6045b67/afeac81dc74f451aa36374a40e7597f1/FLAG34202d70f [2023-02-16 04:03:31,930 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6045b67/afeac81dc74f451aa36374a40e7597f1 [2023-02-16 04:03:31,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:03:31,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:03:31,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:31,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:03:31,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:03:31,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:31" (1/1) ... [2023-02-16 04:03:31,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67581ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:31, skipping insertion in model container [2023-02-16 04:03:31,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:31" (1/1) ... [2023-02-16 04:03:31,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:03:31,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:03:32,063 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-2a.c.cil.c[755,768] [2023-02-16 04:03:32,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:32,152 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:03:32,164 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-2a.c.cil.c[755,768] [2023-02-16 04:03:32,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:32,204 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:03:32,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32 WrapperNode [2023-02-16 04:03:32,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:32,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:32,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:03:32,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:03:32,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,231 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 156 [2023-02-16 04:03:32,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:32,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:03:32,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:03:32,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:03:32,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,278 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:03:32,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:03:32,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:03:32,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:03:32,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (1/1) ... [2023-02-16 04:03:32,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:32,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 04:03:32,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 04:03:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:03:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 04:03:32,368 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-16 04:03:32,368 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-16 04:03:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:03:32,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:03:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 04:03:32,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 04:03:32,441 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:03:32,442 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:03:32,724 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:03:32,729 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:03:32,729 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:03:32,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:32 BoogieIcfgContainer [2023-02-16 04:03:32,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:03:32,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:03:32,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:03:32,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:03:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:03:31" (1/3) ... [2023-02-16 04:03:32,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e423859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:32, skipping insertion in model container [2023-02-16 04:03:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:32" (2/3) ... [2023-02-16 04:03:32,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e423859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:32, skipping insertion in model container [2023-02-16 04:03:32,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:32" (3/3) ... [2023-02-16 04:03:32,735 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2023-02-16 04:03:32,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:03:32,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-16 04:03:32,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:03:32,806 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;@126c1c1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:03:32,806 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-16 04:03:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 75 states have (on average 1.68) internal successors, (126), 93 states have internal predecessors, (126), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-16 04:03:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:32,815 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:32,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:32,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1415508078, now seen corresponding path program 1 times [2023-02-16 04:03:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:32,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376005705] [2023-02-16 04:03:32,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:32,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:32,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:32,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:32,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 04:03:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:32,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 04:03:32,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:32,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:32,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:32,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376005705] [2023-02-16 04:03:32,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376005705] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:32,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:32,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-16 04:03:32,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54239364] [2023-02-16 04:03:32,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:32,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 04:03:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:32,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 04:03:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 04:03:32,989 INFO L87 Difference]: Start difference. First operand has 102 states, 75 states have (on average 1.68) internal successors, (126), 93 states have internal predecessors, (126), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:33,025 INFO L93 Difference]: Finished difference Result 192 states and 288 transitions. [2023-02-16 04:03:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 04:03:33,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-16 04:03:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:33,037 INFO L225 Difference]: With dead ends: 192 [2023-02-16 04:03:33,037 INFO L226 Difference]: Without dead ends: 65 [2023-02-16 04:03:33,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 04:03:33,043 INFO L413 NwaCegarLoop]: 127 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, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:33,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-16 04:03:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-16 04:03:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 57 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2023-02-16 04:03:33,082 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 9 [2023-02-16 04:03:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:33,083 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2023-02-16 04:03:33,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2023-02-16 04:03:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:33,085 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:33,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:33,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:33,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:33,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1416449344, now seen corresponding path program 1 times [2023-02-16 04:03:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:33,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879479079] [2023-02-16 04:03:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:33,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:33,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:33,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:33,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-16 04:03:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:33,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:33,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:33,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:33,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879479079] [2023-02-16 04:03:33,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879479079] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:33,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:33,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459040400] [2023-02-16 04:03:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:33,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:33,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:33,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:33,357 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:33,397 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2023-02-16 04:03:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:03:33,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-16 04:03:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:33,400 INFO L225 Difference]: With dead ends: 135 [2023-02-16 04:03:33,400 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 04:03:33,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:33,401 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:33,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 215 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 04:03:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-16 04:03:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 61 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2023-02-16 04:03:33,409 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 9 [2023-02-16 04:03:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:33,409 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2023-02-16 04:03:33,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2023-02-16 04:03:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 04:03:33,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:33,410 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:33,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:33,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:33,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash 148928534, now seen corresponding path program 1 times [2023-02-16 04:03:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:33,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078595340] [2023-02-16 04:03:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:33,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:33,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:33,613 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:33,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-16 04:03:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:33,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:03:33,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:33,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:33,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078595340] [2023-02-16 04:03:33,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078595340] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:33,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:33,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404843905] [2023-02-16 04:03:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:33,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:33,696 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:33,723 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2023-02-16 04:03:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-16 04:03:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:33,724 INFO L225 Difference]: With dead ends: 73 [2023-02-16 04:03:33,724 INFO L226 Difference]: Without dead ends: 72 [2023-02-16 04:03:33,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:33,725 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:33,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-16 04:03:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-02-16 04:03:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.309090909090909) internal successors, (72), 60 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-02-16 04:03:33,731 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 16 [2023-02-16 04:03:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:33,731 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-02-16 04:03:33,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2023-02-16 04:03:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 04:03:33,731 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:33,731 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:33,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:33,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:33,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2021116994, now seen corresponding path program 1 times [2023-02-16 04:03:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:33,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832411556] [2023-02-16 04:03:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:33,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:33,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:33,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-16 04:03:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:33,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:33,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:03:33,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:33,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:33,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832411556] [2023-02-16 04:03:33,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832411556] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:33,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:33,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:33,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986560818] [2023-02-16 04:03:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:33,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:33,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:33,978 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:33,995 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2023-02-16 04:03:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:33,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-16 04:03:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:33,996 INFO L225 Difference]: With dead ends: 72 [2023-02-16 04:03:33,996 INFO L226 Difference]: Without dead ends: 71 [2023-02-16 04:03:33,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:33,997 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:33,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-16 04:03:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-02-16 04:03:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.290909090909091) internal successors, (71), 59 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2023-02-16 04:03:34,002 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 18 [2023-02-16 04:03:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:34,003 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2023-02-16 04:03:34,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2023-02-16 04:03:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 04:03:34,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:34,003 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:34,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:34,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:34,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2021049468, now seen corresponding path program 1 times [2023-02-16 04:03:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:34,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541133279] [2023-02-16 04:03:34,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:34,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:34,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:34,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-16 04:03:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:03:34,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:34,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:34,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:34,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541133279] [2023-02-16 04:03:34,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541133279] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:34,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:34,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380289820] [2023-02-16 04:03:34,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:34,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:34,314 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:34,513 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2023-02-16 04:03:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:34,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-16 04:03:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:34,517 INFO L225 Difference]: With dead ends: 84 [2023-02-16 04:03:34,517 INFO L226 Difference]: Without dead ends: 83 [2023-02-16 04:03:34,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:34,518 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 55 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 167 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.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:34,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 167 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-16 04:03:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2023-02-16 04:03:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 64 states have internal predecessors, (77), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2023-02-16 04:03:34,530 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 18 [2023-02-16 04:03:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:34,530 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2023-02-16 04:03:34,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2023-02-16 04:03:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 04:03:34,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:34,533 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:34,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:34,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:34,742 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:34,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1903560936, now seen corresponding path program 1 times [2023-02-16 04:03:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:34,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600109153] [2023-02-16 04:03:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:34,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:34,744 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:34,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 04:03:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:34,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:34,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:35,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:35,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:35,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600109153] [2023-02-16 04:03:35,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600109153] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:35,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:35,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 04:03:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533397540] [2023-02-16 04:03:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:35,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:35,412 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:37,403 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2023-02-16 04:03:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 04:03:37,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-16 04:03:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:37,404 INFO L225 Difference]: With dead ends: 89 [2023-02-16 04:03:37,404 INFO L226 Difference]: Without dead ends: 88 [2023-02-16 04:03:37,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:37,405 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 53 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:37,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 250 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-16 04:03:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-16 04:03:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2023-02-16 04:03:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 58 states have internal predecessors, (70), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2023-02-16 04:03:37,415 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 21 [2023-02-16 04:03:37,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:37,417 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2023-02-16 04:03:37,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2023-02-16 04:03:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 04:03:37,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:37,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:37,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:37,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:37,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:37,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1771907670, now seen corresponding path program 1 times [2023-02-16 04:03:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:37,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402839206] [2023-02-16 04:03:37,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:37,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:37,629 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:37,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 04:03:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:37,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:37,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:37,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:37,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:37,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402839206] [2023-02-16 04:03:37,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402839206] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:37,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:37,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-16 04:03:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564869892] [2023-02-16 04:03:37,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:37,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:37,765 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:37,807 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2023-02-16 04:03:37,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-02-16 04:03:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:37,809 INFO L225 Difference]: With dead ends: 102 [2023-02-16 04:03:37,809 INFO L226 Difference]: Without dead ends: 70 [2023-02-16 04:03:37,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:37,810 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 34 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 287 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-16 04:03:37,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 287 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-16 04:03:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-02-16 04:03:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 58 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2023-02-16 04:03:37,817 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 38 [2023-02-16 04:03:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:37,817 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2023-02-16 04:03:37,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2023-02-16 04:03:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 04:03:37,818 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:37,818 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:37,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:38,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:38,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash -892960586, now seen corresponding path program 1 times [2023-02-16 04:03:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:38,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481308890] [2023-02-16 04:03:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:38,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:38,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:38,027 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:38,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-16 04:03:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:38,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:38,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:38,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:38,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481308890] [2023-02-16 04:03:38,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481308890] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:38,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:38,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-16 04:03:38,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034275705] [2023-02-16 04:03:38,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:38,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:38,131 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:38,170 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2023-02-16 04:03:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:38,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2023-02-16 04:03:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:38,172 INFO L225 Difference]: With dead ends: 137 [2023-02-16 04:03:38,172 INFO L226 Difference]: Without dead ends: 104 [2023-02-16 04:03:38,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:38,172 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:38,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 414 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:38,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-16 04:03:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2023-02-16 04:03:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 04:03:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2023-02-16 04:03:38,179 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 42 [2023-02-16 04:03:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:38,180 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2023-02-16 04:03:38,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2023-02-16 04:03:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 04:03:38,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:38,194 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:38,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:38,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:38,401 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1407862004, now seen corresponding path program 1 times [2023-02-16 04:03:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:38,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533984096] [2023-02-16 04:03:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:38,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-16 04:03:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:38,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:38,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-16 04:03:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:38,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:38,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:38,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:38,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533984096] [2023-02-16 04:03:38,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533984096] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:38,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:38,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 04:03:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937276966] [2023-02-16 04:03:38,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:38,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:03:38,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:38,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:03:38,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:38,486 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:38,538 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2023-02-16 04:03:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:38,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-02-16 04:03:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:38,539 INFO L225 Difference]: With dead ends: 140 [2023-02-16 04:03:38,539 INFO L226 Difference]: Without dead ends: 110 [2023-02-16 04:03:38,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:38,539 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:38,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 342 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-16 04:03:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2023-02-16 04:03:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 04:03:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2023-02-16 04:03:38,546 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 42 [2023-02-16 04:03:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:38,546 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2023-02-16 04:03:38,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2023-02-16 04:03:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 04:03:38,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:38,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:38,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:38,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:38,754 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 127998326, now seen corresponding path program 1 times [2023-02-16 04:03:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:38,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518366757] [2023-02-16 04:03:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:38,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:38,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:38,756 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:38,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-16 04:03:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:38,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 04:03:38,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:38,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:38,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:38,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518366757] [2023-02-16 04:03:38,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518366757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:38,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:38,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 04:03:38,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690339765] [2023-02-16 04:03:38,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:38,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 04:03:38,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:38,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 04:03:38,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:38,833 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:38,883 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2023-02-16 04:03:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 04:03:38,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-02-16 04:03:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:38,883 INFO L225 Difference]: With dead ends: 115 [2023-02-16 04:03:38,884 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 04:03:38,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:38,884 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:38,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 393 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 04:03:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-16 04:03:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-16 04:03:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2023-02-16 04:03:38,890 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 42 [2023-02-16 04:03:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:38,890 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2023-02-16 04:03:38,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2023-02-16 04:03:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 04:03:38,891 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:38,891 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:38,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:39,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:39,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1857082595, now seen corresponding path program 1 times [2023-02-16 04:03:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:39,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220468946] [2023-02-16 04:03:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:39,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:39,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:39,100 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:39,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-16 04:03:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:39,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:39,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:39,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:39,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220468946] [2023-02-16 04:03:39,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220468946] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:39,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:39,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-16 04:03:39,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906493083] [2023-02-16 04:03:39,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:39,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:03:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:39,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:03:39,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:03:39,218 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:39,289 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2023-02-16 04:03:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2023-02-16 04:03:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:39,290 INFO L225 Difference]: With dead ends: 109 [2023-02-16 04:03:39,290 INFO L226 Difference]: Without dead ends: 67 [2023-02-16 04:03:39,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:03:39,291 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 7 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:39,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 460 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-16 04:03:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-16 04:03:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2023-02-16 04:03:39,296 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 46 [2023-02-16 04:03:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:39,296 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2023-02-16 04:03:39,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2023-02-16 04:03:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 04:03:39,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:39,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:39,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-02-16 04:03:39,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:39,504 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash -292553898, now seen corresponding path program 1 times [2023-02-16 04:03:39,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:39,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482585765] [2023-02-16 04:03:39,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:39,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:39,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:39,505 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:39,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-16 04:03:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:39,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 04:03:39,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:39,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:39,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:39,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482585765] [2023-02-16 04:03:39,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482585765] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:39,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:39,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922470993] [2023-02-16 04:03:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:39,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:39,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:39,653 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:39,774 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2023-02-16 04:03:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 04:03:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2023-02-16 04:03:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:39,775 INFO L225 Difference]: With dead ends: 163 [2023-02-16 04:03:39,775 INFO L226 Difference]: Without dead ends: 136 [2023-02-16 04:03:39,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:39,776 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 107 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:39,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 586 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-16 04:03:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2023-02-16 04:03:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 70 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 04:03:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2023-02-16 04:03:39,782 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 50 [2023-02-16 04:03:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:39,782 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2023-02-16 04:03:39,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2023-02-16 04:03:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 04:03:39,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:39,783 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:39,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:39,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:39,989 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:39,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash -34388460, now seen corresponding path program 1 times [2023-02-16 04:03:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:39,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022174097] [2023-02-16 04:03:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:39,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:39,991 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:39,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-16 04:03:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:40,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 04:03:40,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:03:40,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:40,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:40,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022174097] [2023-02-16 04:03:40,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022174097] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:40,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:40,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 04:03:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051353196] [2023-02-16 04:03:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:40,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 04:03:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:40,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 04:03:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:03:40,141 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:40,363 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2023-02-16 04:03:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:40,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2023-02-16 04:03:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:40,365 INFO L225 Difference]: With dead ends: 144 [2023-02-16 04:03:40,365 INFO L226 Difference]: Without dead ends: 104 [2023-02-16 04:03:40,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-16 04:03:40,365 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 102 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:40,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 603 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-16 04:03:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2023-02-16 04:03:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 62 states have internal predecessors, (69), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 04:03:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2023-02-16 04:03:40,371 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 50 [2023-02-16 04:03:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:40,371 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2023-02-16 04:03:40,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 04:03:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2023-02-16 04:03:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 04:03:40,371 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:40,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:40,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:40,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:40,578 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1329730220, now seen corresponding path program 1 times [2023-02-16 04:03:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:40,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401794767] [2023-02-16 04:03:40,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:40,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:40,580 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:40,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-16 04:03:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:40,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 04:03:40,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:40,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:03:40,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:40,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401794767] [2023-02-16 04:03:40,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401794767] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:40,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:40,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-02-16 04:03:40,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482175345] [2023-02-16 04:03:40,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:40,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:40,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:40,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:40,770 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:40,825 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2023-02-16 04:03:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:03:40,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2023-02-16 04:03:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:40,826 INFO L225 Difference]: With dead ends: 72 [2023-02-16 04:03:40,826 INFO L226 Difference]: Without dead ends: 71 [2023-02-16 04:03:40,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:40,826 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:40,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 222 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-16 04:03:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-02-16 04:03:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 04:03:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2023-02-16 04:03:40,831 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 52 [2023-02-16 04:03:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:40,832 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2023-02-16 04:03:40,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2023-02-16 04:03:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 04:03:40,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:40,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:40,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:41,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:41,039 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1728035976, now seen corresponding path program 1 times [2023-02-16 04:03:41,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:41,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593196880] [2023-02-16 04:03:41,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:41,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:41,041 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:41,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-16 04:03:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:41,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 04:03:41,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:41,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:03:41,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:41,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593196880] [2023-02-16 04:03:41,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593196880] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:41,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:03:41,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-02-16 04:03:41,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63095227] [2023-02-16 04:03:41,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:41,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:41,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:41,205 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:41,281 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2023-02-16 04:03:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2023-02-16 04:03:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:41,282 INFO L225 Difference]: With dead ends: 76 [2023-02-16 04:03:41,282 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 04:03:41,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:03:41,283 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 26 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:41,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 163 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 04:03:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2023-02-16 04:03:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 60 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 04:03:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2023-02-16 04:03:41,288 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 53 [2023-02-16 04:03:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:41,288 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2023-02-16 04:03:41,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2023-02-16 04:03:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 04:03:41,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:41,289 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, 1, 1, 1, 1] [2023-02-16 04:03:41,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:41,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:41,489 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:41,490 INFO L85 PathProgramCache]: Analyzing trace with hash 18450109, now seen corresponding path program 1 times [2023-02-16 04:03:41,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:41,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147771089] [2023-02-16 04:03:41,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:41,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:41,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:41,491 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:41,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-16 04:03:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:41,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 04:03:41,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:41,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:41,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:41,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147771089] [2023-02-16 04:03:41,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147771089] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:41,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1722809216] [2023-02-16 04:03:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:41,718 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:41,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 04:03:41,719 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 04:03:41,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-16 04:03:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:41,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 04:03:41,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:41,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:41,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1722809216] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:41,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:41,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2023-02-16 04:03:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918714752] [2023-02-16 04:03:41,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:41,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 04:03:41,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 04:03:41,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-02-16 04:03:41,834 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 04:03:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:41,989 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2023-02-16 04:03:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:41,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2023-02-16 04:03:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:41,990 INFO L225 Difference]: With dead ends: 128 [2023-02-16 04:03:41,990 INFO L226 Difference]: Without dead ends: 99 [2023-02-16 04:03:41,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-02-16 04:03:41,990 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 55 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:41,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 804 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-16 04:03:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2023-02-16 04:03:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 82 states have internal predecessors, (92), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-16 04:03:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2023-02-16 04:03:41,996 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 60 [2023-02-16 04:03:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:41,996 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2023-02-16 04:03:41,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 04:03:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2023-02-16 04:03:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 04:03:41,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:41,997 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, 1, 1, 1, 1] [2023-02-16 04:03:42,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:42,205 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-16 04:03:42,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 04:03:42,404 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1364132591, now seen corresponding path program 2 times [2023-02-16 04:03:42,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:42,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591986550] [2023-02-16 04:03:42,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:03:42,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:42,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:42,406 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:42,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-16 04:03:42,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 04:03:42,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:03:42,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:42,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:42,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:42,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591986550] [2023-02-16 04:03:42,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591986550] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:42,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:42,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 04:03:42,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310110347] [2023-02-16 04:03:42,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:42,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 04:03:42,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:42,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 04:03:42,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:03:42,517 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:42,671 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2023-02-16 04:03:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:03:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2023-02-16 04:03:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:42,672 INFO L225 Difference]: With dead ends: 149 [2023-02-16 04:03:42,672 INFO L226 Difference]: Without dead ends: 94 [2023-02-16 04:03:42,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-02-16 04:03:42,673 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 66 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:42,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 480 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-16 04:03:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-16 04:03:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 82 states have internal predecessors, (92), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-16 04:03:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2023-02-16 04:03:42,678 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 60 [2023-02-16 04:03:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:42,678 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2023-02-16 04:03:42,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2023-02-16 04:03:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-16 04:03:42,679 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:42,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:42,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:42,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:42,886 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash -507372569, now seen corresponding path program 1 times [2023-02-16 04:03:42,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:42,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39737653] [2023-02-16 04:03:42,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:42,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:42,888 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:42,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-16 04:03:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:42,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:03:42,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-16 04:03:42,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:42,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:42,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39737653] [2023-02-16 04:03:42,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39737653] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:42,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:42,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073066875] [2023-02-16 04:03:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:42,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:42,971 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:43,037 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2023-02-16 04:03:43,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:43,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 62 [2023-02-16 04:03:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:43,038 INFO L225 Difference]: With dead ends: 99 [2023-02-16 04:03:43,038 INFO L226 Difference]: Without dead ends: 93 [2023-02-16 04:03:43,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:43,038 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:43,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-16 04:03:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2023-02-16 04:03:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 67 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-16 04:03:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-16 04:03:43,043 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 62 [2023-02-16 04:03:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:43,043 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-16 04:03:43,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 04:03:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-16 04:03:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-16 04:03:43,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:43,044 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, 1, 1, 1, 1] [2023-02-16 04:03:43,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:43,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:43,249 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1389783085, now seen corresponding path program 1 times [2023-02-16 04:03:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:43,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783328185] [2023-02-16 04:03:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:43,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:43,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:43,251 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:43,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-16 04:03:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:43,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 04:03:43,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 04:03:43,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 04:03:43,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:43,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783328185] [2023-02-16 04:03:43,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783328185] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:43,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:03:43,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-16 04:03:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521889357] [2023-02-16 04:03:43,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:43,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 04:03:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 04:03:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:43,469 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 11 states have internal predecessors, (67), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:43,557 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-02-16 04:03:43,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:03:43,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 11 states have internal predecessors, (67), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 68 [2023-02-16 04:03:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:43,558 INFO L225 Difference]: With dead ends: 102 [2023-02-16 04:03:43,558 INFO L226 Difference]: Without dead ends: 64 [2023-02-16 04:03:43,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:03:43,559 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:43,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 618 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-16 04:03:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-16 04:03:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2023-02-16 04:03:43,563 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 68 [2023-02-16 04:03:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:43,563 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2023-02-16 04:03:43,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 11 states have internal predecessors, (67), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 04:03:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2023-02-16 04:03:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-16 04:03:43,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:43,564 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, 1, 1, 1, 1] [2023-02-16 04:03:43,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:43,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:43,764 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-16 04:03:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1408936897, now seen corresponding path program 1 times [2023-02-16 04:03:43,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:03:43,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131125020] [2023-02-16 04:03:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:43,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:43,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:03:43,766 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 04:03:43,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-16 04:03:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:43,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:03:43,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 04:03:43,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:03:43,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:03:43,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131125020] [2023-02-16 04:03:43,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131125020] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:43,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:43,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088158882] [2023-02-16 04:03:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:43,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:03:43,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:43,909 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:44,128 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-02-16 04:03:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 70 [2023-02-16 04:03:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:44,129 INFO L225 Difference]: With dead ends: 64 [2023-02-16 04:03:44,129 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 04:03:44,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:44,130 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:44,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 04:03:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 04:03:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 04:03:44,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2023-02-16 04:03:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:44,131 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 04:03:44,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 04:03:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 04:03:44,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 04:03:44,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-16 04:03:44,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-16 04:03:44,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-16 04:03:44,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-16 04:03:44,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-16 04:03:44,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-16 04:03:44,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:44,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:03:44,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 04:03:48,830 INFO L899 garLoopResultBuilder]: For program point L60(lines 58 73) no Hoare annotation was computed. [2023-02-16 04:03:48,830 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 46) no Hoare annotation was computed. [2023-02-16 04:03:48,830 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-02-16 04:03:48,830 INFO L895 garLoopResultBuilder]: At program point L48-1(lines 38 53) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-16 04:03:48,830 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2023-02-16 04:03:48,830 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 76) no Hoare annotation was computed. [2023-02-16 04:03:48,830 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-02-16 04:03:48,830 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2023-02-16 04:03:48,830 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-02-16 04:03:48,831 INFO L895 garLoopResultBuilder]: At program point L74(lines 36 76) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-16 04:03:48,831 INFO L895 garLoopResultBuilder]: At program point L58-2(lines 58 73) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-16 04:03:48,831 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2023-02-16 04:03:48,831 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-02-16 04:03:48,831 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2023-02-16 04:03:48,831 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2023-02-16 04:03:48,831 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 25 83) the Hoare annotation is: true [2023-02-16 04:03:48,831 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-02-16 04:03:48,831 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 25 83) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 35) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point L59(lines 58 73) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 46) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 25 83) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L895 garLoopResultBuilder]: At program point L80(lines 29 82) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32))) (and (= base2flt_~m (_ bv0 32)) (= base2flt_~__retres4~0 (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point L39(lines 38 53) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 113) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 352) no Hoare annotation was computed. [2023-02-16 04:03:48,832 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 316 352) no Hoare annotation was computed. [2023-02-16 04:03:48,833 INFO L902 garLoopResultBuilder]: At program point L341-1(lines 328 346) the Hoare annotation is: true [2023-02-16 04:03:48,833 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-16 04:03:48,833 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-02-16 04:03:48,833 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 226 357) the Hoare annotation is: true [2023-02-16 04:03:48,833 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 134) no Hoare annotation was computed. [2023-02-16 04:03:48,833 INFO L899 garLoopResultBuilder]: For program point L292(lines 280 307) no Hoare annotation was computed. [2023-02-16 04:03:48,833 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 263) no Hoare annotation was computed. [2023-02-16 04:03:48,833 INFO L899 garLoopResultBuilder]: For program point L259-2(lines 259 263) no Hoare annotation was computed. [2023-02-16 04:03:48,833 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2023-02-16 04:03:48,834 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 138) no Hoare annotation was computed. [2023-02-16 04:03:48,834 INFO L895 garLoopResultBuilder]: At program point L127-2(lines 127 138) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32))) (.cse1 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) |ULTIMATE.start_addflt_~ea~0#1|) (bvneg ((_ sign_extend 1) |ULTIMATE.start_addflt_~eb~0#1|)))))) (or (and .cse0 (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv128 32)) (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)))) .cse1) (and (bvult (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv4294967169 32)) (_ bv32 32)) .cse0 (= (bvadd |ULTIMATE.start_addflt_~a#1| (_ bv1 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (_ bv0 32)) .cse1) (and .cse0 .cse1 (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv127 32)) (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32))))))) [2023-02-16 04:03:48,834 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 04:03:48,834 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2023-02-16 04:03:48,834 INFO L899 garLoopResultBuilder]: For program point L284-2(lines 284 288) no Hoare annotation was computed. [2023-02-16 04:03:48,834 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 338) no Hoare annotation was computed. [2023-02-16 04:03:48,834 INFO L899 garLoopResultBuilder]: For program point L334-2(lines 334 338) no Hoare annotation was computed. [2023-02-16 04:03:48,834 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 142) no Hoare annotation was computed. [2023-02-16 04:03:48,835 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2023-02-16 04:03:48,835 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2023-02-16 04:03:48,835 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 101) no Hoare annotation was computed. [2023-02-16 04:03:48,835 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 147) no Hoare annotation was computed. [2023-02-16 04:03:48,835 INFO L899 garLoopResultBuilder]: For program point L318-1(lines 316 350) no Hoare annotation was computed. [2023-02-16 04:03:48,835 INFO L902 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: true [2023-02-16 04:03:48,835 INFO L899 garLoopResultBuilder]: For program point L252-1(line 252) no Hoare annotation was computed. [2023-02-16 04:03:48,835 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 125) no Hoare annotation was computed. [2023-02-16 04:03:48,835 INFO L902 garLoopResultBuilder]: At program point L145(lines 94 147) the Hoare annotation is: true [2023-02-16 04:03:48,835 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2023-02-16 04:03:48,836 INFO L899 garLoopResultBuilder]: For program point L269-2(lines 269 273) no Hoare annotation was computed. [2023-02-16 04:03:48,836 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 142) no Hoare annotation was computed. [2023-02-16 04:03:48,836 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 04:03:48,836 INFO L902 garLoopResultBuilder]: At program point L294-1(lines 294 303) the Hoare annotation is: true [2023-02-16 04:03:48,836 INFO L895 garLoopResultBuilder]: At program point L253(line 253) the Hoare annotation is: (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32)) [2023-02-16 04:03:48,836 INFO L899 garLoopResultBuilder]: For program point L253-1(line 253) no Hoare annotation was computed. [2023-02-16 04:03:48,836 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2023-02-16 04:03:48,837 INFO L899 garLoopResultBuilder]: For program point L113-1(line 113) no Hoare annotation was computed. [2023-02-16 04:03:48,837 INFO L902 garLoopResultBuilder]: At program point addflt_returnLabel#1(lines 84 148) the Hoare annotation is: true [2023-02-16 04:03:48,837 INFO L895 garLoopResultBuilder]: At program point L254(line 254) the Hoare annotation is: (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32)) [2023-02-16 04:03:48,837 INFO L899 garLoopResultBuilder]: For program point L254-1(line 254) no Hoare annotation was computed. [2023-02-16 04:03:48,837 INFO L899 garLoopResultBuilder]: For program point L279(lines 279 312) no Hoare annotation was computed. [2023-02-16 04:03:48,837 INFO L899 garLoopResultBuilder]: For program point L279-1(lines 250 356) no Hoare annotation was computed. [2023-02-16 04:03:48,838 INFO L899 garLoopResultBuilder]: For program point L321(lines 321 325) no Hoare annotation was computed. [2023-02-16 04:03:48,838 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 04:03:48,838 INFO L899 garLoopResultBuilder]: For program point L321-2(lines 321 325) no Hoare annotation was computed. [2023-02-16 04:03:48,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 116) no Hoare annotation was computed. [2023-02-16 04:03:48,838 INFO L899 garLoopResultBuilder]: For program point L280(lines 280 309) no Hoare annotation was computed. [2023-02-16 04:03:48,838 INFO L895 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: (and (= |ULTIMATE.start_main_~zero~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_addflt_~a#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_addflt_~ea~0#1| (_ bv128 32)) (bvlshr |ULTIMATE.start_addflt_~a#1| (_ bv24 32)))) (bvsle (bvadd ((_ sign_extend 1) |ULTIMATE.start_addflt_~ea~0#1|) (bvneg ((_ sign_extend 1) |ULTIMATE.start_addflt_~eb~0#1|))) (_ bv2147483647 33))) [2023-02-16 04:03:48,838 INFO L899 garLoopResultBuilder]: For program point L115-1(line 115) no Hoare annotation was computed. [2023-02-16 04:03:48,838 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point L297(lines 297 301) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point L297-2(lines 297 301) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point L256(lines 256 265) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point L256-2(lines 250 356) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 116) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 290) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L902 garLoopResultBuilder]: At program point L281-2(lines 281 290) the Hoare annotation is: true [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 340) no Hoare annotation was computed. [2023-02-16 04:03:48,839 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 330 346) no Hoare annotation was computed. [2023-02-16 04:03:48,840 INFO L902 garLoopResultBuilder]: At program point $Ultimate##51(lines 318 327) the Hoare annotation is: true [2023-02-16 04:03:48,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 113) no Hoare annotation was computed. [2023-02-16 04:03:48,840 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-02-16 04:03:48,840 INFO L899 garLoopResultBuilder]: For program point L117-2(line 117) no Hoare annotation was computed. [2023-02-16 04:03:48,840 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2023-02-16 04:03:48,840 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-02-16 04:03:48,840 INFO L899 garLoopResultBuilder]: For program point L266-1(lines 266 275) no Hoare annotation was computed. [2023-02-16 04:03:48,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 134) no Hoare annotation was computed. [2023-02-16 04:03:48,840 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2023-02-16 04:03:48,841 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2023-02-16 04:03:48,841 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2023-02-16 04:03:48,841 INFO L899 garLoopResultBuilder]: For program point L17-2(lines 16 21) no Hoare annotation was computed. [2023-02-16 04:03:48,841 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 16 21) no Hoare annotation was computed. [2023-02-16 04:03:48,842 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 21) the Hoare annotation is: true [2023-02-16 04:03:48,842 INFO L899 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2023-02-16 04:03:48,845 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:48,847 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:03:48,852 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,852 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,852 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,856 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,857 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,857 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,858 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:03:48 BoogieIcfgContainer [2023-02-16 04:03:48,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:03:48,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:03:48,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:03:48,860 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:03:48,861 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:32" (3/4) ... [2023-02-16 04:03:48,863 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 04:03:48,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-16 04:03:48,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-16 04:03:48,873 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-02-16 04:03:48,873 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-16 04:03:48,874 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 04:03:48,874 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 04:03:48,889 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) || (m == 0bv32 && __retres4 == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-16 04:03:48,889 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-16 04:03:48,889 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-16 04:03:48,889 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-16 04:03:48,902 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 04:03:48,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:03:48,902 INFO L158 Benchmark]: Toolchain (without parser) took 16969.47ms. Allocated memory is still 81.8MB. Free memory was 58.9MB in the beginning and 32.5MB in the end (delta: 26.4MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2023-02-16 04:03:48,902 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 67.1MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:03:48,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.03ms. Allocated memory is still 81.8MB. Free memory was 58.6MB in the beginning and 44.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 04:03:48,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.75ms. Allocated memory is still 81.8MB. Free memory was 44.1MB in the beginning and 42.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:03:48,903 INFO L158 Benchmark]: Boogie Preprocessor took 53.09ms. Allocated memory is still 81.8MB. Free memory was 42.1MB in the beginning and 40.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:03:48,903 INFO L158 Benchmark]: RCFGBuilder took 445.08ms. Allocated memory is still 81.8MB. Free memory was 40.3MB in the beginning and 44.1MB in the end (delta: -3.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-16 04:03:48,904 INFO L158 Benchmark]: TraceAbstraction took 16128.09ms. Allocated memory is still 81.8MB. Free memory was 43.4MB in the beginning and 37.4MB in the end (delta: 6.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-02-16 04:03:48,904 INFO L158 Benchmark]: Witness Printer took 41.78ms. Allocated memory is still 81.8MB. Free memory was 36.7MB in the beginning and 32.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 04:03:48,905 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.10ms. Allocated memory is still 67.1MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.03ms. Allocated memory is still 81.8MB. Free memory was 58.6MB in the beginning and 44.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.75ms. Allocated memory is still 81.8MB. Free memory was 44.1MB in the beginning and 42.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.09ms. Allocated memory is still 81.8MB. Free memory was 42.1MB in the beginning and 40.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.08ms. Allocated memory is still 81.8MB. Free memory was 40.3MB in the beginning and 44.1MB in the end (delta: -3.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16128.09ms. Allocated memory is still 81.8MB. Free memory was 43.4MB in the beginning and 37.4MB in the end (delta: 6.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 41.78ms. Allocated memory is still 81.8MB. Free memory was 36.7MB in the beginning and 32.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 102 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 6707 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5198 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1323 IncrementalHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 1509 mSDtfsCounter, 1323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1265 GetRequests, 1129 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 210 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 95 PreInvPairs, 133 NumberOfFragments, 207 HoareAnnotationTreeSize, 95 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 7321 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 886 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1217 ConstructedInterpolants, 47 QuantifiedInterpolants, 2673 SizeOfPredicates, 68 NumberOfNonLiveVariables, 1663 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 355/400 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: 29]: Loop Invariant [2023-02-16 04:03:48,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: (((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) || (m == 0bv32 && __retres4 == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant [2023-02-16 04:03:48,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 58]: Loop Invariant [2023-02-16 04:03:48,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 318]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant [2023-02-16 04:03:48,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-16 04:03:48,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-16 04:03:48,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-16 04:03:48,943 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