./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 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_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-?-7e1ff0e [2023-02-15 01:53:58,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:53:58,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:53:58,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:53:58,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:53:58,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:53:58,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:53:58,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:53:58,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:53:58,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:53:58,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:53:58,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:53:58,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:53:58,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:53:58,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:53:58,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:53:58,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:53:58,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:53:58,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:53:58,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:53:58,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:53:58,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:53:58,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:53:58,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:53:58,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:53:58,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:53:58,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:53:58,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:53:58,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:53:58,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:53:58,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:53:58,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:53:58,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:53:58,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:53:58,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:53:58,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:53:58,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:53:58,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:53:58,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:53:58,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:53:58,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:53:58,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-15 01:53:58,398 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:53:58,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:53:58,399 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:53:58,399 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:53:58,400 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:53:58,400 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:53:58,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:53:58,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:53:58,401 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:53:58,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:53:58,401 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:53:58,401 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:53:58,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:53:58,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:53:58,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:53:58,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 01:53:58,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:53:58,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 01:53:58,402 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 01:53:58,403 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:53:58,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 01:53:58,403 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:53:58,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 01:53:58,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:53:58,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:53:58,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:53:58,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:53:58,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:53:58,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:53:58,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 01:53:58,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:53:58,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:53:58,409 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:53:58,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 01:53:58,409 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:53:58,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:53:58,410 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:53:58,410 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-15 01:53:58,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:53:58,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:53:58,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:53:58,652 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:53:58,652 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:53:58,653 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-15 01:53:59,582 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:53:59,737 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:53:59,737 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2023-02-15 01:53:59,742 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a12fe1f2/507059adeb7249ef8103b0270cea8546/FLAG9287f0761 [2023-02-15 01:53:59,751 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a12fe1f2/507059adeb7249ef8103b0270cea8546 [2023-02-15 01:53:59,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:53:59,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:53:59,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:53:59,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:53:59,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:53:59,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40db50f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:59, skipping insertion in model container [2023-02-15 01:53:59,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:53:59" (1/1) ... [2023-02-15 01:53:59,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:53:59,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:53:59,890 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-15 01:53:59,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:53:59,955 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:53:59,987 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-15 01:54:00,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:54:00,033 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:54:00,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00 WrapperNode [2023-02-15 01:54:00,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:54:00,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:54:00,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:54:00,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:54:00,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,083 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181 [2023-02-15 01:54:00,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:54:00,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:54:00,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:54:00,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:54:00,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,102 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:54:00,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:54:00,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:54:00,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:54:00,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (1/1) ... [2023-02-15 01:54:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:54:00,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:00,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:54:00,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:54:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:54:00,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:54:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 01:54:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 01:54:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:54:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:54:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 01:54:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 01:54:00,226 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:54:00,228 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:54:00,596 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:54:00,606 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:54:00,608 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 01:54:00,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:00 BoogieIcfgContainer [2023-02-15 01:54:00,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:54:00,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:54:00,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:54:00,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:54:00,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:53:59" (1/3) ... [2023-02-15 01:54:00,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad816e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:54:00, skipping insertion in model container [2023-02-15 01:54:00,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:54:00" (2/3) ... [2023-02-15 01:54:00,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad816e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:54:00, skipping insertion in model container [2023-02-15 01:54:00,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:00" (3/3) ... [2023-02-15 01:54:00,617 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2023-02-15 01:54:00,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:54:00,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-15 01:54:00,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:54:00,675 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;@55713e1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:54:00,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-15 01:54:00,679 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-15 01:54:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:54:00,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:00,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:00,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1548318721, now seen corresponding path program 1 times [2023-02-15 01:54:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:00,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424436460] [2023-02-15 01:54:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:00,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:54:00,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:00,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424436460] [2023-02-15 01:54:00,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424436460] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:00,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:00,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:54:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680344955] [2023-02-15 01:54:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:00,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:00,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:00,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:00,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:00,918 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-15 01:54:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,065 INFO L93 Difference]: Finished difference Result 296 states and 415 transitions. [2023-02-15 01:54:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 01:54:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,077 INFO L225 Difference]: With dead ends: 296 [2023-02-15 01:54:01,077 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 01:54:01,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:01,086 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 87 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 01:54:01,087 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-15 01:54:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 01:54:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2023-02-15 01:54:01,128 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-15 01:54:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2023-02-15 01:54:01,133 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 9 [2023-02-15 01:54:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,134 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2023-02-15 01:54:01,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:54:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2023-02-15 01:54:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:54:01,136 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:01,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:54:01,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:01,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1386908481, now seen corresponding path program 1 times [2023-02-15 01:54:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910348962] [2023-02-15 01:54:01,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:54:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910348962] [2023-02-15 01:54:01,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910348962] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269615016] [2023-02-15 01:54:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:01,229 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-15 01:54:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,333 INFO L93 Difference]: Finished difference Result 321 states and 419 transitions. [2023-02-15 01:54:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:01,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 01:54:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,337 INFO L225 Difference]: With dead ends: 321 [2023-02-15 01:54:01,337 INFO L226 Difference]: Without dead ends: 179 [2023-02-15 01:54:01,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:54:01,343 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-15 01:54:01,344 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-15 01:54:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-15 01:54:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2023-02-15 01:54:01,355 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-15 01:54:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2023-02-15 01:54:01,356 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 14 [2023-02-15 01:54:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,357 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2023-02-15 01:54:01,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:54:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2023-02-15 01:54:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 01:54:01,359 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:54:01,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:54:01,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:01,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1595006381, now seen corresponding path program 1 times [2023-02-15 01:54:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444061816] [2023-02-15 01:54:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:54:01,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444061816] [2023-02-15 01:54:01,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444061816] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:01,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145093941] [2023-02-15 01:54:01,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:01,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:01,463 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-15 01:54:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,503 INFO L93 Difference]: Finished difference Result 320 states and 420 transitions. [2023-02-15 01:54:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:01,504 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-15 01:54:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,505 INFO L225 Difference]: With dead ends: 320 [2023-02-15 01:54:01,505 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 01:54:01,507 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-15 01:54:01,510 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-15 01:54:01,511 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-15 01:54:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 01:54:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-02-15 01:54:01,530 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-15 01:54:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2023-02-15 01:54:01,531 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 15 [2023-02-15 01:54:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,531 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2023-02-15 01:54:01,531 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-15 01:54:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2023-02-15 01:54:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 01:54:01,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,533 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-15 01:54:01,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:54:01,533 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 814606369, now seen corresponding path program 1 times [2023-02-15 01:54:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744648756] [2023-02-15 01:54:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,567 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-15 01:54:01,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744648756] [2023-02-15 01:54:01,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744648756] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:54:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453842192] [2023-02-15 01:54:01,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:54:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:54:01,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:54:01,569 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-15 01:54:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,593 INFO L93 Difference]: Finished difference Result 170 states and 220 transitions. [2023-02-15 01:54:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:54:01,593 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-15 01:54:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,594 INFO L225 Difference]: With dead ends: 170 [2023-02-15 01:54:01,594 INFO L226 Difference]: Without dead ends: 169 [2023-02-15 01:54:01,594 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-15 01:54:01,598 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-15 01:54:01,599 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-15 01:54:01,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-15 01:54:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2023-02-15 01:54:01,612 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-15 01:54:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 210 transitions. [2023-02-15 01:54:01,626 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 210 transitions. Word has length 23 [2023-02-15 01:54:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,626 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 210 transitions. [2023-02-15 01:54:01,626 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-15 01:54:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 210 transitions. [2023-02-15 01:54:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:54:01,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,627 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-15 01:54:01,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:54:01,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:01,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,627 INFO L85 PathProgramCache]: Analyzing trace with hash 486151468, now seen corresponding path program 1 times [2023-02-15 01:54:01,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949605956] [2023-02-15 01:54:01,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:54:01,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949605956] [2023-02-15 01:54:01,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949605956] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847978905] [2023-02-15 01:54:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:01,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:01,720 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-15 01:54:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,757 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2023-02-15 01:54:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:01,758 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-15 01:54:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,761 INFO L225 Difference]: With dead ends: 277 [2023-02-15 01:54:01,761 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 01:54:01,762 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-15 01:54:01,763 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-15 01:54:01,763 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-15 01:54:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 01:54:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-15 01:54:01,769 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-15 01:54:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2023-02-15 01:54:01,773 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 22 [2023-02-15 01:54:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,774 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2023-02-15 01:54:01,774 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-15 01:54:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2023-02-15 01:54:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:54:01,775 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,775 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-15 01:54:01,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:54:01,776 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2125647912, now seen corresponding path program 1 times [2023-02-15 01:54:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321794557] [2023-02-15 01:54:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:54:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321794557] [2023-02-15 01:54:01,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321794557] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869198880] [2023-02-15 01:54:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:01,839 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-15 01:54:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,905 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2023-02-15 01:54:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:01,906 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-15 01:54:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,907 INFO L225 Difference]: With dead ends: 153 [2023-02-15 01:54:01,907 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 01:54:01,907 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-15 01:54:01,908 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 69 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:01,908 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.0s Time] [2023-02-15 01:54:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 01:54:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-15 01:54:01,912 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-15 01:54:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2023-02-15 01:54:01,913 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 22 [2023-02-15 01:54:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,913 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2023-02-15 01:54:01,913 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-15 01:54:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2023-02-15 01:54:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:54:01,914 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,914 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-15 01:54:01,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:54:01,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1249763114, now seen corresponding path program 1 times [2023-02-15 01:54:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513614858] [2023-02-15 01:54:01,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:01,941 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-15 01:54:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:01,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513614858] [2023-02-15 01:54:01,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513614858] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:01,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:01,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:54:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980814323] [2023-02-15 01:54:01,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:01,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:54:01,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:54:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:54:01,943 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-15 01:54:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:01,973 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2023-02-15 01:54:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:54:01,973 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-15 01:54:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:01,974 INFO L225 Difference]: With dead ends: 165 [2023-02-15 01:54:01,974 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 01:54:01,974 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-15 01:54:01,975 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-15 01:54:01,975 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-15 01:54:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 01:54:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2023-02-15 01:54:01,979 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-15 01:54:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2023-02-15 01:54:01,980 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 26 [2023-02-15 01:54:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:01,980 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2023-02-15 01:54:01,980 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-15 01:54:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2023-02-15 01:54:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:54:01,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:01,981 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-15 01:54:01,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:54:01,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash -465994842, now seen corresponding path program 1 times [2023-02-15 01:54:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:01,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549781210] [2023-02-15 01:54:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,062 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-15 01:54:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:02,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549781210] [2023-02-15 01:54:02,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549781210] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:02,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437522892] [2023-02-15 01:54:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:02,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:02,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:02,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:02,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:54:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:54:02,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:02,203 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-15 01:54:02,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:02,347 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-15 01:54:02,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437522892] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:02,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:02,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-15 01:54:02,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136783403] [2023-02-15 01:54:02,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:02,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 01:54:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:02,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 01:54:02,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-15 01:54:02,349 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-15 01:54:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:02,686 INFO L93 Difference]: Finished difference Result 505 states and 650 transitions. [2023-02-15 01:54:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:54:02,687 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-15 01:54:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:02,691 INFO L225 Difference]: With dead ends: 505 [2023-02-15 01:54:02,691 INFO L226 Difference]: Without dead ends: 397 [2023-02-15 01:54:02,692 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-15 01:54:02,692 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-15 01:54:02,693 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-15 01:54:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-15 01:54:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 169. [2023-02-15 01:54:02,707 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-15 01:54:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 208 transitions. [2023-02-15 01:54:02,708 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 208 transitions. Word has length 37 [2023-02-15 01:54:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:02,709 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 208 transitions. [2023-02-15 01:54:02,709 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-15 01:54:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 208 transitions. [2023-02-15 01:54:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 01:54:02,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:02,711 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-15 01:54:02,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:02,918 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-15 01:54:02,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:02,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash -767991458, now seen corresponding path program 1 times [2023-02-15 01:54:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:02,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351281528] [2023-02-15 01:54:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:02,965 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-15 01:54:02,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:02,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351281528] [2023-02-15 01:54:02,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351281528] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:02,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:02,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842001634] [2023-02-15 01:54:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:02,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:02,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:02,967 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-15 01:54:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:03,022 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2023-02-15 01:54:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:03,022 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-15 01:54:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:03,023 INFO L225 Difference]: With dead ends: 220 [2023-02-15 01:54:03,023 INFO L226 Difference]: Without dead ends: 217 [2023-02-15 01:54:03,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:54:03,024 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:03,024 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.0s Time] [2023-02-15 01:54:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-15 01:54:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 196. [2023-02-15 01:54:03,031 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-15 01:54:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2023-02-15 01:54:03,031 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 39 [2023-02-15 01:54:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:03,032 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2023-02-15 01:54:03,032 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-15 01:54:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2023-02-15 01:54:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 01:54:03,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:03,033 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-15 01:54:03,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 01:54:03,033 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash -796618814, now seen corresponding path program 1 times [2023-02-15 01:54:03,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:03,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870242849] [2023-02-15 01:54:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,070 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-15 01:54:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:03,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870242849] [2023-02-15 01:54:03,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870242849] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:03,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:03,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:54:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537069541] [2023-02-15 01:54:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:03,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:03,072 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-15 01:54:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:03,125 INFO L93 Difference]: Finished difference Result 218 states and 271 transitions. [2023-02-15 01:54:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:03,126 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-15 01:54:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:03,127 INFO L225 Difference]: With dead ends: 218 [2023-02-15 01:54:03,127 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 01:54:03,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:54:03,127 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:03,128 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.0s Time] [2023-02-15 01:54:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 01:54:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2023-02-15 01:54:03,135 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-15 01:54:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 255 transitions. [2023-02-15 01:54:03,136 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 255 transitions. Word has length 39 [2023-02-15 01:54:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:03,136 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 255 transitions. [2023-02-15 01:54:03,136 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-15 01:54:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 255 transitions. [2023-02-15 01:54:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 01:54:03,137 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:03,137 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-15 01:54:03,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 01:54:03,137 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -739732565, now seen corresponding path program 1 times [2023-02-15 01:54:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:03,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913406179] [2023-02-15 01:54:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,280 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-15 01:54:03,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:03,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913406179] [2023-02-15 01:54:03,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913406179] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:54:03,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:54:03,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:54:03,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354878653] [2023-02-15 01:54:03,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:54:03,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:54:03,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:03,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:54:03,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:54:03,282 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-15 01:54:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:03,344 INFO L93 Difference]: Finished difference Result 432 states and 549 transitions. [2023-02-15 01:54:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:54:03,344 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-15 01:54:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:03,346 INFO L225 Difference]: With dead ends: 432 [2023-02-15 01:54:03,346 INFO L226 Difference]: Without dead ends: 285 [2023-02-15 01:54:03,346 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-15 01:54:03,347 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:03,347 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.0s Time] [2023-02-15 01:54:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-02-15 01:54:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 202. [2023-02-15 01:54:03,356 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-15 01:54:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2023-02-15 01:54:03,356 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 44 [2023-02-15 01:54:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:03,356 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2023-02-15 01:54:03,357 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-15 01:54:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2023-02-15 01:54:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:54:03,357 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:03,357 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-15 01:54:03,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 01:54:03,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash -994209911, now seen corresponding path program 1 times [2023-02-15 01:54:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:03,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509092207] [2023-02-15 01:54:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,471 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-15 01:54:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:03,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509092207] [2023-02-15 01:54:03,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509092207] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:03,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779705641] [2023-02-15 01:54:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:03,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:03,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:03,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:03,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:54:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:03,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:54:03,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:03,581 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-15 01:54:03,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:03,661 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-15 01:54:03,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779705641] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:03,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:03,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-15 01:54:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264050227] [2023-02-15 01:54:03,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:03,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:54:03,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:03,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:54:03,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:54:03,663 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-15 01:54:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:03,920 INFO L93 Difference]: Finished difference Result 534 states and 677 transitions. [2023-02-15 01:54:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:54:03,920 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-15 01:54:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:03,922 INFO L225 Difference]: With dead ends: 534 [2023-02-15 01:54:03,922 INFO L226 Difference]: Without dead ends: 373 [2023-02-15 01:54:03,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-02-15 01:54:03,923 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:03,923 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.1s Time] [2023-02-15 01:54:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-02-15 01:54:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 192. [2023-02-15 01:54:03,935 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-15 01:54:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2023-02-15 01:54:03,935 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 49 [2023-02-15 01:54:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:03,936 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2023-02-15 01:54:03,936 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-15 01:54:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2023-02-15 01:54:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 01:54:03,936 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:03,937 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-15 01:54:03,944 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-15 01:54:04,148 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-15 01:54:04,148 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1453329379, now seen corresponding path program 1 times [2023-02-15 01:54:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:04,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007601072] [2023-02-15 01:54:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,321 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-15 01:54:04,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:04,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007601072] [2023-02-15 01:54:04,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007601072] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:04,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005783428] [2023-02-15 01:54:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:04,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:04,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:04,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:04,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:54:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:04,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:54:04,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:04,458 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-15 01:54:04,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:04,712 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-15 01:54:04,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005783428] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:04,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:04,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-15 01:54:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890661964] [2023-02-15 01:54:04,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:04,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 01:54:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 01:54:04,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-15 01:54:04,717 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-15 01:54:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:05,263 INFO L93 Difference]: Finished difference Result 1152 states and 1491 transitions. [2023-02-15 01:54:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 01:54:05,264 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-15 01:54:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:05,267 INFO L225 Difference]: With dead ends: 1152 [2023-02-15 01:54:05,267 INFO L226 Difference]: Without dead ends: 1011 [2023-02-15 01:54:05,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=740, Invalid=1152, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 01:54:05,268 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 881 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-15 01:54:05,269 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-15 01:54:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-02-15 01:54:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 242. [2023-02-15 01:54:05,287 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-15 01:54:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 298 transitions. [2023-02-15 01:54:05,288 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 298 transitions. Word has length 62 [2023-02-15 01:54:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:05,288 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 298 transitions. [2023-02-15 01:54:05,289 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-15 01:54:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 298 transitions. [2023-02-15 01:54:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-15 01:54:05,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:05,289 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-15 01:54:05,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:05,494 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-15 01:54:05,494 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:05,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash -420611575, now seen corresponding path program 2 times [2023-02-15 01:54:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:05,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481283932] [2023-02-15 01:54:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:05,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:05,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:05,699 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-15 01:54:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:05,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481283932] [2023-02-15 01:54:05,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481283932] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:05,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914496877] [2023-02-15 01:54:05,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:54:05,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:05,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:05,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:05,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:54:05,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:54:05,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:54:05,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:54:05,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:05,884 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-15 01:54:05,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:06,101 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-15 01:54:06,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914496877] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:06,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:06,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 01:54:06,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56541275] [2023-02-15 01:54:06,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:06,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 01:54:06,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:06,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 01:54:06,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-15 01:54:06,103 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-15 01:54:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:19,633 INFO L93 Difference]: Finished difference Result 734 states and 929 transitions. [2023-02-15 01:54:19,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:54:19,634 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-15 01:54:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:19,635 INFO L225 Difference]: With dead ends: 734 [2023-02-15 01:54:19,635 INFO L226 Difference]: Without dead ends: 573 [2023-02-15 01:54:19,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=500, Invalid=902, Unknown=4, NotChecked=0, Total=1406 [2023-02-15 01:54:19,636 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 354 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:19,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1753 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 01:54:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-02-15 01:54:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 232. [2023-02-15 01:54:19,651 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-15 01:54:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 277 transitions. [2023-02-15 01:54:19,652 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 277 transitions. Word has length 69 [2023-02-15 01:54:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:19,652 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 277 transitions. [2023-02-15 01:54:19,652 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-15 01:54:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 277 transitions. [2023-02-15 01:54:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-15 01:54:19,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:19,653 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-15 01:54:19,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:54:19,858 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-15 01:54:19,858 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1581803805, now seen corresponding path program 2 times [2023-02-15 01:54:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:19,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045460966] [2023-02-15 01:54:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:19,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:19,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:20,275 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-15 01:54:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045460966] [2023-02-15 01:54:20,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045460966] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433773244] [2023-02-15 01:54:20,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:54:20,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:20,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:20,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:20,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:54:20,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:54:20,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:54:20,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:54:20,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:20,568 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-15 01:54:20,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:21,142 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-15 01:54:21,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433773244] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:21,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:21,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-15 01:54:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858582278] [2023-02-15 01:54:21,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:21,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 01:54:21,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:21,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 01:54:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 01:54:21,147 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-15 01:54:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:54:22,626 INFO L93 Difference]: Finished difference Result 2040 states and 2659 transitions. [2023-02-15 01:54:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-02-15 01:54:22,627 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-15 01:54:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:54:22,631 INFO L225 Difference]: With dead ends: 2040 [2023-02-15 01:54:22,632 INFO L226 Difference]: Without dead ends: 1899 [2023-02-15 01:54:22,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2696, Invalid=4276, Unknown=0, NotChecked=0, Total=6972 [2023-02-15 01:54:22,634 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1787 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:54:22,634 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.6s Time] [2023-02-15 01:54:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2023-02-15 01:54:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 322. [2023-02-15 01:54:22,669 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-15 01:54:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 386 transitions. [2023-02-15 01:54:22,670 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 386 transitions. Word has length 102 [2023-02-15 01:54:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:54:22,670 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 386 transitions. [2023-02-15 01:54:22,670 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-15 01:54:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 386 transitions. [2023-02-15 01:54:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-15 01:54:22,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:54:22,671 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-15 01:54:22,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 01:54:22,876 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-15 01:54:22,876 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:54:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:54:22,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2024534263, now seen corresponding path program 3 times [2023-02-15 01:54:22,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:54:22,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378091705] [2023-02-15 01:54:22,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:54:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:54:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:23,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:54:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:23,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 01:54:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:54:23,344 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-15 01:54:23,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:54:23,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378091705] [2023-02-15 01:54:23,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378091705] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:54:23,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747246170] [2023-02-15 01:54:23,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 01:54:23,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:54:23,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:54:23,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:54:23,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 01:54:40,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-02-15 01:54:40,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:54:40,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 01:54:40,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:54:40,558 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-15 01:54:40,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:54:41,158 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-15 01:54:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747246170] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:54:41,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:54:41,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2023-02-15 01:54:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643193426] [2023-02-15 01:54:41,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:54:41,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 01:54:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:54:41,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 01:54:41,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=1735, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 01:54:41,160 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-15 01:54:48,177 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 58 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:55:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:24,171 INFO L93 Difference]: Finished difference Result 1054 states and 1332 transitions. [2023-02-15 01:55:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 01:55:24,171 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-15 01:55:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:24,174 INFO L225 Difference]: With dead ends: 1054 [2023-02-15 01:55:24,174 INFO L226 Difference]: Without dead ends: 893 [2023-02-15 01:55:24,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=1617, Invalid=3632, Unknown=7, NotChecked=0, Total=5256 [2023-02-15 01:55:24,177 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 971 mSDsluCounter, 3856 mSDsCounter, 0 mSdLazyCounter, 3103 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 4076 SdHoareTripleChecker+Invalid, 3168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:55:24,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 4076 Invalid, 3168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3103 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 01:55:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-02-15 01:55:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 322. [2023-02-15 01:55:24,203 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-15 01:55:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 376 transitions. [2023-02-15 01:55:24,204 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 376 transitions. Word has length 109 [2023-02-15 01:55:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:24,204 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 376 transitions. [2023-02-15 01:55:24,205 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-15 01:55:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 376 transitions. [2023-02-15 01:55:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-02-15 01:55:24,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:24,207 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-15 01:55:24,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:24,417 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-15 01:55:24,417 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:24,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:24,417 INFO L85 PathProgramCache]: Analyzing trace with hash 528449865, now seen corresponding path program 4 times [2023-02-15 01:55:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:55:24,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187973190] [2023-02-15 01:55:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:55:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:55:24,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 01:55:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:55:24,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 01:55:24,478 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 01:55:24,479 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-15 01:55:24,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-15 01:55:24,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-15 01:55:24,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-15 01:55:24,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-15 01:55:24,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-15 01:55:24,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-15 01:55:24,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-15 01:55:24,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-15 01:55:24,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-15 01:55:24,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-15 01:55:24,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-15 01:55:24,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-15 01:55:24,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-15 01:55:24,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-15 01:55:24,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-15 01:55:24,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-15 01:55:24,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-15 01:55:24,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-15 01:55:24,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-15 01:55:24,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-15 01:55:24,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-15 01:55:24,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-15 01:55:24,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-15 01:55:24,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 01:55:24,486 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:55:24,489 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:55:24,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:55:24 BoogieIcfgContainer [2023-02-15 01:55:24,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:55:24,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:55:24,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:55:24,558 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:55:24,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:54:00" (3/4) ... [2023-02-15 01:55:24,560 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 01:55:24,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:55:24,561 INFO L158 Benchmark]: Toolchain (without parser) took 84807.55ms. Allocated memory was 127.9MB in the beginning and 205.5MB in the end (delta: 77.6MB). Free memory was 90.9MB in the beginning and 63.1MB in the end (delta: 27.8MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2023-02-15 01:55:24,562 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 127.9MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:55:24,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.76ms. Allocated memory is still 127.9MB. Free memory was 90.9MB in the beginning and 98.9MB in the end (delta: -8.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 01:55:24,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.51ms. Allocated memory is still 127.9MB. Free memory was 98.9MB in the beginning and 96.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:55:24,563 INFO L158 Benchmark]: Boogie Preprocessor took 19.68ms. Allocated memory is still 127.9MB. Free memory was 96.5MB in the beginning and 94.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:55:24,563 INFO L158 Benchmark]: RCFGBuilder took 504.63ms. Allocated memory is still 127.9MB. Free memory was 94.8MB in the beginning and 72.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-15 01:55:24,563 INFO L158 Benchmark]: TraceAbstraction took 83945.46ms. Allocated memory was 127.9MB in the beginning and 205.5MB in the end (delta: 77.6MB). Free memory was 71.7MB in the beginning and 64.1MB in the end (delta: 7.6MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2023-02-15 01:55:24,563 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 205.5MB. Free memory is still 63.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:55:24,566 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.16ms. Allocated memory is still 127.9MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.76ms. Allocated memory is still 127.9MB. Free memory was 90.9MB in the beginning and 98.9MB in the end (delta: -8.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.51ms. Allocated memory is still 127.9MB. Free memory was 98.9MB in the beginning and 96.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.68ms. Allocated memory is still 127.9MB. Free memory was 96.5MB in the beginning and 94.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.63ms. Allocated memory is still 127.9MB. Free memory was 94.8MB in the beginning and 72.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 83945.46ms. Allocated memory was 127.9MB in the beginning and 205.5MB in the end (delta: 77.6MB). Free memory was 71.7MB in the beginning and 64.1MB in the end (delta: 7.6MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 205.5MB. Free memory is still 63.1MB. 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: 83.8s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 59.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5253 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5247 mSDsluCounter, 12665 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10679 mSDsCounter, 707 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6339 IncrementalHoareTripleChecker+Invalid, 7046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 707 mSolverCounterUnsat, 1986 mSDtfsCounter, 6339 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4057 ImplicationChecksByTransitivity, 56.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=15, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 3849 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 17.1s SatisfiabilityAnalysisTime, 4.8s 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-15 01:55:24,632 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-?-7e1ff0e [2023-02-15 01:55:26,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:55:26,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:55:26,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:55:26,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:55:26,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:55:26,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:55:26,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:55:26,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:55:26,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:55:26,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:55:26,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:55:26,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:55:26,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:55:26,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:55:26,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:55:26,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:55:26,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:55:26,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:55:26,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:55:26,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:55:26,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:55:26,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:55:26,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:55:26,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:55:26,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:55:26,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:55:26,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:55:26,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:55:26,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:55:26,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:55:26,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:55:26,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:55:26,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:55:26,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:55:26,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:55:26,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:55:26,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:55:26,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:55:26,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:55:26,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:55:26,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-15 01:55:26,496 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:55:26,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:55:26,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:55:26,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:55:26,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:55:26,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:55:26,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:55:26,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:55:26,499 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:55:26,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:55:26,499 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:55:26,499 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:55:26,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:55:26,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:55:26,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 01:55:26,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:55:26,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 01:55:26,500 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:55:26,500 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 01:55:26,500 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 01:55:26,501 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 01:55:26,501 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:55:26,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 01:55:26,501 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:55:26,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 01:55:26,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:55:26,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:55:26,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:55:26,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:55:26,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:55:26,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:55:26,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 01:55:26,502 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 01:55:26,503 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 01:55:26,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:55:26,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 01:55:26,503 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:55:26,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:55:26,503 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 01:55:26,503 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:55:26,504 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-15 01:55:26,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:55:26,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:55:26,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:55:26,772 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:55:26,772 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:55:26,773 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-15 01:55:27,656 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:55:27,844 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:55:27,849 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2023-02-15 01:55:27,854 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72e58986/d71217478617441a863aadac4ce91429/FLAGed954257b [2023-02-15 01:55:27,863 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72e58986/d71217478617441a863aadac4ce91429 [2023-02-15 01:55:27,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:55:27,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:55:27,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:55:27,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:55:27,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:55:27,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:55:27" (1/1) ... [2023-02-15 01:55:27,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd4870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:27, skipping insertion in model container [2023-02-15 01:55:27,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:55:27" (1/1) ... [2023-02-15 01:55:27,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:55:27,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:55:28,026 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-15 01:55:28,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:55:28,087 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:55:28,101 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-15 01:55:28,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:55:28,147 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:55:28,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28 WrapperNode [2023-02-15 01:55:28,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:55:28,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:55:28,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:55:28,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:55:28,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,193 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2023-02-15 01:55:28,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:55:28,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:55:28,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:55:28,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:55:28,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,222 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:55:28,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:55:28,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:55:28,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:55:28,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (1/1) ... [2023-02-15 01:55:28,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:55:28,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:55:28,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:55:28,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:55:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:55:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 01:55:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 01:55:28,293 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 01:55:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:55:28,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:55:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 01:55:28,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 01:55:28,389 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:55:28,391 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:55:28,673 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:55:28,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:55:28,677 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 01:55:28,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:55:28 BoogieIcfgContainer [2023-02-15 01:55:28,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:55:28,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:55:28,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:55:28,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:55:28,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:55:27" (1/3) ... [2023-02-15 01:55:28,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b48c408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:55:28, skipping insertion in model container [2023-02-15 01:55:28,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:55:28" (2/3) ... [2023-02-15 01:55:28,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b48c408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:55:28, skipping insertion in model container [2023-02-15 01:55:28,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:55:28" (3/3) ... [2023-02-15 01:55:28,689 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2023-02-15 01:55:28,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:55:28,701 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-15 01:55:28,741 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:55:28,745 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;@12c83e5f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:55:28,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-15 01:55:28,748 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-15 01:55:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:55:28,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:28,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:55:28,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1525933714, now seen corresponding path program 1 times [2023-02-15 01:55:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:28,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496917666] [2023-02-15 01:55:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:28,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:28,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:28,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:28,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 01:55:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:28,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 01:55:28,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:55:28,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:55:28,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:28,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496917666] [2023-02-15 01:55:28,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496917666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:55:28,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:55:28,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 01:55:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811537142] [2023-02-15 01:55:28,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:55:28,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:55:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:55:28,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:55:28,871 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-15 01:55:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:28,910 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2023-02-15 01:55:28,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:55:28,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 01:55:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:28,919 INFO L225 Difference]: With dead ends: 185 [2023-02-15 01:55:28,919 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 01:55:28,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:55:28,926 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-15 01:55:28,927 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-15 01:55:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 01:55:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-15 01:55:28,958 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-15 01:55:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2023-02-15 01:55:28,966 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 9 [2023-02-15 01:55:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:28,966 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2023-02-15 01:55:28,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:55:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2023-02-15 01:55:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:55:28,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:28,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:55:28,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 01:55:29,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:29,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1524992448, now seen corresponding path program 1 times [2023-02-15 01:55:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:29,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906401087] [2023-02-15 01:55:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:29,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:29,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:29,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:29,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 01:55:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:29,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:55:29,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:55:29,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:55:29,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:29,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906401087] [2023-02-15 01:55:29,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906401087] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:55:29,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:55:29,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:55:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350342445] [2023-02-15 01:55:29,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:55:29,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:55:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:55:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:55:29,242 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-15 01:55:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:29,310 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2023-02-15 01:55:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:55:29,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 01:55:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:29,328 INFO L225 Difference]: With dead ends: 151 [2023-02-15 01:55:29,328 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 01:55:29,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:55:29,329 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-15 01:55:29,331 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-15 01:55:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 01:55:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-02-15 01:55:29,338 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-15 01:55:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-15 01:55:29,338 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 9 [2023-02-15 01:55:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:29,339 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-15 01:55:29,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:55:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-15 01:55:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:55:29,340 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:29,340 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:55:29,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:29,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:29,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1370428688, now seen corresponding path program 1 times [2023-02-15 01:55:29,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:29,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957403115] [2023-02-15 01:55:29,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:29,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:29,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:29,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:29,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 01:55:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:29,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:55:29,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:55:29,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:55:29,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957403115] [2023-02-15 01:55:29,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957403115] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:55:29,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:55:29,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:55:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592857713] [2023-02-15 01:55:29,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:55:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:55:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:55:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:55:29,655 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-15 01:55:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:29,761 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2023-02-15 01:55:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:55:29,762 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-15 01:55:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:29,763 INFO L225 Difference]: With dead ends: 193 [2023-02-15 01:55:29,764 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 01:55:29,765 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-15 01:55:29,766 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 67 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 01:55:29,767 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-15 01:55:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 01:55:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2023-02-15 01:55:29,777 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-15 01:55:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2023-02-15 01:55:29,778 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 16 [2023-02-15 01:55:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:29,779 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2023-02-15 01:55:29,779 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-15 01:55:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2023-02-15 01:55:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:55:29,781 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:29,781 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:55:29,787 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 (4)] Ended with exit code 0 [2023-02-15 01:55:29,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:29,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1635050763, now seen corresponding path program 1 times [2023-02-15 01:55:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:29,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135374926] [2023-02-15 01:55:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:29,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-15 01:55:29,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:29,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:29,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 01:55:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:30,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:55:30,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:55:30,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:55:30,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:30,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135374926] [2023-02-15 01:55:30,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135374926] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:55:30,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:55:30,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:55:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680750614] [2023-02-15 01:55:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:55:30,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:55:30,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:55:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:55:30,052 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-15 01:55:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:30,092 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2023-02-15 01:55:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:55:30,093 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-15 01:55:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:30,094 INFO L225 Difference]: With dead ends: 197 [2023-02-15 01:55:30,094 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 01:55:30,097 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-15 01:55:30,101 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-15 01:55:30,102 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-15 01:55:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 01:55:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-02-15 01:55:30,114 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-15 01:55:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-02-15 01:55:30,115 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 21 [2023-02-15 01:55:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:30,115 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-02-15 01:55:30,115 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-15 01:55:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-02-15 01:55:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:55:30,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:30,116 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:55:30,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:30,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:30,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1476687918, now seen corresponding path program 1 times [2023-02-15 01:55:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:30,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524992078] [2023-02-15 01:55:30,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:30,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:30,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:30,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:30,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 01:55:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:30,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:55:30,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:55:30,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:55:30,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524992078] [2023-02-15 01:55:30,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524992078] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:55:30,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:55:30,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:55:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382117931] [2023-02-15 01:55:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:55:30,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:55:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:55:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:55:30,409 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-15 01:55:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:30,461 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2023-02-15 01:55:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:55:30,462 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-15 01:55:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:30,463 INFO L225 Difference]: With dead ends: 190 [2023-02-15 01:55:30,463 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 01:55:30,463 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-15 01:55:30,464 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-15 01:55:30,464 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-15 01:55:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 01:55:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2023-02-15 01:55:30,469 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-15 01:55:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2023-02-15 01:55:30,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 21 [2023-02-15 01:55:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:30,470 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2023-02-15 01:55:30,470 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-15 01:55:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2023-02-15 01:55:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:55:30,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:30,470 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-15 01:55:30,483 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-15 01:55:30,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:30,677 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1476578814, now seen corresponding path program 1 times [2023-02-15 01:55:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:30,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413849912] [2023-02-15 01:55:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:30,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:30,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:30,678 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:30,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 01:55:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:30,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:55:30,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:30,740 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-15 01:55:30,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:55:30,827 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-15 01:55:30,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:30,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413849912] [2023-02-15 01:55:30,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413849912] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:55:30,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:55:30,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-15 01:55:30,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140328935] [2023-02-15 01:55:30,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:55:30,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:55:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:55:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:55:30,828 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-15 01:55:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:31,228 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2023-02-15 01:55:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:55:31,229 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-15 01:55:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:31,229 INFO L225 Difference]: With dead ends: 217 [2023-02-15 01:55:31,229 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 01:55:31,230 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-15 01:55:31,230 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 192 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-15 01:55:31,230 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-15 01:55:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 01:55:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2023-02-15 01:55:31,242 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-15 01:55:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2023-02-15 01:55:31,243 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 21 [2023-02-15 01:55:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:31,243 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2023-02-15 01:55:31,243 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-15 01:55:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2023-02-15 01:55:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:55:31,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:31,244 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-15 01:55:31,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:31,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:31,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash -547019776, now seen corresponding path program 1 times [2023-02-15 01:55:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:31,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065535233] [2023-02-15 01:55:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:31,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:31,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:31,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:31,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 01:55:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:31,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:55:31,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:31,508 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-15 01:55:31,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:55:31,559 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-15 01:55:31,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:31,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065535233] [2023-02-15 01:55:31,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065535233] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:55:31,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:55:31,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 01:55:31,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060795461] [2023-02-15 01:55:31,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:55:31,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 01:55:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:31,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 01:55:31,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:55:31,565 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-15 01:55:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:31,758 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2023-02-15 01:55:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:55:31,759 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-15 01:55:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:31,760 INFO L225 Difference]: With dead ends: 217 [2023-02-15 01:55:31,760 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 01:55:31,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2023-02-15 01:55:31,761 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-15 01:55:31,761 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-15 01:55:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 01:55:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2023-02-15 01:55:31,768 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-15 01:55:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2023-02-15 01:55:31,773 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 26 [2023-02-15 01:55:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:31,773 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2023-02-15 01:55:31,773 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-15 01:55:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2023-02-15 01:55:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 01:55:31,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:31,778 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-15 01:55:31,789 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-15 01:55:31,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:31,985 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -198921976, now seen corresponding path program 1 times [2023-02-15 01:55:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:31,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203918863] [2023-02-15 01:55:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:31,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:31,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:31,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:31,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 01:55:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:32,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:55:32,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:32,070 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-15 01:55:32,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:55:32,217 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-15 01:55:32,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:32,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203918863] [2023-02-15 01:55:32,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203918863] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:55:32,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:55:32,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 01:55:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238154099] [2023-02-15 01:55:32,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:55:32,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 01:55:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 01:55:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:55:32,218 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-15 01:55:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:32,648 INFO L93 Difference]: Finished difference Result 307 states and 370 transitions. [2023-02-15 01:55:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:55:32,649 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-15 01:55:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:32,650 INFO L225 Difference]: With dead ends: 307 [2023-02-15 01:55:32,650 INFO L226 Difference]: Without dead ends: 234 [2023-02-15 01:55:32,650 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-15 01:55:32,651 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 155 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:55:32,651 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.3s Time] [2023-02-15 01:55:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-15 01:55:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 121. [2023-02-15 01:55:32,660 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-15 01:55:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2023-02-15 01:55:32,661 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 38 [2023-02-15 01:55:32,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:32,661 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2023-02-15 01:55:32,661 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-15 01:55:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2023-02-15 01:55:32,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:55:32,662 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:32,662 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-15 01:55:32,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:32,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:32,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:32,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1144709760, now seen corresponding path program 2 times [2023-02-15 01:55:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:32,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583428630] [2023-02-15 01:55:32,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:55:32,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:32,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:32,871 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:32,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 01:55:32,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:55:32,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:55:32,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 01:55:32,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:33,002 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-15 01:55:33,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:55:33,166 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-15 01:55:33,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:33,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583428630] [2023-02-15 01:55:33,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583428630] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:55:33,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:55:33,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-15 01:55:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146281569] [2023-02-15 01:55:33,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:55:33,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:55:33,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:33,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:55:33,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-02-15 01:55:33,168 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-15 01:55:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:33,648 INFO L93 Difference]: Finished difference Result 275 states and 320 transitions. [2023-02-15 01:55:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 01:55:33,648 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-15 01:55:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:33,649 INFO L225 Difference]: With dead ends: 275 [2023-02-15 01:55:33,649 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 01:55:33,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 01:55:33,650 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 238 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 01:55:33,650 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-15 01:55:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 01:55:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2023-02-15 01:55:33,659 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-15 01:55:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2023-02-15 01:55:33,660 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 46 [2023-02-15 01:55:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:33,660 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2023-02-15 01:55:33,660 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-15 01:55:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2023-02-15 01:55:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 01:55:33,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:33,673 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-15 01:55:33,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:33,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:33,879 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash -321230200, now seen corresponding path program 2 times [2023-02-15 01:55:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:33,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898094832] [2023-02-15 01:55:33,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:55:33,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:33,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:33,887 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:33,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 01:55:33,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 01:55:33,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:55:33,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:55:33,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:33,923 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-15 01:55:33,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:55:33,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898094832] [2023-02-15 01:55:33,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898094832] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:55:33,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:55:33,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:55:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279171103] [2023-02-15 01:55:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:55:33,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:55:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:33,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:55:33,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:55:33,925 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-15 01:55:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:33,949 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2023-02-15 01:55:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:55:33,950 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-15 01:55:33,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:33,952 INFO L225 Difference]: With dead ends: 165 [2023-02-15 01:55:33,952 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 01:55:33,952 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-15 01:55:33,953 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-15 01:55:33,953 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-15 01:55:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 01:55:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2023-02-15 01:55:33,963 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-15 01:55:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2023-02-15 01:55:33,964 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 58 [2023-02-15 01:55:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:33,964 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2023-02-15 01:55:33,964 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-15 01:55:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2023-02-15 01:55:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 01:55:33,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:33,965 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-15 01:55:33,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:34,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:34,173 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:34,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash -321162674, now seen corresponding path program 1 times [2023-02-15 01:55:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:34,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837913236] [2023-02-15 01:55:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:55:34,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:34,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:34,175 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:34,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 01:55:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:55:34,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:55:34,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:34,357 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-15 01:55:34,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:55:34,739 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-15 01:55:34,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:34,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837913236] [2023-02-15 01:55:34,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837913236] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:55:34,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:55:34,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-15 01:55:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735516954] [2023-02-15 01:55:34,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:55:34,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:55:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:34,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:55:34,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-15 01:55:34,740 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-15 01:55:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:36,293 INFO L93 Difference]: Finished difference Result 484 states and 595 transitions. [2023-02-15 01:55:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:55:36,295 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-15 01:55:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:36,301 INFO L225 Difference]: With dead ends: 484 [2023-02-15 01:55:36,301 INFO L226 Difference]: Without dead ends: 412 [2023-02-15 01:55:36,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2023-02-15 01:55:36,302 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 687 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:55:36,303 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.0s Time] [2023-02-15 01:55:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-02-15 01:55:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 160. [2023-02-15 01:55:36,327 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-15 01:55:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2023-02-15 01:55:36,328 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 58 [2023-02-15 01:55:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:36,328 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2023-02-15 01:55:36,328 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-15 01:55:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2023-02-15 01:55:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-15 01:55:36,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:36,329 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-15 01:55:36,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:36,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:36,537 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:36,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1322135424, now seen corresponding path program 3 times [2023-02-15 01:55:36,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:36,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074519685] [2023-02-15 01:55:36,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 01:55:36,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:36,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:36,539 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:36,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 01:55:36,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-15 01:55:36,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:55:36,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 01:55:36,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:36,782 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-15 01:55:36,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:55:37,436 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-15 01:55:37,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:37,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074519685] [2023-02-15 01:55:37,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074519685] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:55:37,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:55:37,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-02-15 01:55:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879254463] [2023-02-15 01:55:37,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:55:37,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 01:55:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 01:55:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 01:55:37,438 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-15 01:55:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:42,398 INFO L93 Difference]: Finished difference Result 564 states and 669 transitions. [2023-02-15 01:55:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-02-15 01:55:42,407 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-15 01:55:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:42,411 INFO L225 Difference]: With dead ends: 564 [2023-02-15 01:55:42,411 INFO L226 Difference]: Without dead ends: 489 [2023-02-15 01:55:42,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2023-02-15 01:55:42,414 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 731 mSDsluCounter, 4122 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:55:42,415 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.2s Time] [2023-02-15 01:55:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-02-15 01:55:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 238. [2023-02-15 01:55:42,434 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-15 01:55:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2023-02-15 01:55:42,435 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 86 [2023-02-15 01:55:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:42,436 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2023-02-15 01:55:42,436 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-15 01:55:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2023-02-15 01:55:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-15 01:55:42,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:42,437 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-15 01:55:42,444 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-15 01:55:42,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:42,644 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1110203058, now seen corresponding path program 2 times [2023-02-15 01:55:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:42,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418838088] [2023-02-15 01:55:42,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:55:42,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:42,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:42,646 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:42,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 01:55:42,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:55:42,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:55:42,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:55:42,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:43,078 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-15 01:55:43,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:55:44,300 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-15 01:55:44,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:44,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418838088] [2023-02-15 01:55:44,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418838088] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:55:44,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:55:44,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-15 01:55:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209389282] [2023-02-15 01:55:44,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:55:44,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 01:55:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 01:55:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 01:55:44,303 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-15 01:55:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:55:50,746 INFO L93 Difference]: Finished difference Result 853 states and 1065 transitions. [2023-02-15 01:55:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-15 01:55:50,747 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-15 01:55:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:55:50,750 INFO L225 Difference]: With dead ends: 853 [2023-02-15 01:55:50,750 INFO L226 Difference]: Without dead ends: 781 [2023-02-15 01:55:50,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 01:55:50,751 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1161 mSDsluCounter, 2290 mSDsCounter, 0 mSdLazyCounter, 4114 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:55:50,751 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.3s Time] [2023-02-15 01:55:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-02-15 01:55:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 240. [2023-02-15 01:55:50,787 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-15 01:55:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 257 transitions. [2023-02-15 01:55:50,791 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 257 transitions. Word has length 98 [2023-02-15 01:55:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:55:50,791 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 257 transitions. [2023-02-15 01:55:50,791 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-15 01:55:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 257 transitions. [2023-02-15 01:55:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-15 01:55:50,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:55:50,792 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-15 01:55:50,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:55:50,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:50,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:55:50,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:55:50,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2098489280, now seen corresponding path program 4 times [2023-02-15 01:55:51,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:55:51,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114922467] [2023-02-15 01:55:51,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 01:55:51,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:55:51,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:55:51,001 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:55:51,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 01:55:51,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 01:55:51,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:55:51,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 01:55:51,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:55:51,498 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-15 01:55:51,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:55:53,518 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-15 01:55:53,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:55:53,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114922467] [2023-02-15 01:55:53,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114922467] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:55:53,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:55:53,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-15 01:55:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967688038] [2023-02-15 01:55:53,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:55:53,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 01:55:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:55:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 01:55:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 01:55:53,521 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-15 01:56:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:56:23,493 INFO L93 Difference]: Finished difference Result 490 states and 558 transitions. [2023-02-15 01:56:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-02-15 01:56:23,494 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-15 01:56:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:56:23,496 INFO L225 Difference]: With dead ends: 490 [2023-02-15 01:56:23,496 INFO L226 Difference]: Without dead ends: 486 [2023-02-15 01:56:23,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2023-02-15 01:56:23,499 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 1073 mSDsluCounter, 4252 mSDsCounter, 0 mSdLazyCounter, 4162 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:56:23,499 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.0s Time] [2023-02-15 01:56:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-02-15 01:56:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 364. [2023-02-15 01:56:23,547 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-15 01:56:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 426 transitions. [2023-02-15 01:56:23,548 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 426 transitions. Word has length 136 [2023-02-15 01:56:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:56:23,548 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 426 transitions. [2023-02-15 01:56:23,549 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-15 01:56:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 426 transitions. [2023-02-15 01:56:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-15 01:56:23,549 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:56:23,550 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-15 01:56:23,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 01:56:23,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:56:23,757 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:56:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:56:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1305368822, now seen corresponding path program 1 times [2023-02-15 01:56:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:56:23,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359062867] [2023-02-15 01:56:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:56:23,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:56:23,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:56:23,759 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:56:23,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 01:56:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:56:23,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:56:23,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:56:23,876 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-15 01:56:23,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:56:23,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:56:23,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359062867] [2023-02-15 01:56:23,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359062867] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:56:23,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:56:23,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:56:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381279330] [2023-02-15 01:56:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:56:23,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:56:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:56:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:56:23,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:56:23,879 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-15 01:56:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:56:24,055 INFO L93 Difference]: Finished difference Result 382 states and 447 transitions. [2023-02-15 01:56:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:56:24,055 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-15 01:56:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:56:24,056 INFO L225 Difference]: With dead ends: 382 [2023-02-15 01:56:24,057 INFO L226 Difference]: Without dead ends: 379 [2023-02-15 01:56:24,058 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-15 01:56:24,058 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-15 01:56:24,059 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-15 01:56:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-02-15 01:56:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2023-02-15 01:56:24,124 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-15 01:56:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 434 transitions. [2023-02-15 01:56:24,125 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 434 transitions. Word has length 152 [2023-02-15 01:56:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:56:24,125 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 434 transitions. [2023-02-15 01:56:24,125 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-15 01:56:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 434 transitions. [2023-02-15 01:56:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-02-15 01:56:24,126 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:56:24,126 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-15 01:56:24,133 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-15 01:56:24,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:56:24,333 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 01:56:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:56:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1608575873, now seen corresponding path program 1 times [2023-02-15 01:56:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:56:24,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432310689] [2023-02-15 01:56:24,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:56:24,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:56:24,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:56:24,335 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:56:24,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 01:56:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:56:24,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 01:56:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:56:24,474 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 01:56:24,474 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 01:56:24,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-15 01:56:24,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-15 01:56:24,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-15 01:56:24,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-15 01:56:24,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-15 01:56:24,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-15 01:56:24,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-15 01:56:24,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-15 01:56:24,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-15 01:56:24,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-15 01:56:24,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-15 01:56:24,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-15 01:56:24,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-15 01:56:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-15 01:56:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-15 01:56:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-15 01:56:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-15 01:56:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-15 01:56:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-15 01:56:24,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-15 01:56:24,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-15 01:56:24,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-15 01:56:24,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-15 01:56:24,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-15 01:56:24,488 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-15 01:56:24,686 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-15 01:56:24,689 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:56:24,691 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:56:24,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:56:24 BoogieIcfgContainer [2023-02-15 01:56:24,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:56:24,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:56:24,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:56:24,736 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:56:24,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:55:28" (3/4) ... [2023-02-15 01:56:24,737 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 01:56:24,816 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 01:56:24,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:56:24,816 INFO L158 Benchmark]: Toolchain (without parser) took 56951.01ms. Allocated memory was 60.8MB in the beginning and 142.6MB in the end (delta: 81.8MB). Free memory was 38.0MB in the beginning and 39.2MB in the end (delta: -1.2MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2023-02-15 01:56:24,817 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 25.6MB in the beginning and 25.6MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:56:24,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.80ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 37.8MB in the beginning and 56.4MB in the end (delta: -18.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-02-15 01:56:24,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.34ms. Allocated memory is still 77.6MB. Free memory was 56.4MB in the beginning and 54.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:56:24,818 INFO L158 Benchmark]: Boogie Preprocessor took 36.62ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 52.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:56:24,818 INFO L158 Benchmark]: RCFGBuilder took 447.16ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 53.6MB in the end (delta: -777.9kB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2023-02-15 01:56:24,818 INFO L158 Benchmark]: TraceAbstraction took 56052.98ms. Allocated memory was 77.6MB in the beginning and 142.6MB in the end (delta: 65.0MB). Free memory was 53.1MB in the beginning and 45.5MB in the end (delta: 7.6MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2023-02-15 01:56:24,818 INFO L158 Benchmark]: Witness Printer took 80.27ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 39.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-15 01:56:24,821 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 25.6MB in the beginning and 25.6MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.80ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 37.8MB in the beginning and 56.4MB in the end (delta: -18.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.34ms. Allocated memory is still 77.6MB. Free memory was 56.4MB in the beginning and 54.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.62ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 52.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.16ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 53.6MB in the end (delta: -777.9kB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 56052.98ms. Allocated memory was 77.6MB in the beginning and 142.6MB in the end (delta: 65.0MB). Free memory was 53.1MB in the beginning and 45.5MB in the end (delta: 7.6MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Witness Printer took 80.27ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 39.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 56.0s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4608 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4608 mSDsluCounter, 15626 SdHoareTripleChecker+Invalid, 8.0s 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, 1212 SyntacticMatches, 0 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 38.5s 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.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 1433 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 950 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1281 ConstructedInterpolants, 8 QuantifiedInterpolants, 7708 SizeOfPredicates, 18 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-15 01:56:24,842 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)