./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 574ddb4e 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-?-574ddb4 [2023-02-18 23:01:33,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 23:01:33,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 23:01:33,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 23:01:33,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 23:01:33,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 23:01:33,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 23:01:33,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 23:01:33,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 23:01:33,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 23:01:33,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 23:01:33,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 23:01:33,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 23:01:33,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 23:01:33,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 23:01:33,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 23:01:33,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 23:01:33,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 23:01:33,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 23:01:33,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 23:01:33,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 23:01:33,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 23:01:33,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 23:01:33,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 23:01:33,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 23:01:33,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 23:01:33,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 23:01:33,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 23:01:33,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 23:01:33,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 23:01:33,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 23:01:33,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 23:01:33,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 23:01:33,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 23:01:33,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 23:01:33,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 23:01:33,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 23:01:33,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 23:01:33,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 23:01:33,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 23:01:33,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 23:01:33,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-18 23:01:33,243 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 23:01:33,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 23:01:33,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 23:01:33,249 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 23:01:33,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 23:01:33,250 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 23:01:33,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 23:01:33,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 23:01:33,252 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 23:01:33,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 23:01:33,253 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 23:01:33,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 23:01:33,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 23:01:33,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 23:01:33,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 23:01:33,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 23:01:33,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 23:01:33,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 23:01:33,254 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 23:01:33,254 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 23:01:33,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 23:01:33,255 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 23:01:33,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 23:01:33,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 23:01:33,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 23:01:33,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 23:01:33,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:01:33,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 23:01:33,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 23:01:33,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 23:01:33,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 23:01:33,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 23:01:33,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 23:01:33,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 23:01:33,258 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 23:01:33,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 23:01:33,258 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 23:01:33,258 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-18 23:01:33,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 23:01:33,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 23:01:33,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 23:01:33,467 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 23:01:33,468 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 23:01:33,469 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-18 23:01:34,543 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 23:01:34,686 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 23:01:34,687 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2023-02-18 23:01:34,698 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a0e6ba6/2102fca7f649450cb570787317e70be0/FLAGe3c8274d5 [2023-02-18 23:01:34,715 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a0e6ba6/2102fca7f649450cb570787317e70be0 [2023-02-18 23:01:34,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 23:01:34,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 23:01:34,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 23:01:34,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 23:01:34,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 23:01:34,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:34,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9f30fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34, skipping insertion in model container [2023-02-18 23:01:34,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:34,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 23:01:34,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 23:01:34,877 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-18 23:01:34,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:01:34,934 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 23:01:34,943 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-18 23:01:34,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:01:34,980 INFO L208 MainTranslator]: Completed translation [2023-02-18 23:01:34,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34 WrapperNode [2023-02-18 23:01:34,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 23:01:34,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 23:01:34,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 23:01:34,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 23:01:34,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:34,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,023 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181 [2023-02-18 23:01:35,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 23:01:35,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 23:01:35,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 23:01:35,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 23:01:35,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,049 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 23:01:35,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 23:01:35,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 23:01:35,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 23:01:35,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (1/1) ... [2023-02-18 23:01:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:01:35,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:01:35,104 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-18 23:01:35,114 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-18 23:01:35,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 23:01:35,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 23:01:35,145 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-18 23:01:35,146 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-18 23:01:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 23:01:35,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 23:01:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 23:01:35,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 23:01:35,213 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 23:01:35,214 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 23:01:35,616 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 23:01:35,624 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 23:01:35,624 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 23:01:35,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:01:35 BoogieIcfgContainer [2023-02-18 23:01:35,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 23:01:35,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 23:01:35,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 23:01:35,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 23:01:35,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 11:01:34" (1/3) ... [2023-02-18 23:01:35,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc46e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:01:35, skipping insertion in model container [2023-02-18 23:01:35,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:01:34" (2/3) ... [2023-02-18 23:01:35,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc46e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:01:35, skipping insertion in model container [2023-02-18 23:01:35,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:01:35" (3/3) ... [2023-02-18 23:01:35,640 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2023-02-18 23:01:35,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 23:01:35,656 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-18 23:01:35,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 23:01:35,714 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;@11425c0c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 23:01:35,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-18 23:01:35,718 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-18 23:01:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 23:01:35,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:35,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:01:35,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1548318721, now seen corresponding path program 1 times [2023-02-18 23:01:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:35,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756593930] [2023-02-18 23:01:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:35,951 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-18 23:01:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:35,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756593930] [2023-02-18 23:01:35,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756593930] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:35,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:35,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:01:35,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619845145] [2023-02-18 23:01:35,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:35,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:01:35,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:01:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:01:35,998 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-18 23:01:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:36,116 INFO L93 Difference]: Finished difference Result 296 states and 415 transitions. [2023-02-18 23:01:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:01:36,122 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-18 23:01:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:36,129 INFO L225 Difference]: With dead ends: 296 [2023-02-18 23:01:36,129 INFO L226 Difference]: Without dead ends: 158 [2023-02-18 23:01:36,132 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-18 23:01:36,135 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-18 23:01:36,136 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-18 23:01:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-18 23:01:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2023-02-18 23:01:36,175 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-18 23:01:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2023-02-18 23:01:36,180 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 9 [2023-02-18 23:01:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:36,180 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2023-02-18 23:01:36,181 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-18 23:01:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2023-02-18 23:01:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 23:01:36,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:36,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:01:36,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 23:01:36,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1386908481, now seen corresponding path program 1 times [2023-02-18 23:01:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:36,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971361986] [2023-02-18 23:01:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:36,270 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-18 23:01:36,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:36,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971361986] [2023-02-18 23:01:36,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971361986] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:36,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:36,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:01:36,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964177712] [2023-02-18 23:01:36,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:36,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:01:36,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:36,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:01:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:01:36,274 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-18 23:01:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:36,370 INFO L93 Difference]: Finished difference Result 321 states and 419 transitions. [2023-02-18 23:01:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:01:36,371 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-18 23:01:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:36,372 INFO L225 Difference]: With dead ends: 321 [2023-02-18 23:01:36,372 INFO L226 Difference]: Without dead ends: 179 [2023-02-18 23:01:36,373 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-18 23:01:36,374 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-18 23:01:36,375 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-18 23:01:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-18 23:01:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2023-02-18 23:01:36,387 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-18 23:01:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2023-02-18 23:01:36,389 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 14 [2023-02-18 23:01:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:36,389 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2023-02-18 23:01:36,389 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-18 23:01:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2023-02-18 23:01:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 23:01:36,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:36,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:01:36,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 23:01:36,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1595006381, now seen corresponding path program 1 times [2023-02-18 23:01:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:36,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522778371] [2023-02-18 23:01:36,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:36,489 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-18 23:01:36,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:36,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522778371] [2023-02-18 23:01:36,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522778371] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:36,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:36,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:01:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926097908] [2023-02-18 23:01:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:36,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:01:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:36,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:01:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:01:36,494 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-18 23:01:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:36,536 INFO L93 Difference]: Finished difference Result 320 states and 420 transitions. [2023-02-18 23:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:01:36,536 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-18 23:01:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:36,539 INFO L225 Difference]: With dead ends: 320 [2023-02-18 23:01:36,540 INFO L226 Difference]: Without dead ends: 164 [2023-02-18 23:01:36,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:01:36,546 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-18 23:01:36,547 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-18 23:01:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-18 23:01:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-02-18 23:01:36,565 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-18 23:01:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2023-02-18 23:01:36,568 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 15 [2023-02-18 23:01:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:36,568 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2023-02-18 23:01:36,568 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-18 23:01:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2023-02-18 23:01:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 23:01:36,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:36,570 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-18 23:01:36,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 23:01:36,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash 814606369, now seen corresponding path program 1 times [2023-02-18 23:01:36,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:36,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883890017] [2023-02-18 23:01:36,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:36,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:36,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:36,646 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-18 23:01:36,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:36,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883890017] [2023-02-18 23:01:36,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883890017] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:36,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:36,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:01:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437714354] [2023-02-18 23:01:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:36,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:01:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:36,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:01:36,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:01:36,655 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-18 23:01:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:36,688 INFO L93 Difference]: Finished difference Result 170 states and 220 transitions. [2023-02-18 23:01:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:01:36,689 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-18 23:01:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:36,690 INFO L225 Difference]: With dead ends: 170 [2023-02-18 23:01:36,690 INFO L226 Difference]: Without dead ends: 169 [2023-02-18 23:01:36,691 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-18 23:01:36,700 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-18 23:01:36,701 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-18 23:01:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-18 23:01:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2023-02-18 23:01:36,716 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-18 23:01:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 210 transitions. [2023-02-18 23:01:36,717 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 210 transitions. Word has length 23 [2023-02-18 23:01:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:36,718 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 210 transitions. [2023-02-18 23:01:36,718 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-18 23:01:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 210 transitions. [2023-02-18 23:01:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 23:01:36,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:36,723 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-18 23:01:36,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 23:01:36,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:36,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash 486151468, now seen corresponding path program 1 times [2023-02-18 23:01:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:36,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648767447] [2023-02-18 23:01:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:36,824 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-18 23:01:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:36,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648767447] [2023-02-18 23:01:36,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648767447] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:36,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:36,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:01:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613373588] [2023-02-18 23:01:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:36,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:01:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:36,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:01:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:01:36,827 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-18 23:01:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:36,873 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2023-02-18 23:01:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:01:36,874 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-18 23:01:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:36,878 INFO L225 Difference]: With dead ends: 277 [2023-02-18 23:01:36,878 INFO L226 Difference]: Without dead ends: 150 [2023-02-18 23:01:36,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:01:36,880 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-18 23:01:36,880 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-18 23:01:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-18 23:01:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-18 23:01:36,898 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-18 23:01:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2023-02-18 23:01:36,908 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 22 [2023-02-18 23:01:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:36,908 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2023-02-18 23:01:36,909 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-18 23:01:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2023-02-18 23:01:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 23:01:36,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:36,911 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-18 23:01:36,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 23:01:36,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2125647912, now seen corresponding path program 1 times [2023-02-18 23:01:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:36,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45686099] [2023-02-18 23:01:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:37,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:01:37,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:37,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45686099] [2023-02-18 23:01:37,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45686099] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:37,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:37,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:01:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404754919] [2023-02-18 23:01:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:37,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:01:37,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:37,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:01:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:01:37,008 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-18 23:01:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:37,085 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2023-02-18 23:01:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:01:37,086 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-18 23:01:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:37,087 INFO L225 Difference]: With dead ends: 153 [2023-02-18 23:01:37,088 INFO L226 Difference]: Without dead ends: 150 [2023-02-18 23:01:37,088 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-18 23:01:37,089 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:01:37,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 422 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:01:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-18 23:01:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-02-18 23:01:37,102 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-18 23:01:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2023-02-18 23:01:37,103 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 22 [2023-02-18 23:01:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:37,104 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2023-02-18 23:01:37,104 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-18 23:01:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2023-02-18 23:01:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 23:01:37,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:37,105 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-18 23:01:37,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 23:01:37,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1249763114, now seen corresponding path program 1 times [2023-02-18 23:01:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:37,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72578079] [2023-02-18 23:01:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:37,142 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-18 23:01:37,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:37,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72578079] [2023-02-18 23:01:37,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72578079] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:37,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:37,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:01:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116316220] [2023-02-18 23:01:37,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:37,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:01:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:37,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:01:37,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:01:37,144 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-18 23:01:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:37,181 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2023-02-18 23:01:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:01:37,182 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-18 23:01:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:37,183 INFO L225 Difference]: With dead ends: 165 [2023-02-18 23:01:37,183 INFO L226 Difference]: Without dead ends: 162 [2023-02-18 23:01:37,184 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-18 23:01:37,184 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-18 23:01:37,185 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-18 23:01:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-18 23:01:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2023-02-18 23:01:37,194 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-18 23:01:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2023-02-18 23:01:37,195 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 26 [2023-02-18 23:01:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:37,196 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2023-02-18 23:01:37,196 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-18 23:01:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2023-02-18 23:01:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 23:01:37,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:37,197 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-18 23:01:37,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 23:01:37,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash -465994842, now seen corresponding path program 1 times [2023-02-18 23:01:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:37,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947106274] [2023-02-18 23:01:37,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:37,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:37,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:37,301 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-18 23:01:37,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:37,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947106274] [2023-02-18 23:01:37,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947106274] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:01:37,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260758856] [2023-02-18 23:01:37,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:37,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:01:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:01:37,305 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-18 23:01:37,307 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-18 23:01:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:37,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:01:37,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:01:37,426 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-18 23:01:37,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:01:37,479 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-18 23:01:37,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260758856] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:01:37,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:01:37,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-18 23:01:37,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750001892] [2023-02-18 23:01:37,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:01:37,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 23:01:37,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:37,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 23:01:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-18 23:01:37,481 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-18 23:01:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:37,860 INFO L93 Difference]: Finished difference Result 505 states and 650 transitions. [2023-02-18 23:01:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 23:01:37,860 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-18 23:01:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:37,866 INFO L225 Difference]: With dead ends: 505 [2023-02-18 23:01:37,866 INFO L226 Difference]: Without dead ends: 397 [2023-02-18 23:01:37,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2023-02-18 23:01:37,868 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.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:01:37,868 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.3s Time] [2023-02-18 23:01:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-18 23:01:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 169. [2023-02-18 23:01:37,886 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-18 23:01:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 208 transitions. [2023-02-18 23:01:37,887 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 208 transitions. Word has length 37 [2023-02-18 23:01:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:37,888 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 208 transitions. [2023-02-18 23:01:37,888 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-18 23:01:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 208 transitions. [2023-02-18 23:01:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 23:01:37,891 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:37,891 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-18 23:01:37,901 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-18 23:01:38,099 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-18 23:01:38,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash -767991458, now seen corresponding path program 1 times [2023-02-18 23:01:38,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:38,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466872248] [2023-02-18 23:01:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:38,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,150 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-18 23:01:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:38,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466872248] [2023-02-18 23:01:38,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466872248] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:38,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:38,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:01:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170955393] [2023-02-18 23:01:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:38,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:01:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:01:38,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:01:38,153 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-18 23:01:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:38,229 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2023-02-18 23:01:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:01:38,230 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-18 23:01:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:38,232 INFO L225 Difference]: With dead ends: 220 [2023-02-18 23:01:38,232 INFO L226 Difference]: Without dead ends: 217 [2023-02-18 23:01:38,232 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-18 23:01:38,233 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 155 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:01:38,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 344 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:01:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-18 23:01:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 196. [2023-02-18 23:01:38,240 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-18 23:01:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2023-02-18 23:01:38,241 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 39 [2023-02-18 23:01:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:38,241 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2023-02-18 23:01:38,242 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-18 23:01:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2023-02-18 23:01:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 23:01:38,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:38,242 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-18 23:01:38,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 23:01:38,243 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash -796618814, now seen corresponding path program 1 times [2023-02-18 23:01:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:38,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573140675] [2023-02-18 23:01:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,288 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-18 23:01:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:38,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573140675] [2023-02-18 23:01:38,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573140675] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:38,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:38,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:01:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160927405] [2023-02-18 23:01:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:38,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:01:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:01:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:01:38,290 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-18 23:01:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:38,359 INFO L93 Difference]: Finished difference Result 218 states and 271 transitions. [2023-02-18 23:01:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:01:38,360 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-18 23:01:38,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:38,361 INFO L225 Difference]: With dead ends: 218 [2023-02-18 23:01:38,361 INFO L226 Difference]: Without dead ends: 215 [2023-02-18 23:01:38,362 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-18 23:01:38,362 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 162 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:01:38,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 332 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:01:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-18 23:01:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2023-02-18 23:01:38,369 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-18 23:01:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 255 transitions. [2023-02-18 23:01:38,370 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 255 transitions. Word has length 39 [2023-02-18 23:01:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:38,371 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 255 transitions. [2023-02-18 23:01:38,371 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-18 23:01:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 255 transitions. [2023-02-18 23:01:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 23:01:38,372 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:38,372 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-18 23:01:38,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 23:01:38,372 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash -739732565, now seen corresponding path program 1 times [2023-02-18 23:01:38,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:38,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552205296] [2023-02-18 23:01:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,457 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-18 23:01:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:38,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552205296] [2023-02-18 23:01:38,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552205296] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:01:38,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:01:38,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 23:01:38,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100355259] [2023-02-18 23:01:38,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:01:38,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:01:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:38,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:01:38,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:01:38,460 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-18 23:01:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:38,566 INFO L93 Difference]: Finished difference Result 432 states and 549 transitions. [2023-02-18 23:01:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:01:38,567 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-18 23:01:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:38,568 INFO L225 Difference]: With dead ends: 432 [2023-02-18 23:01:38,568 INFO L226 Difference]: Without dead ends: 285 [2023-02-18 23:01:38,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:01:38,569 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 57 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:01:38,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 301 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:01:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-02-18 23:01:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 202. [2023-02-18 23:01:38,581 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-18 23:01:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2023-02-18 23:01:38,583 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 44 [2023-02-18 23:01:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:38,583 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2023-02-18 23:01:38,583 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-18 23:01:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2023-02-18 23:01:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-18 23:01:38,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:38,584 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-18 23:01:38,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 23:01:38,585 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash -994209911, now seen corresponding path program 1 times [2023-02-18 23:01:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:38,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757166874] [2023-02-18 23:01:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,750 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-18 23:01:38,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:38,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757166874] [2023-02-18 23:01:38,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757166874] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:01:38,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203358526] [2023-02-18 23:01:38,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:38,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:01:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:01:38,752 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-18 23:01:38,755 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-18 23:01:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:38,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:01:38,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:01:38,837 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-18 23:01:38,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:01:39,130 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-18 23:01:39,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203358526] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:01:39,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:01:39,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-18 23:01:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325585180] [2023-02-18 23:01:39,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:01:39,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 23:01:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:39,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 23:01:39,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-18 23:01:39,133 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-18 23:01:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:39,408 INFO L93 Difference]: Finished difference Result 534 states and 677 transitions. [2023-02-18 23:01:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 23:01:39,408 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-18 23:01:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:39,411 INFO L225 Difference]: With dead ends: 534 [2023-02-18 23:01:39,411 INFO L226 Difference]: Without dead ends: 373 [2023-02-18 23:01:39,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 16 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-02-18 23:01:39,412 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 156 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:01:39,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 628 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:01:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-02-18 23:01:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 192. [2023-02-18 23:01:39,430 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-18 23:01:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2023-02-18 23:01:39,431 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 49 [2023-02-18 23:01:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:39,432 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2023-02-18 23:01:39,432 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-18 23:01:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2023-02-18 23:01:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-18 23:01:39,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:39,433 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-18 23:01:39,441 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-18 23:01:39,639 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-18 23:01:39,639 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:39,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1453329379, now seen corresponding path program 1 times [2023-02-18 23:01:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:39,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759999204] [2023-02-18 23:01:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:39,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:39,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:39,784 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-18 23:01:39,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:39,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759999204] [2023-02-18 23:01:39,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759999204] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:01:39,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788422518] [2023-02-18 23:01:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:39,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:01:39,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:01:39,786 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-18 23:01:39,810 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-18 23:01:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:39,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:01:39,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:01:39,892 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-18 23:01:39,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:01:40,011 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-18 23:01:40,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788422518] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:01:40,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:01:40,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-18 23:01:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297080688] [2023-02-18 23:01:40,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:01:40,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 23:01:40,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:40,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 23:01:40,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-18 23:01:40,015 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-18 23:01:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:40,599 INFO L93 Difference]: Finished difference Result 1152 states and 1491 transitions. [2023-02-18 23:01:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-18 23:01:40,599 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-18 23:01:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:40,603 INFO L225 Difference]: With dead ends: 1152 [2023-02-18 23:01:40,604 INFO L226 Difference]: Without dead ends: 1011 [2023-02-18 23:01:40,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=740, Invalid=1152, Unknown=0, NotChecked=0, Total=1892 [2023-02-18 23:01:40,606 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 881 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:01:40,606 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-18 23:01:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-02-18 23:01:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 242. [2023-02-18 23:01:40,625 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-18 23:01:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 298 transitions. [2023-02-18 23:01:40,626 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 298 transitions. Word has length 62 [2023-02-18 23:01:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:40,627 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 298 transitions. [2023-02-18 23:01:40,627 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-18 23:01:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 298 transitions. [2023-02-18 23:01:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-18 23:01:40,628 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:40,628 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-18 23:01:40,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 23:01:40,834 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-18 23:01:40,834 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:40,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash -420611575, now seen corresponding path program 2 times [2023-02-18 23:01:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:40,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280367933] [2023-02-18 23:01:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:40,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:41,044 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-18 23:01:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:41,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280367933] [2023-02-18 23:01:41,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280367933] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:01:41,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784897745] [2023-02-18 23:01:41,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:01:41,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:01:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:01:41,046 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-18 23:01:41,056 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-18 23:01:41,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:01:41,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:01:41,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 23:01:41,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:01:41,197 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-18 23:01:41,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:01:41,510 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-18 23:01:41,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784897745] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:01:41,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:01:41,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-18 23:01:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344126185] [2023-02-18 23:01:41,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:01:41,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 23:01:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 23:01:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-18 23:01:41,512 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-18 23:01:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:43,846 INFO L93 Difference]: Finished difference Result 734 states and 929 transitions. [2023-02-18 23:01:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 23:01:43,847 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-18 23:01:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:43,850 INFO L225 Difference]: With dead ends: 734 [2023-02-18 23:01:43,850 INFO L226 Difference]: Without dead ends: 573 [2023-02-18 23:01:43,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 118 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=504, Invalid=902, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 23:01:43,851 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 347 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:01:43,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1737 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-18 23:01:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-02-18 23:01:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 232. [2023-02-18 23:01:43,870 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-18 23:01:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 277 transitions. [2023-02-18 23:01:43,871 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 277 transitions. Word has length 69 [2023-02-18 23:01:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:43,871 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 277 transitions. [2023-02-18 23:01:43,872 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-18 23:01:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 277 transitions. [2023-02-18 23:01:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-18 23:01:43,873 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:43,873 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-18 23:01:43,881 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-18 23:01:44,078 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-18 23:01:44,079 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1581803805, now seen corresponding path program 2 times [2023-02-18 23:01:44,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:44,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173046480] [2023-02-18 23:01:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:44,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:44,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:44,516 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-18 23:01:44,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:44,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173046480] [2023-02-18 23:01:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173046480] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:01:44,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566832316] [2023-02-18 23:01:44,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:01:44,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:01:44,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:01:44,518 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-18 23:01:44,521 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-18 23:01:44,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:01:44,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:01:44,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 23:01:44,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:01:44,750 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-18 23:01:44,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:01:45,154 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-18 23:01:45,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566832316] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:01:45,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:01:45,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-18 23:01:45,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497048658] [2023-02-18 23:01:45,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:01:45,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 23:01:45,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:45,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 23:01:45,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 23:01:45,157 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-18 23:01:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:01:46,739 INFO L93 Difference]: Finished difference Result 2040 states and 2659 transitions. [2023-02-18 23:01:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-02-18 23:01:46,740 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-18 23:01:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:01:46,747 INFO L225 Difference]: With dead ends: 2040 [2023-02-18 23:01:46,747 INFO L226 Difference]: Without dead ends: 1899 [2023-02-18 23:01:46,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2696, Invalid=4276, Unknown=0, NotChecked=0, Total=6972 [2023-02-18 23:01:46,751 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1787 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-18 23:01:46,752 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-18 23:01:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2023-02-18 23:01:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 322. [2023-02-18 23:01:46,787 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-18 23:01:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 386 transitions. [2023-02-18 23:01:46,788 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 386 transitions. Word has length 102 [2023-02-18 23:01:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:01:46,788 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 386 transitions. [2023-02-18 23:01:46,789 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-18 23:01:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 386 transitions. [2023-02-18 23:01:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-18 23:01:46,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:01:46,794 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-18 23:01:46,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 23:01:47,000 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-18 23:01:47,001 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:01:47,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:01:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2024534263, now seen corresponding path program 3 times [2023-02-18 23:01:47,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:01:47,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125310768] [2023-02-18 23:01:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:01:47,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:01:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 23:01:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 23:01:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:01:47,462 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-18 23:01:47,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:01:47,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125310768] [2023-02-18 23:01:47,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125310768] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:01:47,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170278501] [2023-02-18 23:01:47,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 23:01:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:01:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:01:47,465 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-18 23:01:47,467 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-18 23:01:47,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-02-18 23:01:47,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:01:47,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 23:01:47,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:01:48,104 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-18 23:01:48,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:01:49,251 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-18 23:01:49,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170278501] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:01:49,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:01:49,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2023-02-18 23:01:49,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742589123] [2023-02-18 23:01:49,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:01:49,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-18 23:01:49,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:01:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-18 23:01:49,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=1735, Unknown=0, NotChecked=0, Total=2352 [2023-02-18 23:01:49,255 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-18 23:01:52,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 23:02:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:05,378 INFO L93 Difference]: Finished difference Result 1054 states and 1332 transitions. [2023-02-18 23:02:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-18 23:02:05,380 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-18 23:02:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:05,384 INFO L225 Difference]: With dead ends: 1054 [2023-02-18 23:02:05,384 INFO L226 Difference]: Without dead ends: 893 [2023-02-18 23:02:05,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 181 SyntacticMatches, 20 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1624, Invalid=3632, Unknown=0, NotChecked=0, Total=5256 [2023-02-18 23:02:05,386 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 941 mSDsluCounter, 3806 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 4025 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:05,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 4025 Invalid, 3194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-02-18 23:02:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-02-18 23:02:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 322. [2023-02-18 23:02:05,419 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-18 23:02:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 376 transitions. [2023-02-18 23:02:05,421 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 376 transitions. Word has length 109 [2023-02-18 23:02:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:05,421 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 376 transitions. [2023-02-18 23:02:05,421 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-18 23:02:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 376 transitions. [2023-02-18 23:02:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-02-18 23:02:05,423 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:05,423 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-18 23:02:05,435 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-18 23:02:05,630 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-18 23:02:05,630 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash 528449865, now seen corresponding path program 4 times [2023-02-18 23:02:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:02:05,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711223875] [2023-02-18 23:02:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:05,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:02:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 23:02:05,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 23:02:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 23:02:05,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 23:02:05,718 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 23:02:05,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-18 23:02:05,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-18 23:02:05,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-18 23:02:05,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-18 23:02:05,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-18 23:02:05,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-18 23:02:05,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-18 23:02:05,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-18 23:02:05,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-18 23:02:05,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-18 23:02:05,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-18 23:02:05,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-18 23:02:05,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-18 23:02:05,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-18 23:02:05,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-18 23:02:05,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-18 23:02:05,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-18 23:02:05,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-18 23:02:05,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-18 23:02:05,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-18 23:02:05,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-18 23:02:05,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-18 23:02:05,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-18 23:02:05,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-18 23:02:05,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 23:02:05,728 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:05,732 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 23:02:05,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 11:02:05 BoogieIcfgContainer [2023-02-18 23:02:05,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 23:02:05,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 23:02:05,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 23:02:05,811 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 23:02:05,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:01:35" (3/4) ... [2023-02-18 23:02:05,814 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 23:02:05,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 23:02:05,814 INFO L158 Benchmark]: Toolchain (without parser) took 31095.13ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 115.8MB in the beginning and 149.3MB in the end (delta: -33.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2023-02-18 23:02:05,815 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory was 78.1MB in the beginning and 77.9MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 23:02:05,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.68ms. Allocated memory is still 163.6MB. Free memory was 115.8MB in the beginning and 102.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 23:02:05,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.80ms. Allocated memory is still 163.6MB. Free memory was 102.0MB in the beginning and 100.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 23:02:05,816 INFO L158 Benchmark]: Boogie Preprocessor took 35.09ms. Allocated memory is still 163.6MB. Free memory was 100.0MB in the beginning and 97.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 23:02:05,816 INFO L158 Benchmark]: RCFGBuilder took 565.73ms. Allocated memory is still 163.6MB. Free memory was 97.9MB in the beginning and 77.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-18 23:02:05,816 INFO L158 Benchmark]: TraceAbstraction took 30182.26ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 76.5MB in the beginning and 149.3MB in the end (delta: -72.8MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2023-02-18 23:02:05,817 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 239.1MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 23:02:05,819 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.18ms. Allocated memory is still 136.3MB. Free memory was 78.1MB in the beginning and 77.9MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.68ms. Allocated memory is still 163.6MB. Free memory was 115.8MB in the beginning and 102.0MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.80ms. Allocated memory is still 163.6MB. Free memory was 102.0MB in the beginning and 100.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.09ms. Allocated memory is still 163.6MB. Free memory was 100.0MB in the beginning and 97.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 565.73ms. Allocated memory is still 163.6MB. Free memory was 97.9MB in the beginning and 77.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 30182.26ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 76.5MB in the beginning and 149.3MB in the end (delta: -72.8MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 239.1MB. Free memory is still 149.3MB. 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: 30.0s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5210 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5204 mSDsluCounter, 12561 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10586 mSDsCounter, 750 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6373 IncrementalHoareTripleChecker+Invalid, 7123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 750 mSolverCounterUnsat, 1975 mSDtfsCounter, 6373 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 813 SyntacticMatches, 60 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4493 ImplicationChecksByTransitivity, 15.8s 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, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1268 NumberOfCodeBlocks, 1268 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1509 ConstructedInterpolants, 0 QuantifiedInterpolants, 17117 SizeOfPredicates, 36 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-18 23:02:05,876 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-?-574ddb4 [2023-02-18 23:02:07,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 23:02:07,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 23:02:07,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 23:02:07,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 23:02:07,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 23:02:07,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 23:02:08,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 23:02:08,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 23:02:08,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 23:02:08,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 23:02:08,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 23:02:08,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 23:02:08,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 23:02:08,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 23:02:08,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 23:02:08,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 23:02:08,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 23:02:08,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 23:02:08,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 23:02:08,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 23:02:08,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 23:02:08,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 23:02:08,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 23:02:08,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 23:02:08,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 23:02:08,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 23:02:08,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 23:02:08,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 23:02:08,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 23:02:08,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 23:02:08,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 23:02:08,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 23:02:08,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 23:02:08,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 23:02:08,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 23:02:08,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 23:02:08,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 23:02:08,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 23:02:08,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 23:02:08,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 23:02:08,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-18 23:02:08,096 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 23:02:08,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 23:02:08,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 23:02:08,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 23:02:08,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 23:02:08,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 23:02:08,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 23:02:08,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 23:02:08,100 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 23:02:08,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 23:02:08,101 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 23:02:08,101 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 23:02:08,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 23:02:08,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 23:02:08,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 23:02:08,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 23:02:08,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 23:02:08,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 23:02:08,102 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 23:02:08,102 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 23:02:08,102 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 23:02:08,102 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 23:02:08,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 23:02:08,103 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 23:02:08,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 23:02:08,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 23:02:08,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 23:02:08,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 23:02:08,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:02:08,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 23:02:08,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 23:02:08,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 23:02:08,104 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 23:02:08,105 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 23:02:08,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 23:02:08,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 23:02:08,105 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 23:02:08,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 23:02:08,105 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 23:02:08,106 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 23:02:08,106 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-18 23:02:08,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 23:02:08,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 23:02:08,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 23:02:08,472 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 23:02:08,472 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 23:02:08,474 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-18 23:02:09,638 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 23:02:09,899 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 23:02:09,904 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2023-02-18 23:02:09,914 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b842219d/4ee5671d9b56410e8bf8a1160a2a772f/FLAG50ecd6eeb [2023-02-18 23:02:09,934 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b842219d/4ee5671d9b56410e8bf8a1160a2a772f [2023-02-18 23:02:09,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 23:02:09,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 23:02:09,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 23:02:09,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 23:02:09,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 23:02:09,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:02:09" (1/1) ... [2023-02-18 23:02:09,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3860635f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:09, skipping insertion in model container [2023-02-18 23:02:09,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:02:09" (1/1) ... [2023-02-18 23:02:09,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 23:02:09,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 23:02:10,127 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-18 23:02:10,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:02:10,211 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 23:02:10,227 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-18 23:02:10,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:02:10,281 INFO L208 MainTranslator]: Completed translation [2023-02-18 23:02:10,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10 WrapperNode [2023-02-18 23:02:10,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 23:02:10,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 23:02:10,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 23:02:10,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 23:02:10,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,336 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2023-02-18 23:02:10,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 23:02:10,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 23:02:10,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 23:02:10,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 23:02:10,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,389 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 23:02:10,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 23:02:10,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 23:02:10,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 23:02:10,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (1/1) ... [2023-02-18 23:02:10,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:02:10,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:02:10,428 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-18 23:02:10,450 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-18 23:02:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 23:02:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 23:02:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-18 23:02:10,467 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-18 23:02:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 23:02:10,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 23:02:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 23:02:10,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 23:02:10,556 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 23:02:10,557 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 23:02:10,916 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 23:02:10,921 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 23:02:10,921 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 23:02:10,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:02:10 BoogieIcfgContainer [2023-02-18 23:02:10,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 23:02:10,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 23:02:10,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 23:02:10,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 23:02:10,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 11:02:09" (1/3) ... [2023-02-18 23:02:10,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449114ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:02:10, skipping insertion in model container [2023-02-18 23:02:10,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:02:10" (2/3) ... [2023-02-18 23:02:10,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449114ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:02:10, skipping insertion in model container [2023-02-18 23:02:10,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:02:10" (3/3) ... [2023-02-18 23:02:10,929 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2023-02-18 23:02:10,944 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 23:02:10,944 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-18 23:02:11,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 23:02:11,023 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;@72cdc11, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 23:02:11,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-18 23:02:11,027 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-18 23:02:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 23:02:11,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:11,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:11,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1525933714, now seen corresponding path program 1 times [2023-02-18 23:02:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:11,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326940972] [2023-02-18 23:02:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:11,057 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-18 23:02:11,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:11,061 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-18 23:02:11,063 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-18 23:02:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:11,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 23:02:11,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:11,151 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-18 23:02:11,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:02:11,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:11,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326940972] [2023-02-18 23:02:11,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326940972] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:02:11,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:02:11,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-18 23:02:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093054539] [2023-02-18 23:02:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:02:11,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 23:02:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:11,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 23:02:11,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 23:02:11,194 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-18 23:02:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:11,231 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2023-02-18 23:02:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 23:02:11,233 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-18 23:02:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:11,244 INFO L225 Difference]: With dead ends: 185 [2023-02-18 23:02:11,244 INFO L226 Difference]: Without dead ends: 73 [2023-02-18 23:02:11,249 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-18 23:02:11,252 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-18 23:02:11,253 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-18 23:02:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-18 23:02:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-18 23:02:11,293 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-18 23:02:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2023-02-18 23:02:11,303 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 9 [2023-02-18 23:02:11,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:11,304 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2023-02-18 23:02:11,304 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-18 23:02:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2023-02-18 23:02:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 23:02:11,306 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:11,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:11,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 23:02:11,515 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-18 23:02:11,515 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:11,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1524992448, now seen corresponding path program 1 times [2023-02-18 23:02:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:11,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208527307] [2023-02-18 23:02:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:11,517 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-18 23:02:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:11,519 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-18 23:02:11,521 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-18 23:02:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:11,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:02:11,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:11,595 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-18 23:02:11,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:02:11,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:11,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208527307] [2023-02-18 23:02:11,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208527307] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:02:11,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:02:11,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:02:11,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616518347] [2023-02-18 23:02:11,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:02:11,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:02:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:11,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:02:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:02:11,598 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-18 23:02:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:11,669 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2023-02-18 23:02:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:02:11,671 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-18 23:02:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:11,674 INFO L225 Difference]: With dead ends: 151 [2023-02-18 23:02:11,675 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 23:02:11,679 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-18 23:02:11,680 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-18 23:02:11,680 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-18 23:02:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 23:02:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-02-18 23:02:11,688 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-18 23:02:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-18 23:02:11,691 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 9 [2023-02-18 23:02:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:11,692 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-18 23:02:11,692 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-18 23:02:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-18 23:02:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 23:02:11,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:11,693 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:11,704 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-18 23:02:11,901 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-18 23:02:11,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1370428688, now seen corresponding path program 1 times [2023-02-18 23:02:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:11,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722443350] [2023-02-18 23:02:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:11,910 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-18 23:02:11,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:11,912 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-18 23:02:11,915 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-18 23:02:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:11,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:02:11,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:11,967 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-18 23:02:11,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:02:11,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:11,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722443350] [2023-02-18 23:02:11,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722443350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:02:11,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:02:11,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:02:11,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413600854] [2023-02-18 23:02:11,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:02:11,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:02:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:02:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:02:11,970 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-18 23:02:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:12,064 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2023-02-18 23:02:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:02:12,064 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-18 23:02:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:12,065 INFO L225 Difference]: With dead ends: 193 [2023-02-18 23:02:12,066 INFO L226 Difference]: Without dead ends: 125 [2023-02-18 23:02:12,066 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-18 23:02:12,067 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-18 23:02:12,068 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-18 23:02:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-18 23:02:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2023-02-18 23:02:12,085 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-18 23:02:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2023-02-18 23:02:12,086 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 16 [2023-02-18 23:02:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:12,086 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2023-02-18 23:02:12,087 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-18 23:02:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2023-02-18 23:02:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 23:02:12,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:12,088 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-18 23:02:12,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 23:02:12,297 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-18 23:02:12,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1635050763, now seen corresponding path program 1 times [2023-02-18 23:02:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:12,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971442658] [2023-02-18 23:02:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:12,299 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-18 23:02:12,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:12,300 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-18 23:02:12,301 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-18 23:02:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:12,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:02:12,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:12,347 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-18 23:02:12,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:02:12,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:12,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971442658] [2023-02-18 23:02:12,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971442658] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:02:12,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:02:12,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:02:12,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332257469] [2023-02-18 23:02:12,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:02:12,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:02:12,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:12,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:02:12,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:02:12,350 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-18 23:02:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:12,398 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2023-02-18 23:02:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:02:12,398 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-18 23:02:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:12,399 INFO L225 Difference]: With dead ends: 197 [2023-02-18 23:02:12,399 INFO L226 Difference]: Without dead ends: 104 [2023-02-18 23:02:12,400 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-18 23:02:12,401 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-18 23:02:12,402 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-18 23:02:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-18 23:02:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-02-18 23:02:12,409 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-18 23:02:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-02-18 23:02:12,410 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 21 [2023-02-18 23:02:12,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:12,410 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-02-18 23:02:12,411 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-18 23:02:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-02-18 23:02:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 23:02:12,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:12,412 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-18 23:02:12,421 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-18 23:02:12,620 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-18 23:02:12,620 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1476687918, now seen corresponding path program 1 times [2023-02-18 23:02:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:12,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177575923] [2023-02-18 23:02:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:12,622 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-18 23:02:12,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:12,624 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-18 23:02:12,626 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-18 23:02:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:12,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 23:02:12,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:12,729 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-18 23:02:12,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:02:12,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:12,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177575923] [2023-02-18 23:02:12,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177575923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:02:12,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:02:12,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 23:02:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953734650] [2023-02-18 23:02:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:02:12,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:02:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:02:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:02:12,731 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-18 23:02:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:12,781 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2023-02-18 23:02:12,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:02:12,781 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-18 23:02:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:12,782 INFO L225 Difference]: With dead ends: 190 [2023-02-18 23:02:12,782 INFO L226 Difference]: Without dead ends: 113 [2023-02-18 23:02:12,783 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-18 23:02:12,784 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-18 23:02:12,784 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-18 23:02:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-18 23:02:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2023-02-18 23:02:12,791 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-18 23:02:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2023-02-18 23:02:12,792 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 21 [2023-02-18 23:02:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:12,792 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2023-02-18 23:02:12,792 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-18 23:02:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2023-02-18 23:02:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 23:02:12,793 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:12,793 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-18 23:02:12,804 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-18 23:02:13,003 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-18 23:02:13,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:13,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1476578814, now seen corresponding path program 1 times [2023-02-18 23:02:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:13,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482069634] [2023-02-18 23:02:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:13,005 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-18 23:02:13,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:13,006 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-18 23:02:13,008 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-18 23:02:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:13,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 23:02:13,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:13,073 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-18 23:02:13,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:13,126 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-18 23:02:13,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482069634] [2023-02-18 23:02:13,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482069634] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:13,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:13,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-18 23:02:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945630593] [2023-02-18 23:02:13,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:13,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 23:02:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 23:02:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:02:13,128 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-18 23:02:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:13,621 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2023-02-18 23:02:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 23:02:13,624 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-18 23:02:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:13,625 INFO L225 Difference]: With dead ends: 217 [2023-02-18 23:02:13,625 INFO L226 Difference]: Without dead ends: 146 [2023-02-18 23:02:13,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-02-18 23:02:13,626 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 192 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:13,627 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.4s Time] [2023-02-18 23:02:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-18 23:02:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2023-02-18 23:02:13,647 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-18 23:02:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2023-02-18 23:02:13,649 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 21 [2023-02-18 23:02:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:13,651 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2023-02-18 23:02:13,651 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-18 23:02:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2023-02-18 23:02:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 23:02:13,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:13,653 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-18 23:02:13,662 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-18 23:02:13,861 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-18 23:02:13,862 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash -547019776, now seen corresponding path program 1 times [2023-02-18 23:02:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:13,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342696499] [2023-02-18 23:02:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:13,863 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-18 23:02:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:13,864 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-18 23:02:13,867 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-18 23:02:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:13,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:02:13,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:13,933 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-18 23:02:13,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:13,977 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-18 23:02:13,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342696499] [2023-02-18 23:02:13,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342696499] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:13,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:13,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 23:02:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125150573] [2023-02-18 23:02:13,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:13,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 23:02:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 23:02:13,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:02:13,982 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-18 23:02:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:14,158 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2023-02-18 23:02:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 23:02:14,159 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-18 23:02:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:14,166 INFO L225 Difference]: With dead ends: 217 [2023-02-18 23:02:14,166 INFO L226 Difference]: Without dead ends: 141 [2023-02-18 23:02:14,167 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-18 23:02:14,167 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-18 23:02:14,168 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-18 23:02:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-18 23:02:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2023-02-18 23:02:14,178 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-18 23:02:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2023-02-18 23:02:14,178 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 26 [2023-02-18 23:02:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:14,179 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2023-02-18 23:02:14,179 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-18 23:02:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2023-02-18 23:02:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 23:02:14,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:14,180 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-18 23:02:14,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-18 23:02:14,389 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-18 23:02:14,389 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash -198921976, now seen corresponding path program 1 times [2023-02-18 23:02:14,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:14,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844822581] [2023-02-18 23:02:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:14,391 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-18 23:02:14,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:14,392 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-18 23:02:14,395 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-18 23:02:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:14,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:02:14,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:14,457 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-18 23:02:14,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:14,535 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-18 23:02:14,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:14,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844822581] [2023-02-18 23:02:14,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844822581] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:14,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:14,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 23:02:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10632001] [2023-02-18 23:02:14,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:14,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 23:02:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:14,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 23:02:14,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:02:14,538 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-18 23:02:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:15,054 INFO L93 Difference]: Finished difference Result 307 states and 370 transitions. [2023-02-18 23:02:15,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 23:02:15,056 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-18 23:02:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:15,057 INFO L225 Difference]: With dead ends: 307 [2023-02-18 23:02:15,057 INFO L226 Difference]: Without dead ends: 234 [2023-02-18 23:02:15,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:02:15,059 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 155 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:15,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 427 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 23:02:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-18 23:02:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 121. [2023-02-18 23:02:15,072 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-18 23:02:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2023-02-18 23:02:15,074 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 38 [2023-02-18 23:02:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:15,075 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2023-02-18 23:02:15,076 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-18 23:02:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2023-02-18 23:02:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 23:02:15,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:15,077 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-18 23:02:15,089 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-18 23:02:15,286 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-18 23:02:15,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1144709760, now seen corresponding path program 2 times [2023-02-18 23:02:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:15,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951663551] [2023-02-18 23:02:15,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:02:15,287 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-18 23:02:15,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:15,289 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-18 23:02:15,291 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-18 23:02:15,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:02:15,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:02:15,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 23:02:15,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:15,395 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-18 23:02:15,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:02:15,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951663551] [2023-02-18 23:02:15,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951663551] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:15,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:15,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2023-02-18 23:02:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108317258] [2023-02-18 23:02:15,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:15,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 23:02:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 23:02:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-02-18 23:02:15,820 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 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-18 23:02:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:18,513 INFO L93 Difference]: Finished difference Result 289 states and 340 transitions. [2023-02-18 23:02:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-18 23:02:18,515 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 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-18 23:02:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:18,517 INFO L225 Difference]: With dead ends: 289 [2023-02-18 23:02:18,517 INFO L226 Difference]: Without dead ends: 219 [2023-02-18 23:02:18,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=483, Invalid=1157, Unknown=0, NotChecked=0, Total=1640 [2023-02-18 23:02:18,518 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 444 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:18,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 882 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-18 23:02:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-18 23:02:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 159. [2023-02-18 23:02:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 151 states have internal predecessors, (177), 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-18 23:02:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2023-02-18 23:02:18,532 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 46 [2023-02-18 23:02:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:18,532 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2023-02-18 23:02:18,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 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-18 23:02:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2023-02-18 23:02:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-18 23:02:18,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:18,534 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:18,547 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-18 23:02:18,742 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-18 23:02:18,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -152093639, now seen corresponding path program 1 times [2023-02-18 23:02:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:18,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567121037] [2023-02-18 23:02:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:18,744 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-18 23:02:18,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:18,745 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-18 23:02:18,756 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-18 23:02:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:18,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 23:02:18,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:02:18,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:02:18,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:18,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567121037] [2023-02-18 23:02:18,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567121037] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:18,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:18,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-18 23:02:18,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127711427] [2023-02-18 23:02:18,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:18,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 23:02:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:18,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 23:02:18,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2023-02-18 23:02:18,975 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand has 20 states, 20 states have (on average 4.35) internal successors, (87), 18 states have internal predecessors, (87), 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-18 23:02:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:19,443 INFO L93 Difference]: Finished difference Result 341 states and 406 transitions. [2023-02-18 23:02:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 23:02:19,444 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 18 states have internal predecessors, (87), 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 52 [2023-02-18 23:02:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:19,445 INFO L225 Difference]: With dead ends: 341 [2023-02-18 23:02:19,445 INFO L226 Difference]: Without dead ends: 232 [2023-02-18 23:02:19,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=428, Invalid=1054, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 23:02:19,446 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 372 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:19,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1033 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:02:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-18 23:02:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 196. [2023-02-18 23:02:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 177 states have (on average 1.2485875706214689) internal successors, (221), 188 states have internal predecessors, (221), 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-18 23:02:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2023-02-18 23:02:19,461 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 52 [2023-02-18 23:02:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:19,462 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2023-02-18 23:02:19,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 18 states have internal predecessors, (87), 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-18 23:02:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2023-02-18 23:02:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-18 23:02:19,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:19,466 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:19,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 23:02:19,675 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-18 23:02:19,675 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:19,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2049039940, now seen corresponding path program 1 times [2023-02-18 23:02:19,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:19,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122593283] [2023-02-18 23:02:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:19,677 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-18 23:02:19,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:19,678 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-18 23:02:19,678 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-18 23:02:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:19,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 23:02:19,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:02:19,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:02:20,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122593283] [2023-02-18 23:02:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122593283] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:20,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:20,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-18 23:02:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348967217] [2023-02-18 23:02:20,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:20,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 23:02:20,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:20,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 23:02:20,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-02-18 23:02:20,165 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 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-18 23:02:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:22,293 INFO L93 Difference]: Finished difference Result 558 states and 682 transitions. [2023-02-18 23:02:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-18 23:02:22,297 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 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 63 [2023-02-18 23:02:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:22,300 INFO L225 Difference]: With dead ends: 558 [2023-02-18 23:02:22,300 INFO L226 Difference]: Without dead ends: 458 [2023-02-18 23:02:22,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=431, Invalid=829, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 23:02:22,302 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 660 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:22,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1058 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-18 23:02:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-02-18 23:02:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 198. [2023-02-18 23:02:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.2011173184357542) internal successors, (215), 190 states have internal predecessors, (215), 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-18 23:02:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2023-02-18 23:02:22,339 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 63 [2023-02-18 23:02:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:22,340 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2023-02-18 23:02:22,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 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-18 23:02:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2023-02-18 23:02:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-18 23:02:22,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:22,341 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:22,352 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-18 23:02:22,542 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-18 23:02:22,542 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1535312679, now seen corresponding path program 2 times [2023-02-18 23:02:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:22,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445730045] [2023-02-18 23:02:22,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:02:22,543 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-18 23:02:22,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:22,544 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-18 23:02:22,545 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-18 23:02:22,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 23:02:22,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:02:22,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 23:02:22,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2023-02-18 23:02:22,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:02:22,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:22,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445730045] [2023-02-18 23:02:22,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445730045] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:02:22,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:02:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:02:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344549314] [2023-02-18 23:02:22,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:02:22,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:02:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:02:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:02:22,600 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-18 23:02:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:22,674 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2023-02-18 23:02:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 23:02:22,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 97 [2023-02-18 23:02:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:22,678 INFO L225 Difference]: With dead ends: 210 [2023-02-18 23:02:22,678 INFO L226 Difference]: Without dead ends: 208 [2023-02-18 23:02:22,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:02:22,679 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 20 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:22,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 227 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:02:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-18 23:02:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 201. [2023-02-18 23:02:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 183 states have (on average 1.185792349726776) internal successors, (217), 193 states have internal predecessors, (217), 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-18 23:02:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2023-02-18 23:02:22,700 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 97 [2023-02-18 23:02:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:22,700 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2023-02-18 23:02:22,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-18 23:02:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2023-02-18 23:02:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-18 23:02:22,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:22,702 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:22,709 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-18 23:02:22,905 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-18 23:02:22,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2033261943, now seen corresponding path program 1 times [2023-02-18 23:02:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:22,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555449557] [2023-02-18 23:02:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:22,906 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-18 23:02:22,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:22,907 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-18 23:02:22,908 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-18 23:02:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:22,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 23:02:22,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 2 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:02:23,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 2 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:02:23,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:23,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555449557] [2023-02-18 23:02:23,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555449557] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:23,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:23,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2023-02-18 23:02:23,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577911236] [2023-02-18 23:02:23,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:23,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-18 23:02:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-18 23:02:23,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 23:02:23,577 INFO L87 Difference]: Start difference. First operand 201 states and 225 transitions. Second operand has 38 states, 38 states have (on average 4.7105263157894735) internal successors, (179), 36 states have internal predecessors, (179), 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-18 23:02:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:25,031 INFO L93 Difference]: Finished difference Result 466 states and 548 transitions. [2023-02-18 23:02:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-18 23:02:25,038 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.7105263157894735) internal successors, (179), 36 states have internal predecessors, (179), 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 99 [2023-02-18 23:02:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:25,041 INFO L225 Difference]: With dead ends: 466 [2023-02-18 23:02:25,041 INFO L226 Difference]: Without dead ends: 360 [2023-02-18 23:02:25,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1256, Invalid=4596, Unknown=0, NotChecked=0, Total=5852 [2023-02-18 23:02:25,044 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 873 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:25,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 2820 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 23:02:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-02-18 23:02:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 289. [2023-02-18 23:02:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 271 states have (on average 1.1918819188191883) internal successors, (323), 281 states have internal predecessors, (323), 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-18 23:02:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 331 transitions. [2023-02-18 23:02:25,069 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 331 transitions. Word has length 99 [2023-02-18 23:02:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:25,070 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 331 transitions. [2023-02-18 23:02:25,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.7105263157894735) internal successors, (179), 36 states have internal predecessors, (179), 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-18 23:02:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 331 transitions. [2023-02-18 23:02:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-02-18 23:02:25,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:25,072 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:25,083 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-18 23:02:25,280 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-18 23:02:25,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash 611998222, now seen corresponding path program 2 times [2023-02-18 23:02:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:25,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414261080] [2023-02-18 23:02:25,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:02:25,282 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-18 23:02:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:25,283 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-18 23:02:25,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-18 23:02:25,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:02:25,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:02:25,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 23:02:25,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 9 proven. 632 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:02:25,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 9 proven. 632 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:02:26,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:26,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414261080] [2023-02-18 23:02:26,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414261080] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:26,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:26,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2023-02-18 23:02:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487467670] [2023-02-18 23:02:26,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:26,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-18 23:02:26,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:26,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-18 23:02:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 23:02:26,886 INFO L87 Difference]: Start difference. First operand 289 states and 331 transitions. Second operand has 38 states, 38 states have (on average 5.0) internal successors, (190), 38 states have internal predecessors, (190), 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-18 23:02:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:34,625 INFO L93 Difference]: Finished difference Result 931 states and 1123 transitions. [2023-02-18 23:02:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-02-18 23:02:34,629 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.0) internal successors, (190), 38 states have internal predecessors, (190), 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 108 [2023-02-18 23:02:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:34,633 INFO L225 Difference]: With dead ends: 931 [2023-02-18 23:02:34,633 INFO L226 Difference]: Without dead ends: 828 [2023-02-18 23:02:34,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1673, Invalid=3439, Unknown=0, NotChecked=0, Total=5112 [2023-02-18 23:02:34,635 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1313 mSDsluCounter, 2940 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 4518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:34,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 3100 Invalid, 4518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-02-18 23:02:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2023-02-18 23:02:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 291. [2023-02-18 23:02:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 273 states have (on average 1.1282051282051282) internal successors, (308), 283 states have internal predecessors, (308), 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-18 23:02:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 316 transitions. [2023-02-18 23:02:34,676 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 316 transitions. Word has length 108 [2023-02-18 23:02:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:34,677 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 316 transitions. [2023-02-18 23:02:34,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.0) internal successors, (190), 38 states have internal predecessors, (190), 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-18 23:02:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 316 transitions. [2023-02-18 23:02:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-02-18 23:02:34,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:34,678 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, 1, 1, 1] [2023-02-18 23:02:34,690 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-18 23:02:34,887 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-18 23:02:34,888 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1449922441, now seen corresponding path program 2 times [2023-02-18 23:02:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:34,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800851622] [2023-02-18 23:02:34,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:02:34,889 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-18 23:02:34,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:34,891 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-18 23:02:34,893 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-18 23:02:34,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:02:34,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:02:34,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-18 23:02:34,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:35,373 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-18 23:02:35,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:02:37,064 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-18 23:02:37,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:37,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800851622] [2023-02-18 23:02:37,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800851622] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:02:37,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 23:02:37,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-18 23:02:37,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011130439] [2023-02-18 23:02:37,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 23:02:37,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-18 23:02:37,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:37,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-18 23:02:37,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=2132, Unknown=0, NotChecked=0, Total=2862 [2023-02-18 23:02:37,066 INFO L87 Difference]: Start difference. First operand 291 states and 316 transitions. Second operand has 54 states, 53 states have (on average 5.0) internal successors, (265), 52 states have internal predecessors, (265), 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-18 23:02:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:43,746 INFO L93 Difference]: Finished difference Result 444 states and 503 transitions. [2023-02-18 23:02:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-02-18 23:02:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 5.0) internal successors, (265), 52 states have internal predecessors, (265), 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 139 [2023-02-18 23:02:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:43,749 INFO L225 Difference]: With dead ends: 444 [2023-02-18 23:02:43,749 INFO L226 Difference]: Without dead ends: 443 [2023-02-18 23:02:43,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 222 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2880, Invalid=8040, Unknown=0, NotChecked=0, Total=10920 [2023-02-18 23:02:43,752 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 1505 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:43,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 3351 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-18 23:02:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-18 23:02:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 375. [2023-02-18 23:02:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 357 states have (on average 1.184873949579832) internal successors, (423), 367 states have internal predecessors, (423), 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-18 23:02:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 431 transitions. [2023-02-18 23:02:43,798 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 431 transitions. Word has length 139 [2023-02-18 23:02:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:43,798 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 431 transitions. [2023-02-18 23:02:43,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 5.0) internal successors, (265), 52 states have internal predecessors, (265), 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-18 23:02:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 431 transitions. [2023-02-18 23:02:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-18 23:02:43,800 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:43,800 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-18 23:02:43,812 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-18 23:02:44,009 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-18 23:02:44,010 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1305368822, now seen corresponding path program 1 times [2023-02-18 23:02:44,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047331907] [2023-02-18 23:02:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:44,011 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-18 23:02:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:44,012 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-18 23:02:44,015 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-18 23:02:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:02:44,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:02:44,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:02:44,126 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-18 23:02:44,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:02:44,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 23:02:44,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047331907] [2023-02-18 23:02:44,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047331907] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:02:44,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:02:44,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:02:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471762848] [2023-02-18 23:02:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:02:44,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:02:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 23:02:44,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:02:44,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:02:44,128 INFO L87 Difference]: Start difference. First operand 375 states and 431 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-18 23:02:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:02:44,589 INFO L93 Difference]: Finished difference Result 392 states and 451 transitions. [2023-02-18 23:02:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:02:44,590 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-18 23:02:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:02:44,592 INFO L225 Difference]: With dead ends: 392 [2023-02-18 23:02:44,592 INFO L226 Difference]: Without dead ends: 390 [2023-02-18 23:02:44,593 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-18 23:02:44,594 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 23:02:44,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 170 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 23:02:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-02-18 23:02:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2023-02-18 23:02:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 359 states have (on average 1.1866295264623956) internal successors, (426), 369 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-18 23:02:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 434 transitions. [2023-02-18 23:02:44,638 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 434 transitions. Word has length 152 [2023-02-18 23:02:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:02:44,638 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 434 transitions. [2023-02-18 23:02:44,638 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-18 23:02:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 434 transitions. [2023-02-18 23:02:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-02-18 23:02:44,640 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:02:44,640 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-18 23:02:44,649 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-18 23:02:44,849 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-18 23:02:44,849 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-18 23:02:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:02:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1608575873, now seen corresponding path program 1 times [2023-02-18 23:02:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 23:02:44,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112842762] [2023-02-18 23:02:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:02:44,850 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-18 23:02:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 23:02:44,851 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 23:02:44,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-18 23:02:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 23:02:44,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 23:02:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 23:02:45,024 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-18 23:02:45,024 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 23:02:45,025 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-18 23:02:45,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-18 23:02:45,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-18 23:02:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-18 23:02:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-18 23:02:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-18 23:02:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-18 23:02:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-18 23:02:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-18 23:02:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-18 23:02:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-18 23:02:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-18 23:02:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-18 23:02:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-18 23:02:45,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-18 23:02:45,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-18 23:02:45,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-18 23:02:45,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-18 23:02:45,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-18 23:02:45,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-18 23:02:45,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-18 23:02:45,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-18 23:02:45,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-18 23:02:45,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-18 23:02:45,042 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 (18)] Forceful destruction successful, exit code 0 [2023-02-18 23:02:45,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 23:02:45,243 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:02:45,246 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 23:02:45,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 11:02:45 BoogieIcfgContainer [2023-02-18 23:02:45,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 23:02:45,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 23:02:45,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 23:02:45,312 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 23:02:45,313 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:02:10" (3/4) ... [2023-02-18 23:02:45,314 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 23:02:45,388 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 23:02:45,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 23:02:45,389 INFO L158 Benchmark]: Toolchain (without parser) took 35450.80ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 49.7MB in the beginning and 32.8MB in the end (delta: 16.9MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2023-02-18 23:02:45,390 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 23:02:45,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.20ms. Allocated memory is still 73.4MB. Free memory was 49.5MB in the beginning and 35.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 23:02:45,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.11ms. Allocated memory is still 73.4MB. Free memory was 35.3MB in the beginning and 33.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 23:02:45,390 INFO L158 Benchmark]: Boogie Preprocessor took 58.63ms. Allocated memory is still 73.4MB. Free memory was 33.4MB in the beginning and 51.3MB in the end (delta: -17.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-02-18 23:02:45,391 INFO L158 Benchmark]: RCFGBuilder took 526.16ms. Allocated memory is still 73.4MB. Free memory was 51.3MB in the beginning and 34.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-18 23:02:45,391 INFO L158 Benchmark]: TraceAbstraction took 34386.79ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 34.0MB in the beginning and 39.1MB in the end (delta: -5.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2023-02-18 23:02:45,391 INFO L158 Benchmark]: Witness Printer took 76.31ms. Allocated memory is still 107.0MB. Free memory was 39.1MB in the beginning and 32.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-18 23:02:45,396 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 56.6MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.20ms. Allocated memory is still 73.4MB. Free memory was 49.5MB in the beginning and 35.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.11ms. Allocated memory is still 73.4MB. Free memory was 35.3MB in the beginning and 33.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.63ms. Allocated memory is still 73.4MB. Free memory was 33.4MB in the beginning and 51.3MB in the end (delta: -17.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * RCFGBuilder took 526.16ms. Allocated memory is still 73.4MB. Free memory was 51.3MB in the beginning and 34.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34386.79ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 34.0MB in the beginning and 39.1MB in the end (delta: -5.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Witness Printer took 76.31ms. Allocated memory is still 107.0MB. Free memory was 39.1MB in the beginning and 32.8MB 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: 34.2s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5902 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5902 mSDsluCounter, 14935 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13369 mSDsCounter, 689 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11280 IncrementalHoareTripleChecker+Invalid, 11969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 689 mSolverCounterUnsat, 1566 mSDtfsCounter, 11280 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1808 GetRequests, 1365 SyntacticMatches, 19 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3034 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=16, InterpolantAutomatonStates: 301, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1265 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1072 NumberOfCodeBlocks, 990 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1484 ConstructedInterpolants, 8 QuantifiedInterpolants, 14245 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1407 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 2087/7941 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-18 23:02:45,425 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)