./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2.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_2.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 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:03:09,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:03:09,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:03:09,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:03:09,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:03:09,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:03:09,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:03:09,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:03:09,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:03:09,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:03:09,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:03:09,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:03:09,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:03:09,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:03:09,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:03:09,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:03:09,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:03:09,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:03:09,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:03:09,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:03:09,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:03:10,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:03:10,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:03:10,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:03:10,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:03:10,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:03:10,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:03:10,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:03:10,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:03:10,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:03:10,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:03:10,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:03:10,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:03:10,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:03:10,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:03:10,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:03:10,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:03:10,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:03:10,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:03:10,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:03:10,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:03:10,015 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:10,035 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:03:10,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:03:10,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:03:10,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:03:10,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:03:10,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:03:10,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:03:10,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:03:10,039 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:03:10,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:03:10,040 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:03:10,040 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:03:10,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 04:03:10,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:03:10,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:03:10,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:03:10,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:03:10,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:03:10,041 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:03:10,041 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:03:10,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:03:10,042 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:03:10,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:03:10,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:03:10,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:03:10,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:03:10,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:10,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:03:10,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:03:10,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:03:10,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 04:03:10,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 04:03:10,044 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:03:10,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:03:10,044 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:03:10,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:03:10,045 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:03:10,045 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 -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2023-02-16 04:03:10,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:03:10,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:03:10,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:03:10,312 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:03:10,312 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:03:10,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2023-02-16 04:03:11,418 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:03:11,616 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:03:11,617 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2023-02-16 04:03:11,625 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1866d92d9/40690a0bd47b493088ad15e2cdae5543/FLAG74bf0ad0e [2023-02-16 04:03:11,638 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1866d92d9/40690a0bd47b493088ad15e2cdae5543 [2023-02-16 04:03:11,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:03:11,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:03:11,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:11,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:03:11,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:03:11,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403bf43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11, skipping insertion in model container [2023-02-16 04:03:11,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:03:11,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:03:11,868 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_2.c.cil.c[727,740] [2023-02-16 04:03:11,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:11,913 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:03:11,922 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_2.c.cil.c[727,740] [2023-02-16 04:03:11,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:03:11,958 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:03:11,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11 WrapperNode [2023-02-16 04:03:11,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:03:11,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:11,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:03:11,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:03:11,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:11,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,019 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181 [2023-02-16 04:03:12,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:03:12,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:03:12,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:03:12,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:03:12,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,063 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:03:12,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:03:12,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:03:12,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:03:12,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (1/1) ... [2023-02-16 04:03:12,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:03:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:12,106 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:12,125 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:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:03:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 04:03:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-16 04:03:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-16 04:03:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:03:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:03:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 04:03:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 04:03:12,224 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:03:12,226 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:03:12,660 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:03:12,668 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:03:12,668 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:03:12,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:12 BoogieIcfgContainer [2023-02-16 04:03:12,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:03:12,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:03:12,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:03:12,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:03:12,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:03:11" (1/3) ... [2023-02-16 04:03:12,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11416da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:12, skipping insertion in model container [2023-02-16 04:03:12,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:03:11" (2/3) ... [2023-02-16 04:03:12,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11416da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:03:12, skipping insertion in model container [2023-02-16 04:03:12,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:12" (3/3) ... [2023-02-16 04:03:12,680 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2023-02-16 04:03:12,691 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:03:12,691 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-16 04:03:12,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:03:12,737 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;@55539b89, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:03:12,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-16 04:03:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 90 states have (on average 1.7) internal successors, (153), 115 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:03:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:03:12,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:12,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:12,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1548318721, now seen corresponding path program 1 times [2023-02-16 04:03:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:12,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284597599] [2023-02-16 04:03:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:03:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284597599] [2023-02-16 04:03:12,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284597599] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:12,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:12,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139878549] [2023-02-16 04:03:12,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:12,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:12,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:12,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:12,987 INFO L87 Difference]: Start difference. First operand has 122 states, 90 states have (on average 1.7) internal successors, (153), 115 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,139 INFO L93 Difference]: Finished difference Result 296 states and 415 transitions. [2023-02-16 04:03:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:13,141 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:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,149 INFO L225 Difference]: With dead ends: 296 [2023-02-16 04:03:13,149 INFO L226 Difference]: Without dead ends: 158 [2023-02-16 04:03:13,153 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:13,156 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 87 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 412 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-16 04:03:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2023-02-16 04:03:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 138 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2023-02-16 04:03:13,231 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 9 [2023-02-16 04:03:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,231 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2023-02-16 04:03:13,232 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:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2023-02-16 04:03:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 04:03:13,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 04:03:13,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:13,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1386908481, now seen corresponding path program 1 times [2023-02-16 04:03:13,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654176429] [2023-02-16 04:03:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,373 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:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654176429] [2023-02-16 04:03:13,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654176429] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:13,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12705115] [2023-02-16 04:03:13,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:13,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:13,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:13,376 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,496 INFO L93 Difference]: Finished difference Result 321 states and 419 transitions. [2023-02-16 04:03:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:13,502 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:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,507 INFO L225 Difference]: With dead ends: 321 [2023-02-16 04:03:13,507 INFO L226 Difference]: Without dead ends: 179 [2023-02-16 04:03:13,509 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:13,510 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 157 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 339 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-16 04:03:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2023-02-16 04:03:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 131 states have (on average 1.534351145038168) internal successors, (201), 152 states have internal predecessors, (201), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2023-02-16 04:03:13,539 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 14 [2023-02-16 04:03:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,540 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2023-02-16 04:03:13,540 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:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2023-02-16 04:03:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 04:03:13,541 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,541 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:13,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 04:03:13,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1595006381, now seen corresponding path program 1 times [2023-02-16 04:03:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802010151] [2023-02-16 04:03:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,672 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:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802010151] [2023-02-16 04:03:13,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802010151] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974810865] [2023-02-16 04:03:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:13,675 INFO L87 Difference]: Start difference. First operand 159 states and 209 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,732 INFO L93 Difference]: Finished difference Result 320 states and 420 transitions. [2023-02-16 04:03:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-16 04:03:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,741 INFO L225 Difference]: With dead ends: 320 [2023-02-16 04:03:13,744 INFO L226 Difference]: Without dead ends: 164 [2023-02-16 04:03:13,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:13,747 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 7 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 345 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-16 04:03:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-02-16 04:03:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.5185185185185186) internal successors, (205), 156 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2023-02-16 04:03:13,771 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 15 [2023-02-16 04:03:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,771 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2023-02-16 04:03:13,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:03:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2023-02-16 04:03:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 04:03:13,772 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,772 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 04:03:13,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash 814606369, now seen corresponding path program 1 times [2023-02-16 04:03:13,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081283608] [2023-02-16 04:03:13,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:13,834 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,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 04:03:13,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:13,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081283608] [2023-02-16 04:03:13,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081283608] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:13,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:13,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:03:13,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998838319] [2023-02-16 04:03:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:13,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:03:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:13,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:03:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:13,846 INFO L87 Difference]: Start difference. First operand 164 states and 213 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:13,876 INFO L93 Difference]: Finished difference Result 170 states and 220 transitions. [2023-02-16 04:03:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:03:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-16 04:03:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:13,878 INFO L225 Difference]: With dead ends: 170 [2023-02-16 04:03:13,878 INFO L226 Difference]: Without dead ends: 169 [2023-02-16 04:03:13,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:03:13,879 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:13,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-16 04:03:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2023-02-16 04:03:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 134 states have (on average 1.507462686567164) internal successors, (202), 154 states have internal predecessors, (202), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 210 transitions. [2023-02-16 04:03:13,891 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 210 transitions. Word has length 23 [2023-02-16 04:03:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:13,891 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 210 transitions. [2023-02-16 04:03:13,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 210 transitions. [2023-02-16 04:03:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 04:03:13,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:13,893 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:13,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 04:03:13,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash 486151468, now seen corresponding path program 1 times [2023-02-16 04:03:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:13,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765042461] [2023-02-16 04:03:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,005 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:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:14,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765042461] [2023-02-16 04:03:14,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765042461] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:14,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:14,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63466438] [2023-02-16 04:03:14,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:14,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:14,012 INFO L87 Difference]: Start difference. First operand 162 states and 210 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:14,057 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2023-02-16 04:03:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:14,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-02-16 04:03:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:14,059 INFO L225 Difference]: With dead ends: 277 [2023-02-16 04:03:14,059 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 04:03:14,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:14,061 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 41 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:14,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 345 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 04:03:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-16 04:03:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 136 states have internal predecessors, (176), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2023-02-16 04:03:14,072 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 22 [2023-02-16 04:03:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:14,073 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2023-02-16 04:03:14,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2023-02-16 04:03:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 04:03:14,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:14,074 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:14,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 04:03:14,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2125647912, now seen corresponding path program 1 times [2023-02-16 04:03:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:14,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125091283] [2023-02-16 04:03:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,135 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:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:14,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125091283] [2023-02-16 04:03:14,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125091283] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:14,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:14,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374836669] [2023-02-16 04:03:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:14,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:14,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:14,138 INFO L87 Difference]: Start difference. First operand 144 states and 184 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:14,231 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2023-02-16 04:03:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:14,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-02-16 04:03:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:14,233 INFO L225 Difference]: With dead ends: 153 [2023-02-16 04:03:14,233 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 04:03:14,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:03:14,237 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 69 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:14,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 422 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:14,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 04:03:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-16 04:03:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 136 states have internal predecessors, (171), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2023-02-16 04:03:14,263 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 22 [2023-02-16 04:03:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:14,263 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2023-02-16 04:03:14,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2023-02-16 04:03:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 04:03:14,265 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:14,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:14,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 04:03:14,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1249763114, now seen corresponding path program 1 times [2023-02-16 04:03:14,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:14,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185199823] [2023-02-16 04:03:14,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 04:03:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185199823] [2023-02-16 04:03:14,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185199823] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:14,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:14,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:03:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630140253] [2023-02-16 04:03:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:03:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:03:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:14,328 INFO L87 Difference]: Start difference. First operand 144 states and 179 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:14,370 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2023-02-16 04:03:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:03:14,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-16 04:03:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:14,372 INFO L225 Difference]: With dead ends: 165 [2023-02-16 04:03:14,372 INFO L226 Difference]: Without dead ends: 162 [2023-02-16 04:03:14,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:03:14,373 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 24 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:14,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 227 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:03:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-16 04:03:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2023-02-16 04:03:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.4426229508196722) internal successors, (176), 141 states have internal predecessors, (176), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2023-02-16 04:03:14,381 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 26 [2023-02-16 04:03:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:14,382 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2023-02-16 04:03:14,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:03:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2023-02-16 04:03:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 04:03:14,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:14,385 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:14,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 04:03:14,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash -465994842, now seen corresponding path program 1 times [2023-02-16 04:03:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:14,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488455058] [2023-02-16 04:03:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:14,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:14,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488455058] [2023-02-16 04:03:14,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488455058] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:14,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176773211] [2023-02-16 04:03:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:14,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:14,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:14,557 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:14,558 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:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:14,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:03:14,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:14,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:14,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176773211] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:14,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:14,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-16 04:03:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369466260] [2023-02-16 04:03:14,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:14,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 04:03:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 04:03:14,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-16 04:03:14,811 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,163 INFO L93 Difference]: Finished difference Result 505 states and 650 transitions. [2023-02-16 04:03:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 04:03:15,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-16 04:03:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,170 INFO L225 Difference]: With dead ends: 505 [2023-02-16 04:03:15,170 INFO L226 Difference]: Without dead ends: 397 [2023-02-16 04:03:15,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2023-02-16 04:03:15,172 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 329 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 568 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-16 04:03:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 169. [2023-02-16 04:03:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.408450704225352) internal successors, (200), 161 states have internal predecessors, (200), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 208 transitions. [2023-02-16 04:03:15,198 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 208 transitions. Word has length 37 [2023-02-16 04:03:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,199 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 208 transitions. [2023-02-16 04:03:15,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 208 transitions. [2023-02-16 04:03:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 04:03:15,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,206 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,214 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:15,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:15,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash -767991458, now seen corresponding path program 1 times [2023-02-16 04:03:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286509336] [2023-02-16 04:03:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 04:03:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:15,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286509336] [2023-02-16 04:03:15,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286509336] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:15,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:15,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420454483] [2023-02-16 04:03:15,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:15,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:15,493 INFO L87 Difference]: Start difference. First operand 169 states and 208 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,569 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2023-02-16 04:03:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:15,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-02-16 04:03:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,572 INFO L225 Difference]: With dead ends: 220 [2023-02-16 04:03:15,572 INFO L226 Difference]: Without dead ends: 217 [2023-02-16 04:03:15,573 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:15,574 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 155 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 344 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-16 04:03:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 196. [2023-02-16 04:03:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 168 states have (on average 1.4285714285714286) internal successors, (240), 187 states have internal predecessors, (240), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2023-02-16 04:03:15,584 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 39 [2023-02-16 04:03:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,584 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2023-02-16 04:03:15,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2023-02-16 04:03:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 04:03:15,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,586 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 04:03:15,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash -796618814, now seen corresponding path program 1 times [2023-02-16 04:03:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353278614] [2023-02-16 04:03:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 04:03:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:15,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353278614] [2023-02-16 04:03:15,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353278614] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:15,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:15,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:03:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051653259] [2023-02-16 04:03:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:15,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:15,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:15,643 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,726 INFO L93 Difference]: Finished difference Result 218 states and 271 transitions. [2023-02-16 04:03:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:15,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-02-16 04:03:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,729 INFO L225 Difference]: With dead ends: 218 [2023-02-16 04:03:15,729 INFO L226 Difference]: Without dead ends: 215 [2023-02-16 04:03:15,730 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:15,730 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 162 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 332 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-16 04:03:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2023-02-16 04:03:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 175 states have (on average 1.4114285714285715) internal successors, (247), 193 states have internal predecessors, (247), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 255 transitions. [2023-02-16 04:03:15,744 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 255 transitions. Word has length 39 [2023-02-16 04:03:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,744 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 255 transitions. [2023-02-16 04:03:15,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 255 transitions. [2023-02-16 04:03:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 04:03:15,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,750 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 04:03:15,751 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -739732565, now seen corresponding path program 1 times [2023-02-16 04:03:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037350436] [2023-02-16 04:03:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:15,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:15,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037350436] [2023-02-16 04:03:15,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037350436] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:03:15,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:03:15,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 04:03:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023736586] [2023-02-16 04:03:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:03:15,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:03:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:03:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:03:15,879 INFO L87 Difference]: Start difference. First operand 202 states and 255 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:15,956 INFO L93 Difference]: Finished difference Result 432 states and 549 transitions. [2023-02-16 04:03:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:03:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-02-16 04:03:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:15,958 INFO L225 Difference]: With dead ends: 432 [2023-02-16 04:03:15,958 INFO L226 Difference]: Without dead ends: 285 [2023-02-16 04:03:15,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:03:15,959 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 60 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:15,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:03:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-02-16 04:03:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 202. [2023-02-16 04:03:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 175 states have (on average 1.4057142857142857) internal successors, (246), 193 states have internal predecessors, (246), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2023-02-16 04:03:15,971 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 44 [2023-02-16 04:03:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:15,972 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2023-02-16 04:03:15,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:03:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2023-02-16 04:03:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 04:03:15,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:15,973 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:15,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 04:03:15,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:15,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:15,974 INFO L85 PathProgramCache]: Analyzing trace with hash -994209911, now seen corresponding path program 1 times [2023-02-16 04:03:15,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:15,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296522903] [2023-02-16 04:03:15,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:15,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:16,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:16,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296522903] [2023-02-16 04:03:16,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296522903] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:16,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448510572] [2023-02-16 04:03:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:16,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:16,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:16,093 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:16,117 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:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:16,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:16,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:16,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448510572] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:16,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:16,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-16 04:03:16,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417305880] [2023-02-16 04:03:16,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:16,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 04:03:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:16,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 04:03:16,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-16 04:03:16,333 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:16,604 INFO L93 Difference]: Finished difference Result 534 states and 677 transitions. [2023-02-16 04:03:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 04:03:16,605 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-16 04:03:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:16,607 INFO L225 Difference]: With dead ends: 534 [2023-02-16 04:03:16,607 INFO L226 Difference]: Without dead ends: 373 [2023-02-16 04:03:16,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-02-16 04:03:16,608 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 159 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:16,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 647 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:03:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-02-16 04:03:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 192. [2023-02-16 04:03:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 165 states have (on average 1.387878787878788) internal successors, (229), 183 states have internal predecessors, (229), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2023-02-16 04:03:16,626 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 49 [2023-02-16 04:03:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:16,626 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2023-02-16 04:03:16,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2023-02-16 04:03:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-16 04:03:16,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:16,627 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:16,634 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:16,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-16 04:03:16,835 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:16,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1453329379, now seen corresponding path program 1 times [2023-02-16 04:03:16,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:16,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667966543] [2023-02-16 04:03:16,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:17,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:17,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667966543] [2023-02-16 04:03:17,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667966543] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:17,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743548519] [2023-02-16 04:03:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:17,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:17,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:17,005 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:17,008 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:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:17,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:03:17,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:17,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:17,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743548519] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:17,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:17,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-16 04:03:17,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897890109] [2023-02-16 04:03:17,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:17,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 04:03:17,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:17,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 04:03:17,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-16 04:03:17,431 INFO L87 Difference]: Start difference. First operand 192 states and 237 transitions. Second operand has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:18,094 INFO L93 Difference]: Finished difference Result 1152 states and 1491 transitions. [2023-02-16 04:03:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-16 04:03:18,094 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2023-02-16 04:03:18,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:18,098 INFO L225 Difference]: With dead ends: 1152 [2023-02-16 04:03:18,099 INFO L226 Difference]: Without dead ends: 1011 [2023-02-16 04:03:18,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=740, Invalid=1152, Unknown=0, NotChecked=0, Total=1892 [2023-02-16 04:03:18,101 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 881 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:18,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 980 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 04:03:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-02-16 04:03:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 242. [2023-02-16 04:03:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 233 states have internal predecessors, (290), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 298 transitions. [2023-02-16 04:03:18,128 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 298 transitions. Word has length 62 [2023-02-16 04:03:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:18,129 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 298 transitions. [2023-02-16 04:03:18,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 298 transitions. [2023-02-16 04:03:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-16 04:03:18,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:18,130 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:18,139 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:18,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:18,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -420611575, now seen corresponding path program 2 times [2023-02-16 04:03:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:18,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814262931] [2023-02-16 04:03:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:18,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:18,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814262931] [2023-02-16 04:03:18,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814262931] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:18,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927151327] [2023-02-16 04:03:18,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:03:18,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:18,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:18,575 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:18,601 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:18,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 04:03:18,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:03:18,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 04:03:18,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:18,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:19,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927151327] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:19,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:19,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-16 04:03:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778180412] [2023-02-16 04:03:19,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:19,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 04:03:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 04:03:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-16 04:03:19,059 INFO L87 Difference]: Start difference. First operand 242 states and 298 transitions. Second operand has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:31,174 INFO L93 Difference]: Finished difference Result 734 states and 929 transitions. [2023-02-16 04:03:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 04:03:31,175 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2023-02-16 04:03:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:31,178 INFO L225 Difference]: With dead ends: 734 [2023-02-16 04:03:31,178 INFO L226 Difference]: Without dead ends: 573 [2023-02-16 04:03:31,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=502, Invalid=902, Unknown=2, NotChecked=0, Total=1406 [2023-02-16 04:03:31,179 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 354 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:31,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1753 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 04:03:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-02-16 04:03:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 232. [2023-02-16 04:03:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 223 states have internal predecessors, (269), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 277 transitions. [2023-02-16 04:03:31,200 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 277 transitions. Word has length 69 [2023-02-16 04:03:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:31,201 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 277 transitions. [2023-02-16 04:03:31,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:03:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 277 transitions. [2023-02-16 04:03:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-16 04:03:31,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:31,202 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:31,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:31,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:31,409 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:31,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1581803805, now seen corresponding path program 2 times [2023-02-16 04:03:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:31,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029703166] [2023-02-16 04:03:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:31,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:31,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029703166] [2023-02-16 04:03:31,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029703166] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:31,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521338024] [2023-02-16 04:03:31,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:03:31,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:31,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:31,941 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:31,944 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:32,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 04:03:32,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:03:32,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 04:03:32,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:32,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:32,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521338024] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:32,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:32,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-16 04:03:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797254711] [2023-02-16 04:03:32,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:32,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-16 04:03:32,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-16 04:03:32,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-16 04:03:32,935 INFO L87 Difference]: Start difference. First operand 232 states and 277 transitions. Second operand has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:03:34,637 INFO L93 Difference]: Finished difference Result 2040 states and 2659 transitions. [2023-02-16 04:03:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-02-16 04:03:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2023-02-16 04:03:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:03:34,644 INFO L225 Difference]: With dead ends: 2040 [2023-02-16 04:03:34,644 INFO L226 Difference]: Without dead ends: 1899 [2023-02-16 04:03:34,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2696, Invalid=4276, Unknown=0, NotChecked=0, Total=6972 [2023-02-16 04:03:34,647 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1787 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 04:03:34,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 1329 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 04:03:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2023-02-16 04:03:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 322. [2023-02-16 04:03:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 295 states have (on average 1.2813559322033898) internal successors, (378), 313 states have internal predecessors, (378), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:03:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 386 transitions. [2023-02-16 04:03:34,695 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 386 transitions. Word has length 102 [2023-02-16 04:03:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:03:34,695 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 386 transitions. [2023-02-16 04:03:34,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 04:03:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 386 transitions. [2023-02-16 04:03:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-16 04:03:34,697 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:03:34,697 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:03:34,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 04:03:34,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 04:03:34,903 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:03:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:03:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2024534263, now seen corresponding path program 3 times [2023-02-16 04:03:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:03:34,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963863692] [2023-02-16 04:03:34,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:03:34,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:03:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 04:03:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 04:03:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:03:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:03:35,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963863692] [2023-02-16 04:03:35,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963863692] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:03:35,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072182996] [2023-02-16 04:03:35,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 04:03:35,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:03:35,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:03:35,493 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:35,496 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:35,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-02-16 04:03:35,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:03:35,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-16 04:03:35,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:03:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:36,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:03:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:03:36,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072182996] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:03:36,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:03:36,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2023-02-16 04:03:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282121912] [2023-02-16 04:03:36,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:03:36,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-16 04:03:36,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:03:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-16 04:03:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=1735, Unknown=0, NotChecked=0, Total=2352 [2023-02-16 04:03:36,799 INFO L87 Difference]: Start difference. First operand 322 states and 386 transitions. Second operand has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:04:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:40,022 INFO L93 Difference]: Finished difference Result 1054 states and 1332 transitions. [2023-02-16 04:04:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-16 04:04:40,022 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 109 [2023-02-16 04:04:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:40,025 INFO L225 Difference]: With dead ends: 1054 [2023-02-16 04:04:40,025 INFO L226 Difference]: Without dead ends: 893 [2023-02-16 04:04:40,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 194 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=1686, Invalid=3712, Unknown=4, NotChecked=0, Total=5402 [2023-02-16 04:04:40,027 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 971 mSDsluCounter, 3828 mSDsCounter, 0 mSdLazyCounter, 3094 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 4048 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:40,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 4048 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3094 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-16 04:04:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-02-16 04:04:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 322. [2023-02-16 04:04:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 295 states have (on average 1.2474576271186442) internal successors, (368), 313 states have internal predecessors, (368), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 376 transitions. [2023-02-16 04:04:40,057 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 376 transitions. Word has length 109 [2023-02-16 04:04:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:40,058 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 376 transitions. [2023-02-16 04:04:40,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:04:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 376 transitions. [2023-02-16 04:04:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-02-16 04:04:40,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:40,059 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:40,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 04:04:40,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-16 04:04:40,266 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 528449865, now seen corresponding path program 4 times [2023-02-16 04:04:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:04:40,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159680543] [2023-02-16 04:04:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:04:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:04:40,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:04:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:04:40,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:04:40,348 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 04:04:40,349 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-16 04:04:40,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-16 04:04:40,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-16 04:04:40,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-16 04:04:40,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-16 04:04:40,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-16 04:04:40,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-16 04:04:40,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-16 04:04:40,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-16 04:04:40,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-16 04:04:40,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-16 04:04:40,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-16 04:04:40,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-16 04:04:40,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-16 04:04:40,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-16 04:04:40,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-16 04:04:40,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-16 04:04:40,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-16 04:04:40,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-16 04:04:40,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-16 04:04:40,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-16 04:04:40,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-16 04:04:40,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-16 04:04:40,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-16 04:04:40,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 04:04:40,357 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:40,361 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:04:40,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:04:40 BoogieIcfgContainer [2023-02-16 04:04:40,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:04:40,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:04:40,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:04:40,438 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:04:40,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:03:12" (3/4) ... [2023-02-16 04:04:40,441 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 04:04:40,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:04:40,442 INFO L158 Benchmark]: Toolchain (without parser) took 88799.70ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 107.9MB in the beginning and 87.3MB in the end (delta: 20.6MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2023-02-16 04:04:40,442 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:04:40,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.98ms. Allocated memory is still 144.7MB. Free memory was 107.5MB in the beginning and 111.5MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 04:04:40,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.24ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:04:40,443 INFO L158 Benchmark]: Boogie Preprocessor took 53.25ms. Allocated memory is still 144.7MB. Free memory was 109.4MB in the beginning and 107.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:04:40,443 INFO L158 Benchmark]: RCFGBuilder took 597.01ms. Allocated memory is still 144.7MB. Free memory was 107.3MB in the beginning and 85.1MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-16 04:04:40,444 INFO L158 Benchmark]: TraceAbstraction took 87763.26ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 84.2MB in the beginning and 88.3MB in the end (delta: -4.1MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2023-02-16 04:04:40,444 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 251.7MB. Free memory was 88.3MB in the beginning and 87.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:04:40,446 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.17ms. Allocated memory is still 119.5MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.98ms. Allocated memory is still 144.7MB. Free memory was 107.5MB in the beginning and 111.5MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.24ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.25ms. Allocated memory is still 144.7MB. Free memory was 109.4MB in the beginning and 107.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 597.01ms. Allocated memory is still 144.7MB. Free memory was 107.3MB in the beginning and 85.1MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 87763.26ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 84.2MB in the beginning and 88.3MB in the end (delta: -4.1MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 251.7MB. Free memory was 88.3MB in the beginning and 87.3MB 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: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sa ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR (e + 128) << 24U VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464, e=-24, m=0, res=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=0, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 122 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 87.6s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 79.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5253 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5247 mSDsluCounter, 12637 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10651 mSDsCounter, 707 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6327 IncrementalHoareTripleChecker+Invalid, 7034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 707 mSolverCounterUnsat, 1986 mSDtfsCounter, 6327 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 864 SyntacticMatches, 8 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4515 ImplicationChecksByTransitivity, 75.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=15, InterpolantAutomatonStates: 253, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3849 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1268 NumberOfCodeBlocks, 1268 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1509 ConstructedInterpolants, 0 QuantifiedInterpolants, 7845 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 304/3646 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-16 04:04:40,545 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_2.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 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:04:42,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:04:42,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:04:42,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:04:42,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:04:42,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:04:42,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:04:42,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:04:42,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:04:42,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:04:42,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:04:42,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:04:42,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:04:42,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:04:42,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:04:42,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:04:42,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:04:42,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:04:42,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:04:42,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:04:42,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:04:42,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:04:42,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:04:42,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:04:42,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:04:42,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:04:42,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:04:42,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:04:42,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:04:42,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:04:42,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:04:42,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:04:42,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:04:42,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:04:42,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:04:42,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:04:42,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:04:42,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:04:42,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:04:42,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:04:42,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:04:42,551 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:04:42,581 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:04:42,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:04:42,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:04:42,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:04:42,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:04:42,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:04:42,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:04:42,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:04:42,585 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:04:42,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:04:42,586 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:04:42,586 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:04:42,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:04:42,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:04:42,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:04:42,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:04:42,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:04:42,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 04:04:42,587 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 04:04:42,587 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:04:42,587 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 04:04:42,588 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:04:42,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:04:42,588 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:04:42,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:04:42,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:04:42,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:04:42,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:04:42,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:04:42,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:04:42,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:04:42,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:04:42,590 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 04:04:42,590 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 04:04:42,590 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:04:42,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:04:42,590 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:04:42,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:04:42,591 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 04:04:42,591 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:04:42,591 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 -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2023-02-16 04:04:42,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:04:42,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:04:42,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:04:42,895 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:04:42,895 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:04:42,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2023-02-16 04:04:43,994 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:04:44,246 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:04:44,252 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2023-02-16 04:04:44,266 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37c22323/3bb0e81a3fbb438ba6ed6f2b4cb8aacb/FLAG6c71f897e [2023-02-16 04:04:44,276 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37c22323/3bb0e81a3fbb438ba6ed6f2b4cb8aacb [2023-02-16 04:04:44,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:04:44,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:04:44,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:04:44,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:04:44,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:04:44,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdf472c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44, skipping insertion in model container [2023-02-16 04:04:44,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:04:44,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:04:44,476 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_2.c.cil.c[727,740] [2023-02-16 04:04:44,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:04:44,562 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:04:44,578 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_2.c.cil.c[727,740] [2023-02-16 04:04:44,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:04:44,635 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:04:44,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44 WrapperNode [2023-02-16 04:04:44,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:04:44,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:04:44,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:04:44,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:04:44,644 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:04:44" (1/1) ... [2023-02-16 04:04:44,662 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:04:44" (1/1) ... [2023-02-16 04:04:44,688 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2023-02-16 04:04:44,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:04:44,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:04:44,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:04:44,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:04:44,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,760 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:04:44,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:04:44,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:04:44,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:04:44,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (1/1) ... [2023-02-16 04:04:44,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:04:44,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:04:44,814 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:04:44,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 04:04:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:04:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 04:04:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-16 04:04:44,864 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-16 04:04:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:04:44,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:04:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 04:04:44,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 04:04:44,948 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:04:44,950 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:04:45,329 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:04:45,335 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:04:45,336 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:04:45,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:04:45 BoogieIcfgContainer [2023-02-16 04:04:45,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:04:45,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:04:45,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:04:45,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:04:45,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:04:44" (1/3) ... [2023-02-16 04:04:45,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57783025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:04:45, skipping insertion in model container [2023-02-16 04:04:45,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:04:44" (2/3) ... [2023-02-16 04:04:45,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57783025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:04:45, skipping insertion in model container [2023-02-16 04:04:45,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:04:45" (3/3) ... [2023-02-16 04:04:45,345 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2023-02-16 04:04:45,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:04:45,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-16 04:04:45,416 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:04:45,422 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;@4f933b3b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:04:45,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-16 04:04:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 92 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 04:04:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:04:45,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:45,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:45,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:45,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1525933714, now seen corresponding path program 1 times [2023-02-16 04:04:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:45,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076385793] [2023-02-16 04:04:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:45,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:04:45,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:45,457 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:04:45,458 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:04:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:45,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 04:04:45,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:45,549 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:04:45,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:04:45,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076385793] [2023-02-16 04:04:45,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076385793] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:04:45,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:04:45,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-16 04:04:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497936698] [2023-02-16 04:04:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:04:45,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 04:04:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:45,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 04:04:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 04:04:45,581 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 92 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:04:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:45,623 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2023-02-16 04:04:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 04:04:45,625 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:04:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:45,631 INFO L225 Difference]: With dead ends: 185 [2023-02-16 04:04:45,631 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 04:04:45,634 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:04:45,637 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:45,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:04:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 04:04:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-16 04:04:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 67 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2023-02-16 04:04:45,683 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 9 [2023-02-16 04:04:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:45,683 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2023-02-16 04:04:45,684 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:04:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2023-02-16 04:04:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 04:04:45,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:45,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:45,698 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:04:45,894 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:04:45,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1524992448, now seen corresponding path program 1 times [2023-02-16 04:04:45,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:45,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968291760] [2023-02-16 04:04:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:45,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:04:45,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:45,898 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:04:45,900 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:04:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:45,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:04:45,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:45,972 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:04:45,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:04:45,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:45,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968291760] [2023-02-16 04:04:45,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968291760] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:04:45,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:04:45,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:04:45,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400496470] [2023-02-16 04:04:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:04:45,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:04:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:45,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:04:45,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:04:45,976 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:04:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:46,054 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2023-02-16 04:04:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:04:46,056 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:04:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:46,060 INFO L225 Difference]: With dead ends: 151 [2023-02-16 04:04:46,061 INFO L226 Difference]: Without dead ends: 81 [2023-02-16 04:04:46,064 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:04:46,067 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:46,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 232 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:04:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-16 04:04:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-02-16 04:04:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.396551724137931) internal successors, (81), 71 states have internal predecessors, (81), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-16 04:04:46,082 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 9 [2023-02-16 04:04:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:46,083 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-16 04:04:46,083 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:04:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-16 04:04:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 04:04:46,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:46,084 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:46,097 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:04:46,298 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:04:46,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1370428688, now seen corresponding path program 1 times [2023-02-16 04:04:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:46,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343249149] [2023-02-16 04:04:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:46,300 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:04:46,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:46,302 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:04:46,303 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:04:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:46,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:04:46,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:46,356 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:04:46,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:04:46,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:46,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343249149] [2023-02-16 04:04:46,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343249149] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:04:46,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:04:46,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:04:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867387409] [2023-02-16 04:04:46,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:04:46,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:04:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:04:46,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:04:46,360 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:46,444 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2023-02-16 04:04:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:04:46,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-16 04:04:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:46,446 INFO L225 Difference]: With dead ends: 193 [2023-02-16 04:04:46,446 INFO L226 Difference]: Without dead ends: 125 [2023-02-16 04:04:46,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:04:46,448 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 67 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:46,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 214 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:04:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-16 04:04:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2023-02-16 04:04:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 106 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2023-02-16 04:04:46,460 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 16 [2023-02-16 04:04:46,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:46,461 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2023-02-16 04:04:46,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2023-02-16 04:04:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 04:04:46,462 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:46,462 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:04:46,477 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:04:46,670 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:04:46,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1635050763, now seen corresponding path program 1 times [2023-02-16 04:04:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:46,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467717650] [2023-02-16 04:04:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:46,672 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:04:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:46,673 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:04:46,674 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:04:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:46,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:04:46,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:46,723 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:04:46,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:04:46,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:46,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467717650] [2023-02-16 04:04:46,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467717650] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:04:46,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:04:46,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:04:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204865837] [2023-02-16 04:04:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:04:46,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:04:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:46,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:04:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:04:46,726 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:46,791 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2023-02-16 04:04:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:04:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-16 04:04:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:46,793 INFO L225 Difference]: With dead ends: 197 [2023-02-16 04:04:46,793 INFO L226 Difference]: Without dead ends: 104 [2023-02-16 04:04:46,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:04:46,795 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:46,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 235 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:04:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-16 04:04:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-02-16 04:04:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 90 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-02-16 04:04:46,806 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 21 [2023-02-16 04:04:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:46,807 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-02-16 04:04:46,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-02-16 04:04:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 04:04:46,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:46,808 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:04:46,821 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:04:47,016 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:04:47,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1476687918, now seen corresponding path program 1 times [2023-02-16 04:04:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:47,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382420080] [2023-02-16 04:04:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:47,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:04:47,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:47,020 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:04:47,028 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:04:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:47,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:04:47,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:47,111 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:04:47,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:04:47,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:47,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382420080] [2023-02-16 04:04:47,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382420080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:04:47,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:04:47,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 04:04:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933052858] [2023-02-16 04:04:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:04:47,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:04:47,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:47,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:04:47,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:04:47,119 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:47,197 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2023-02-16 04:04:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:04:47,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-16 04:04:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:47,199 INFO L225 Difference]: With dead ends: 190 [2023-02-16 04:04:47,199 INFO L226 Difference]: Without dead ends: 113 [2023-02-16 04:04:47,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:04:47,201 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 44 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:47,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 310 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:04:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-16 04:04:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2023-02-16 04:04:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 92 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2023-02-16 04:04:47,210 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 21 [2023-02-16 04:04:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:47,210 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2023-02-16 04:04:47,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2023-02-16 04:04:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 04:04:47,211 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:47,211 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:47,223 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:04:47,420 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:04:47,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1476578814, now seen corresponding path program 1 times [2023-02-16 04:04:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386786998] [2023-02-16 04:04:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:47,422 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:04:47,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:47,423 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:04:47,424 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:04:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:47,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:04:47,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:04:47,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:04:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:04:47,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:47,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386786998] [2023-02-16 04:04:47,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386786998] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:04:47,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:04:47,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-16 04:04:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256236067] [2023-02-16 04:04:47,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:04:47,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 04:04:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:04:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:04:47,595 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:48,087 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2023-02-16 04:04:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:04:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-16 04:04:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:48,089 INFO L225 Difference]: With dead ends: 217 [2023-02-16 04:04:48,090 INFO L226 Difference]: Without dead ends: 146 [2023-02-16 04:04:48,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-02-16 04:04:48,091 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 192 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:48,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 320 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 04:04:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-16 04:04:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2023-02-16 04:04:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.345679012345679) internal successors, (109), 93 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2023-02-16 04:04:48,102 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 21 [2023-02-16 04:04:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:48,103 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2023-02-16 04:04:48,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2023-02-16 04:04:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 04:04:48,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:48,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:48,113 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:04:48,313 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:04:48,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -547019776, now seen corresponding path program 1 times [2023-02-16 04:04:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:48,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719312225] [2023-02-16 04:04:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:48,314 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:04:48,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:48,315 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:04:48,318 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:04:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:48,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:04:48,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:04:48,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:04:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:04:48,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719312225] [2023-02-16 04:04:48,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719312225] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:04:48,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:04:48,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-16 04:04:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861833347] [2023-02-16 04:04:48,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:04:48,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 04:04:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 04:04:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:04:48,447 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:48,649 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2023-02-16 04:04:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 04:04:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-16 04:04:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:48,650 INFO L225 Difference]: With dead ends: 217 [2023-02-16 04:04:48,650 INFO L226 Difference]: Without dead ends: 141 [2023-02-16 04:04:48,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2023-02-16 04:04:48,652 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 155 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:48,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 447 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:04:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-16 04:04:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2023-02-16 04:04:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 111 states have internal predecessors, (130), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2023-02-16 04:04:48,664 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 26 [2023-02-16 04:04:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:48,664 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2023-02-16 04:04:48,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2023-02-16 04:04:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 04:04:48,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:48,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:48,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-16 04:04:48,877 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:04:48,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:48,878 INFO L85 PathProgramCache]: Analyzing trace with hash -198921976, now seen corresponding path program 1 times [2023-02-16 04:04:48,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:48,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778664370] [2023-02-16 04:04:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:48,879 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:04:48,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:48,880 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:04:48,883 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:04:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:48,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:04:48,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:04:48,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:04:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:04:49,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:49,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778664370] [2023-02-16 04:04:49,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778664370] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:04:49,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:04:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-16 04:04:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849128844] [2023-02-16 04:04:49,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:04:49,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 04:04:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 04:04:49,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:04:49,188 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:04:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:49,758 INFO L93 Difference]: Finished difference Result 307 states and 370 transitions. [2023-02-16 04:04:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 04:04:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-02-16 04:04:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:49,761 INFO L225 Difference]: With dead ends: 307 [2023-02-16 04:04:49,761 INFO L226 Difference]: Without dead ends: 234 [2023-02-16 04:04:49,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-16 04:04:49,762 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 155 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:49,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 427 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:04:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-16 04:04:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 121. [2023-02-16 04:04:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 113 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2023-02-16 04:04:49,781 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 38 [2023-02-16 04:04:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:49,781 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2023-02-16 04:04:49,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:04:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2023-02-16 04:04:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 04:04:49,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:49,782 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:49,796 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:04:49,991 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:04:49,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1144709760, now seen corresponding path program 2 times [2023-02-16 04:04:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:49,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859975745] [2023-02-16 04:04:49,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:04:49,993 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:04:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:50,025 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:04:50,027 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:04:50,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 04:04:50,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:04:50,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 04:04:50,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:04:50,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:04:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:04:50,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:50,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859975745] [2023-02-16 04:04:50,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859975745] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:04:50,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:04:50,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-16 04:04:50,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848985282] [2023-02-16 04:04:50,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:04:50,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 04:04:50,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:50,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 04:04:50,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-02-16 04:04:50,370 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:50,933 INFO L93 Difference]: Finished difference Result 275 states and 320 transitions. [2023-02-16 04:04:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 04:04:50,934 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-16 04:04:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:50,935 INFO L225 Difference]: With dead ends: 275 [2023-02-16 04:04:50,935 INFO L226 Difference]: Without dead ends: 199 [2023-02-16 04:04:50,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2023-02-16 04:04:50,936 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 238 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:50,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 992 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:04:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-16 04:04:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2023-02-16 04:04:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 151 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2023-02-16 04:04:50,953 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 46 [2023-02-16 04:04:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:50,953 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2023-02-16 04:04:50,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:04:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2023-02-16 04:04:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-16 04:04:50,955 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:50,955 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:50,965 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:04:51,163 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:04:51,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash -321230200, now seen corresponding path program 2 times [2023-02-16 04:04:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:51,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625514077] [2023-02-16 04:04:51,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:04:51,165 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:04:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:51,166 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:04:51,169 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:04:51,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 04:04:51,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:04:51,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:04:51,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-16 04:04:51,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:04:51,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:51,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625514077] [2023-02-16 04:04:51,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625514077] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:04:51,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:04:51,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:04:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498366289] [2023-02-16 04:04:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:04:51,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:04:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:04:51,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:04:51,210 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:04:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:51,243 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2023-02-16 04:04:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:04:51,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2023-02-16 04:04:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:51,247 INFO L225 Difference]: With dead ends: 165 [2023-02-16 04:04:51,247 INFO L226 Difference]: Without dead ends: 164 [2023-02-16 04:04:51,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:04:51,248 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:51,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 152 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:04:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-16 04:04:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2023-02-16 04:04:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 150 states have internal predecessors, (173), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2023-02-16 04:04:51,265 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 58 [2023-02-16 04:04:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:51,266 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2023-02-16 04:04:51,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:04:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2023-02-16 04:04:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-16 04:04:51,267 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:51,268 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:51,279 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:04:51,476 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:04:51,476 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:51,477 INFO L85 PathProgramCache]: Analyzing trace with hash -321162674, now seen corresponding path program 1 times [2023-02-16 04:04:51,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:51,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207700460] [2023-02-16 04:04:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:04:51,477 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:04:51,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:51,478 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:04:51,479 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:04:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:04:51,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:04:51,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:04:51,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:04:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:04:52,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207700460] [2023-02-16 04:04:52,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207700460] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:04:52,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:04:52,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-16 04:04:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351706610] [2023-02-16 04:04:52,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:04:52,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 04:04:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:52,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 04:04:52,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-16 04:04:52,274 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:04:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:04:54,247 INFO L93 Difference]: Finished difference Result 484 states and 595 transitions. [2023-02-16 04:04:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 04:04:54,248 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2023-02-16 04:04:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:04:54,250 INFO L225 Difference]: With dead ends: 484 [2023-02-16 04:04:54,250 INFO L226 Difference]: Without dead ends: 412 [2023-02-16 04:04:54,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2023-02-16 04:04:54,252 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 687 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:04:54,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 853 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-16 04:04:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-02-16 04:04:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 160. [2023-02-16 04:04:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 152 states have internal predecessors, (168), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:04:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2023-02-16 04:04:54,273 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 58 [2023-02-16 04:04:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:04:54,273 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2023-02-16 04:04:54,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:04:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2023-02-16 04:04:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-16 04:04:54,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:04:54,274 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:04:54,286 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:04:54,484 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:04:54,485 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:04:54,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:04:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1322135424, now seen corresponding path program 3 times [2023-02-16 04:04:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:04:54,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532877057] [2023-02-16 04:04:54,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 04:04:54,486 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:04:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:04:54,487 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:04:54,490 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:04:54,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-16 04:04:54,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:04:54,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 04:04:54,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:04:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:04:54,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:04:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:04:55,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:04:55,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532877057] [2023-02-16 04:04:55,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532877057] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:04:55,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:04:55,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-02-16 04:04:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608743776] [2023-02-16 04:04:55,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:04:55,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-16 04:04:55,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:04:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-16 04:04:55,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2023-02-16 04:04:55,504 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:05:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:05:00,660 INFO L93 Difference]: Finished difference Result 564 states and 669 transitions. [2023-02-16 04:05:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-02-16 04:05:00,660 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2023-02-16 04:05:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:05:00,662 INFO L225 Difference]: With dead ends: 564 [2023-02-16 04:05:00,663 INFO L226 Difference]: Without dead ends: 489 [2023-02-16 04:05:00,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2023-02-16 04:05:00,665 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 731 mSDsluCounter, 4122 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 4361 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:05:00,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 4361 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 04:05:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-02-16 04:05:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 238. [2023-02-16 04:05:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 219 states have (on average 1.1963470319634704) internal successors, (262), 230 states have internal predecessors, (262), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:05:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2023-02-16 04:05:00,697 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 86 [2023-02-16 04:05:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:05:00,698 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2023-02-16 04:05:00,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:05:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2023-02-16 04:05:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-16 04:05:00,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:05:00,699 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:05:00,710 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:05:00,907 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:05:00,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:05:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:05:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1110203058, now seen corresponding path program 2 times [2023-02-16 04:05:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:05:00,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905017566] [2023-02-16 04:05:00,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:05:00,909 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:05:00,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:05:00,910 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:05:00,911 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:05:00,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 04:05:00,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:05:00,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 04:05:00,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:05:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:05:01,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:05:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:05:02,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:05:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905017566] [2023-02-16 04:05:02,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905017566] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:05:02,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:05:02,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-16 04:05:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521290000] [2023-02-16 04:05:02,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:05:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-16 04:05:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:05:02,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-16 04:05:02,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2023-02-16 04:05:02,668 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:05:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:05:10,955 INFO L93 Difference]: Finished difference Result 853 states and 1065 transitions. [2023-02-16 04:05:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-16 04:05:10,956 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 98 [2023-02-16 04:05:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:05:10,959 INFO L225 Difference]: With dead ends: 853 [2023-02-16 04:05:10,959 INFO L226 Difference]: Without dead ends: 781 [2023-02-16 04:05:10,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 185 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2023-02-16 04:05:10,961 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1161 mSDsluCounter, 2290 mSDsCounter, 0 mSdLazyCounter, 4114 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 4114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-16 04:05:10,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 2438 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 4114 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-02-16 04:05:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-02-16 04:05:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 240. [2023-02-16 04:05:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 221 states have (on average 1.1266968325791855) internal successors, (249), 232 states have internal predecessors, (249), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:05:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 257 transitions. [2023-02-16 04:05:10,993 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 257 transitions. Word has length 98 [2023-02-16 04:05:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:05:10,993 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 257 transitions. [2023-02-16 04:05:10,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 04:05:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 257 transitions. [2023-02-16 04:05:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-16 04:05:10,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:05:10,995 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:05:11,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-02-16 04:05:11,203 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:05:11,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:05:11,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:05:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2098489280, now seen corresponding path program 4 times [2023-02-16 04:05:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:05:11,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991350596] [2023-02-16 04:05:11,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 04:05:11,205 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:05:11,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:05:11,206 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:05:11,207 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:05:11,260 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 04:05:11,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:05:11,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-16 04:05:11,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:05:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:05:11,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:05:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:05:13,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:05:13,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991350596] [2023-02-16 04:05:13,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991350596] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:05:13,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 04:05:13,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-16 04:05:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14584380] [2023-02-16 04:05:13,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 04:05:13,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-16 04:05:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:05:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-16 04:05:13,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2023-02-16 04:05:13,759 INFO L87 Difference]: Start difference. First operand 240 states and 257 transitions. Second operand has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:05:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:05:44,484 INFO L93 Difference]: Finished difference Result 490 states and 558 transitions. [2023-02-16 04:05:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-02-16 04:05:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2023-02-16 04:05:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:05:44,490 INFO L225 Difference]: With dead ends: 490 [2023-02-16 04:05:44,490 INFO L226 Difference]: Without dead ends: 486 [2023-02-16 04:05:44,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2023-02-16 04:05:44,495 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 1073 mSDsluCounter, 4252 mSDsCounter, 0 mSdLazyCounter, 4162 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 4365 SdHoareTripleChecker+Invalid, 4315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 4162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:05:44,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 4365 Invalid, 4315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 4162 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-02-16 04:05:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-02-16 04:05:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 364. [2023-02-16 04:05:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 345 states have (on average 1.2115942028985507) internal successors, (418), 356 states have internal predecessors, (418), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:05:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 426 transitions. [2023-02-16 04:05:44,562 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 426 transitions. Word has length 136 [2023-02-16 04:05:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:05:44,563 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 426 transitions. [2023-02-16 04:05:44,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 04:05:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 426 transitions. [2023-02-16 04:05:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-16 04:05:44,564 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:05:44,564 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:05:44,576 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:05:44,773 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:05:44,773 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:05:44,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:05:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1305368822, now seen corresponding path program 1 times [2023-02-16 04:05:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:05:44,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545430058] [2023-02-16 04:05:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:05:44,774 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:05:44,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:05:44,775 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:05:44,776 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:05:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:05:44,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:05:44,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:05:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-02-16 04:05:44,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:05:44,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 04:05:44,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545430058] [2023-02-16 04:05:44,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545430058] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:05:44,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:05:44,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:05:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983443121] [2023-02-16 04:05:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:05:44,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:05:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 04:05:44,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:05:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:05:44,888 INFO L87 Difference]: Start difference. First operand 364 states and 426 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:05:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:05:45,066 INFO L93 Difference]: Finished difference Result 382 states and 447 transitions. [2023-02-16 04:05:45,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:05:45,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2023-02-16 04:05:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:05:45,069 INFO L225 Difference]: With dead ends: 382 [2023-02-16 04:05:45,069 INFO L226 Difference]: Without dead ends: 379 [2023-02-16 04:05:45,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:05:45,070 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 63 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:05:45,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 171 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:05:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-02-16 04:05:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2023-02-16 04:05:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 352 states have (on average 1.2102272727272727) internal successors, (426), 363 states have internal predecessors, (426), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 04:05:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 434 transitions. [2023-02-16 04:05:45,141 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 434 transitions. Word has length 152 [2023-02-16 04:05:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:05:45,142 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 434 transitions. [2023-02-16 04:05:45,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 04:05:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 434 transitions. [2023-02-16 04:05:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-02-16 04:05:45,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:05:45,143 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:05:45,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-16 04:05:45,352 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:05:45,352 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-16 04:05:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:05:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1608575873, now seen corresponding path program 1 times [2023-02-16 04:05:45,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 04:05:45,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452505976] [2023-02-16 04:05:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:05:45,354 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:05:45,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 04:05:45,355 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:05:45,357 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:05:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:05:45,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:05:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:05:45,529 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-16 04:05:45,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 04:05:45,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-16 04:05:45,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-16 04:05:45,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-16 04:05:45,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-16 04:05:45,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-16 04:05:45,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-16 04:05:45,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-16 04:05:45,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-16 04:05:45,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-16 04:05:45,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-16 04:05:45,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-16 04:05:45,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-16 04:05:45,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-16 04:05:45,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-16 04:05:45,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-16 04:05:45,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-16 04:05:45,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-16 04:05:45,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-16 04:05:45,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-16 04:05:45,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-16 04:05:45,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-16 04:05:45,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-16 04:05:45,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-16 04:05:45,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-16 04:05:45,548 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:05:45,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 04:05:45,748 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:05:45,751 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:05:45,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:05:45 BoogieIcfgContainer [2023-02-16 04:05:45,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:05:45,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:05:45,808 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:05:45,809 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:05:45,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:04:45" (3/4) ... [2023-02-16 04:05:45,811 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 04:05:45,914 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 04:05:45,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:05:45,915 INFO L158 Benchmark]: Toolchain (without parser) took 61635.74ms. Allocated memory was 69.2MB in the beginning and 130.0MB in the end (delta: 60.8MB). Free memory was 46.4MB in the beginning and 82.6MB in the end (delta: -36.2MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-02-16 04:05:45,915 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:05:45,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.67ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 32.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 04:05:45,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.50ms. Allocated memory is still 69.2MB. Free memory was 32.0MB in the beginning and 30.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:05:45,918 INFO L158 Benchmark]: Boogie Preprocessor took 90.62ms. Allocated memory is still 69.2MB. Free memory was 30.2MB in the beginning and 48.5MB in the end (delta: -18.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 04:05:45,918 INFO L158 Benchmark]: RCFGBuilder took 556.94ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 66.0MB in the end (delta: -17.5MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2023-02-16 04:05:45,919 INFO L158 Benchmark]: TraceAbstraction took 60468.56ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 65.2MB in the beginning and 88.9MB in the end (delta: -23.7MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2023-02-16 04:05:45,919 INFO L158 Benchmark]: Witness Printer took 106.21ms. Allocated memory is still 130.0MB. Free memory was 88.9MB in the beginning and 82.6MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 04:05:45,923 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.17ms. Allocated memory is still 54.5MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.67ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 32.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.50ms. Allocated memory is still 69.2MB. Free memory was 32.0MB in the beginning and 30.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.62ms. Allocated memory is still 69.2MB. Free memory was 30.2MB in the beginning and 48.5MB in the end (delta: -18.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 556.94ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 66.0MB in the end (delta: -17.5MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 60468.56ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 65.2MB in the beginning and 88.9MB in the end (delta: -23.7MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 106.21ms. Allocated memory is still 130.0MB. Free memory was 88.9MB in the beginning and 82.6MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 77]: integer overflow possible integer overflow possible We found a FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sa ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR (e + 128) << 24U [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464, e=-24, m=0, res=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 99 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 60.4s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 48.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4608 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4608 mSDsluCounter, 15626 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14080 mSDsCounter, 703 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12238 IncrementalHoareTripleChecker+Invalid, 12941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 703 mSolverCounterUnsat, 1546 mSDtfsCounter, 12238 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 1205 SyntacticMatches, 7 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5171 ImplicationChecksByTransitivity, 41.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=15, InterpolantAutomatonStates: 316, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 1433 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 950 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1281 ConstructedInterpolants, 8 QuantifiedInterpolants, 7708 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 1576/6570 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-16 04:05:45,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)