./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 20:50:09,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 20:50:09,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 20:50:09,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 20:50:09,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 20:50:09,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 20:50:09,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 20:50:09,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 20:50:09,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 20:50:09,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 20:50:09,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 20:50:09,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 20:50:09,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 20:50:09,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 20:50:09,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 20:50:09,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 20:50:09,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 20:50:09,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 20:50:09,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 20:50:09,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 20:50:09,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 20:50:09,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 20:50:09,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 20:50:09,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 20:50:09,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 20:50:09,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 20:50:09,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 20:50:09,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 20:50:09,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 20:50:09,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 20:50:09,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 20:50:09,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 20:50:09,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 20:50:09,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 20:50:09,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 20:50:09,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 20:50:09,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 20:50:09,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 20:50:09,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 20:50:09,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 20:50:09,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 20:50:09,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-21 20:50:09,442 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 20:50:09,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 20:50:09,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 20:50:09,446 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 20:50:09,446 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 20:50:09,446 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 20:50:09,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 20:50:09,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 20:50:09,447 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 20:50:09,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 20:50:09,448 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 20:50:09,448 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 20:50:09,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 20:50:09,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 20:50:09,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 20:50:09,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 20:50:09,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 20:50:09,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 20:50:09,449 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-21 20:50:09,449 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 20:50:09,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 20:50:09,449 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 20:50:09,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 20:50:09,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 20:50:09,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 20:50:09,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 20:50:09,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:50:09,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 20:50:09,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 20:50:09,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 20:50:09,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 20:50:09,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 20:50:09,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 20:50:09,452 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 20:50:09,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2021-12-21 20:50:09,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 20:50:09,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 20:50:09,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 20:50:09,700 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 20:50:09,700 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 20:50:09,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2021-12-21 20:50:09,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05dda2b8e/12d44bd803194555862ebe5e20b99599/FLAGb6355b75c [2021-12-21 20:50:10,152 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 20:50:10,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2021-12-21 20:50:10,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05dda2b8e/12d44bd803194555862ebe5e20b99599/FLAGb6355b75c [2021-12-21 20:50:10,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05dda2b8e/12d44bd803194555862ebe5e20b99599 [2021-12-21 20:50:10,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 20:50:10,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 20:50:10,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 20:50:10,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 20:50:10,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 20:50:10,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a8a190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10, skipping insertion in model container [2021-12-21 20:50:10,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 20:50:10,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:50:10,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2021-12-21 20:50:10,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:50:10,439 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 20:50:10,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2021-12-21 20:50:10,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:50:10,499 INFO L208 MainTranslator]: Completed translation [2021-12-21 20:50:10,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10 WrapperNode [2021-12-21 20:50:10,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 20:50:10,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 20:50:10,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 20:50:10,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 20:50:10,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,551 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 157 [2021-12-21 20:50:10,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 20:50:10,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 20:50:10,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 20:50:10,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 20:50:10,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 20:50:10,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 20:50:10,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 20:50:10,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 20:50:10,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (1/1) ... [2021-12-21 20:50:10,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:50:10,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:10,615 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) [2021-12-21 20:50:10,631 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 [2021-12-21 20:50:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 20:50:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 20:50:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2021-12-21 20:50:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2021-12-21 20:50:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 20:50:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 20:50:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-21 20:50:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-21 20:50:10,758 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 20:50:10,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 20:50:11,010 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 20:50:11,015 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 20:50:11,015 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 20:50:11,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:11 BoogieIcfgContainer [2021-12-21 20:50:11,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 20:50:11,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 20:50:11,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 20:50:11,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 20:50:11,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:50:10" (1/3) ... [2021-12-21 20:50:11,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506d5035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:50:11, skipping insertion in model container [2021-12-21 20:50:11,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:50:10" (2/3) ... [2021-12-21 20:50:11,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506d5035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:50:11, skipping insertion in model container [2021-12-21 20:50:11,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:11" (3/3) ... [2021-12-21 20:50:11,035 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2021-12-21 20:50:11,038 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 20:50:11,038 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-12-21 20:50:11,075 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 20:50:11,080 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 20:50:11,081 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-12-21 20:50:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 92 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-21 20:50:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 20:50:11,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,101 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1558059187, now seen corresponding path program 1 times [2021-12-21 20:50:11,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131395531] [2021-12-21 20:50:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:50:11,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131395531] [2021-12-21 20:50:11,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131395531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:50:11,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420901354] [2021-12-21 20:50:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 20:50:11,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 20:50:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 20:50:11,272 INFO L87 Difference]: Start difference. First operand has 102 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 92 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.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) [2021-12-21 20:50:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,297 INFO L93 Difference]: Finished difference Result 199 states and 289 transitions. [2021-12-21 20:50:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 20:50:11,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.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 [2021-12-21 20:50:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,307 INFO L225 Difference]: With dead ends: 199 [2021-12-21 20:50:11,307 INFO L226 Difference]: Without dead ends: 72 [2021-12-21 20:50:11,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 20:50:11,311 INFO L933 BasicCegarLoop]: 135 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, 135 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 [2021-12-21 20:50:11,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-21 20:50:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-21 20:50:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.5) internal successors, (75), 63 states have internal predecessors, (75), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2021-12-21 20:50:11,341 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 9 [2021-12-21 20:50:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,341 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2021-12-21 20:50:11,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.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) [2021-12-21 20:50:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2021-12-21 20:50:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 20:50:11,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,342 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 20:50:11,343 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1559000453, now seen corresponding path program 1 times [2021-12-21 20:50:11,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638401355] [2021-12-21 20:50:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:50:11,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638401355] [2021-12-21 20:50:11,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638401355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:50:11,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078641173] [2021-12-21 20:50:11,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:11,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:50:11,409 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. 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) [2021-12-21 20:50:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,463 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2021-12-21 20:50:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:11,464 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 [2021-12-21 20:50:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,466 INFO L225 Difference]: With dead ends: 181 [2021-12-21 20:50:11,467 INFO L226 Difference]: Without dead ends: 112 [2021-12-21 20:50:11,467 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:50:11,468 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:11,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 230 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-21 20:50:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2021-12-21 20:50:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.475) internal successors, (118), 93 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2021-12-21 20:50:11,493 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 9 [2021-12-21 20:50:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,493 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2021-12-21 20:50:11,493 INFO L471 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) [2021-12-21 20:50:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2021-12-21 20:50:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 20:50:11,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 20:50:11,495 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2128694526, now seen corresponding path program 1 times [2021-12-21 20:50:11,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077294353] [2021-12-21 20:50:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:50:11,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077294353] [2021-12-21 20:50:11,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077294353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:11,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122596105] [2021-12-21 20:50:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:11,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:11,547 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-21 20:50:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,640 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2021-12-21 20:50:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2021-12-21 20:50:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,642 INFO L225 Difference]: With dead ends: 122 [2021-12-21 20:50:11,642 INFO L226 Difference]: Without dead ends: 120 [2021-12-21 20:50:11,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:50:11,643 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 72 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:11,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 310 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-21 20:50:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2021-12-21 20:50:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.451219512195122) internal successors, (119), 95 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2021-12-21 20:50:11,651 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 13 [2021-12-21 20:50:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,652 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2021-12-21 20:50:11,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-21 20:50:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2021-12-21 20:50:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 20:50:11,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 20:50:11,653 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1565020765, now seen corresponding path program 1 times [2021-12-21 20:50:11,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333363878] [2021-12-21 20:50:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:50:11,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333363878] [2021-12-21 20:50:11,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333363878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:11,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171285678] [2021-12-21 20:50:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:11,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:11,688 INFO L87 Difference]: Start difference. First operand 105 states and 131 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) [2021-12-21 20:50:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,760 INFO L93 Difference]: Finished difference Result 198 states and 239 transitions. [2021-12-21 20:50:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:11,761 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 [2021-12-21 20:50:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,763 INFO L225 Difference]: With dead ends: 198 [2021-12-21 20:50:11,763 INFO L226 Difference]: Without dead ends: 126 [2021-12-21 20:50:11,764 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:50:11,764 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 84 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:11,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 313 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-21 20:50:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2021-12-21 20:50:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.430232558139535) internal successors, (123), 99 states have internal predecessors, (123), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2021-12-21 20:50:11,774 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 14 [2021-12-21 20:50:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,774 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2021-12-21 20:50:11,774 INFO L471 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) [2021-12-21 20:50:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2021-12-21 20:50:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 20:50:11,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,775 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 20:50:11,775 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1313459023, now seen corresponding path program 1 times [2021-12-21 20:50:11,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608595821] [2021-12-21 20:50:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:50:11,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608595821] [2021-12-21 20:50:11,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608595821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:11,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:11,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:11,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71153615] [2021-12-21 20:50:11,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:11,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:11,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:11,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:11,816 INFO L87 Difference]: Start difference. First operand 109 states and 135 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, (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) [2021-12-21 20:50:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:11,864 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2021-12-21 20:50:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:11,865 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, (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 [2021-12-21 20:50:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:11,866 INFO L225 Difference]: With dead ends: 150 [2021-12-21 20:50:11,866 INFO L226 Difference]: Without dead ends: 147 [2021-12-21 20:50:11,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:50:11,867 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 99 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:11,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 247 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-21 20:50:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2021-12-21 20:50:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 119 states have internal predecessors, (153), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2021-12-21 20:50:11,877 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 16 [2021-12-21 20:50:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:11,878 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2021-12-21 20:50:11,878 INFO L471 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, (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) [2021-12-21 20:50:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2021-12-21 20:50:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 20:50:11,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:11,879 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:11,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 20:50:11,879 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1405311915, now seen corresponding path program 1 times [2021-12-21 20:50:11,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509988172] [2021-12-21 20:50:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:50:11,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:11,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509988172] [2021-12-21 20:50:11,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509988172] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:11,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984355998] [2021-12-21 20:50:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:11,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:11,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:11,928 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) [2021-12-21 20:50:11,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 20:50:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:11,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:50:11,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:50:12,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:50:12,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984355998] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:50:12,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-21 20:50:12,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729225050] [2021-12-21 20:50:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:12,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:50:12,084 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:50:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,123 INFO L93 Difference]: Finished difference Result 158 states and 198 transitions. [2021-12-21 20:50:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:12,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 20:50:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,124 INFO L225 Difference]: With dead ends: 158 [2021-12-21 20:50:12,125 INFO L226 Difference]: Without dead ends: 157 [2021-12-21 20:50:12,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:50:12,126 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:12,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 174 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-21 20:50:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 128. [2021-12-21 20:50:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 117 states have internal predecessors, (149), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 161 transitions. [2021-12-21 20:50:12,148 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 161 transitions. Word has length 15 [2021-12-21 20:50:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,148 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 161 transitions. [2021-12-21 20:50:12,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:50:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2021-12-21 20:50:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-21 20:50:12,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,149 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:12,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-21 20:50:12,376 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2062523992, now seen corresponding path program 1 times [2021-12-21 20:50:12,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115759454] [2021-12-21 20:50:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 20:50:12,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115759454] [2021-12-21 20:50:12,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115759454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:50:12,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453869856] [2021-12-21 20:50:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:50:12,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:50:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:50:12,419 INFO L87 Difference]: Start difference. First operand 128 states and 161 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, (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) [2021-12-21 20:50:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,441 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2021-12-21 20:50:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:50:12,442 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, (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 17 [2021-12-21 20:50:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,443 INFO L225 Difference]: With dead ends: 137 [2021-12-21 20:50:12,443 INFO L226 Difference]: Without dead ends: 136 [2021-12-21 20:50:12,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:50:12,444 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:12,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 160 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-21 20:50:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2021-12-21 20:50:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 114 states have internal predecessors, (144), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2021-12-21 20:50:12,453 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 17 [2021-12-21 20:50:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,453 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2021-12-21 20:50:12,453 INFO L471 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, (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) [2021-12-21 20:50:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2021-12-21 20:50:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 20:50:12,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,454 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 20:50:12,455 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1373713817, now seen corresponding path program 1 times [2021-12-21 20:50:12,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353955848] [2021-12-21 20:50:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:50:12,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353955848] [2021-12-21 20:50:12,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353955848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:12,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435312458] [2021-12-21 20:50:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:12,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:12,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:12,491 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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) [2021-12-21 20:50:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,539 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2021-12-21 20:50:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:12,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-12-21 20:50:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,541 INFO L225 Difference]: With dead ends: 145 [2021-12-21 20:50:12,541 INFO L226 Difference]: Without dead ends: 143 [2021-12-21 20:50:12,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:50:12,545 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 87 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:12,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 246 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-21 20:50:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2021-12-21 20:50:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 117 states have internal predecessors, (146), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2021-12-21 20:50:12,564 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 18 [2021-12-21 20:50:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,564 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2021-12-21 20:50:12,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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) [2021-12-21 20:50:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2021-12-21 20:50:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-21 20:50:12,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,565 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 20:50:12,566 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2062413909, now seen corresponding path program 1 times [2021-12-21 20:50:12,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266318846] [2021-12-21 20:50:12,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 20:50:12,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266318846] [2021-12-21 20:50:12,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266318846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:50:12,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235620989] [2021-12-21 20:50:12,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:50:12,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:50:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:50:12,593 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:50:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,618 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2021-12-21 20:50:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:50:12,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-21 20:50:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,620 INFO L225 Difference]: With dead ends: 157 [2021-12-21 20:50:12,620 INFO L226 Difference]: Without dead ends: 156 [2021-12-21 20:50:12,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:50:12,621 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:12,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-21 20:50:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2021-12-21 20:50:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 114 states have internal predecessors, (142), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2021-12-21 20:50:12,630 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 19 [2021-12-21 20:50:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,630 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2021-12-21 20:50:12,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:50:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2021-12-21 20:50:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 20:50:12,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,632 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 20:50:12,632 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,632 INFO L85 PathProgramCache]: Analyzing trace with hash 473395197, now seen corresponding path program 1 times [2021-12-21 20:50:12,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245620397] [2021-12-21 20:50:12,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 20:50:12,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245620397] [2021-12-21 20:50:12,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245620397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:12,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582411302] [2021-12-21 20:50:12,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:12,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:12,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:12,678 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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) [2021-12-21 20:50:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,720 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2021-12-21 20:50:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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 23 [2021-12-21 20:50:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,721 INFO L225 Difference]: With dead ends: 139 [2021-12-21 20:50:12,721 INFO L226 Difference]: Without dead ends: 137 [2021-12-21 20:50:12,721 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:50:12,722 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 93 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:12,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 243 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-21 20:50:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2021-12-21 20:50:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 108 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2021-12-21 20:50:12,729 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 23 [2021-12-21 20:50:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,729 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2021-12-21 20:50:12,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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) [2021-12-21 20:50:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2021-12-21 20:50:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 20:50:12,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,730 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 20:50:12,730 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash 553700837, now seen corresponding path program 1 times [2021-12-21 20:50:12,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542305590] [2021-12-21 20:50:12,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 20:50:12,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542305590] [2021-12-21 20:50:12,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542305590] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:12,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:12,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:50:12,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821027063] [2021-12-21 20:50:12,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:12,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:50:12,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:50:12,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:50:12,768 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-21 20:50:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:12,812 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2021-12-21 20:50:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2021-12-21 20:50:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:12,814 INFO L225 Difference]: With dead ends: 133 [2021-12-21 20:50:12,814 INFO L226 Difference]: Without dead ends: 131 [2021-12-21 20:50:12,814 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:50:12,815 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 243 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.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:12,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 243 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-21 20:50:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2021-12-21 20:50:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.34375) internal successors, (129), 103 states have internal predecessors, (129), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2021-12-21 20:50:12,823 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 25 [2021-12-21 20:50:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:12,824 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2021-12-21 20:50:12,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-21 20:50:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2021-12-21 20:50:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 20:50:12,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:12,824 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:12,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 20:50:12,825 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1677809465, now seen corresponding path program 1 times [2021-12-21 20:50:12,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:12,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750851306] [2021-12-21 20:50:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:50:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 20:50:12,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:12,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750851306] [2021-12-21 20:50:12,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750851306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:12,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017879420] [2021-12-21 20:50:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:12,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:12,950 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) [2021-12-21 20:50:12,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 20:50:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-21 20:50:13,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 20:50:13,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 20:50:13,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017879420] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:13,265 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:13,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2021-12-21 20:50:13,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728649619] [2021-12-21 20:50:13,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:13,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-21 20:50:13,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-21 20:50:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-12-21 20:50:13,269 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 20:50:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:13,486 INFO L93 Difference]: Finished difference Result 256 states and 318 transitions. [2021-12-21 20:50:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 20:50:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2021-12-21 20:50:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:13,488 INFO L225 Difference]: With dead ends: 256 [2021-12-21 20:50:13,488 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 20:50:13,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2021-12-21 20:50:13,489 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:13,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 648 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 20:50:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2021-12-21 20:50:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 79 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2021-12-21 20:50:13,496 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 30 [2021-12-21 20:50:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:13,496 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2021-12-21 20:50:13,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 20:50:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2021-12-21 20:50:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 20:50:13,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:13,497 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:13,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:13,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 20:50:13,715 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash -679764374, now seen corresponding path program 1 times [2021-12-21 20:50:13,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355502277] [2021-12-21 20:50:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:13,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 20:50:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 20:50:13,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:13,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355502277] [2021-12-21 20:50:13,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355502277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:13,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682535468] [2021-12-21 20:50:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:13,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:13,800 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) [2021-12-21 20:50:13,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 20:50:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:13,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 20:50:13,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 20:50:13,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 20:50:14,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682535468] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:14,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:14,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2021-12-21 20:50:14,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775905412] [2021-12-21 20:50:14,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:14,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 20:50:14,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:14,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 20:50:14,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:50:14,061 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 20:50:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:14,248 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2021-12-21 20:50:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 20:50:14,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 34 [2021-12-21 20:50:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:14,251 INFO L225 Difference]: With dead ends: 161 [2021-12-21 20:50:14,251 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 20:50:14,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-12-21 20:50:14,253 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 149 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:14,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 473 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 20:50:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2021-12-21 20:50:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 79 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2021-12-21 20:50:14,263 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 34 [2021-12-21 20:50:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:14,264 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2021-12-21 20:50:14,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 20:50:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2021-12-21 20:50:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 20:50:14,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:14,265 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:14,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:14,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:14,486 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1244863414, now seen corresponding path program 1 times [2021-12-21 20:50:14,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:14,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847083998] [2021-12-21 20:50:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:14,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 20:50:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 20:50:14,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847083998] [2021-12-21 20:50:14,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847083998] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:14,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:14,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:50:14,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641997844] [2021-12-21 20:50:14,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:14,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:50:14,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:50:14,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:50:14,557 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:14,593 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2021-12-21 20:50:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 20:50:14,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-12-21 20:50:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:14,594 INFO L225 Difference]: With dead ends: 137 [2021-12-21 20:50:14,594 INFO L226 Difference]: Without dead ends: 90 [2021-12-21 20:50:14,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:50:14,595 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 7 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:14,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 426 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:50:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-21 20:50:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-21 20:50:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 79 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 20:50:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-12-21 20:50:14,600 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 38 [2021-12-21 20:50:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:14,600 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-12-21 20:50:14,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-12-21 20:50:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 20:50:14,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:14,600 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:14,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 20:50:14,601 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash -911747015, now seen corresponding path program 2 times [2021-12-21 20:50:14,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:14,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821638834] [2021-12-21 20:50:14,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:14,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 20:50:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 20:50:14,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:14,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821638834] [2021-12-21 20:50:14,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821638834] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:14,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:14,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 20:50:14,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695350220] [2021-12-21 20:50:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:14,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 20:50:14,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 20:50:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:50:14,706 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:14,810 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2021-12-21 20:50:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:50:14,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2021-12-21 20:50:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:14,811 INFO L225 Difference]: With dead ends: 159 [2021-12-21 20:50:14,811 INFO L226 Difference]: Without dead ends: 157 [2021-12-21 20:50:14,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-21 20:50:14,812 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 99 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:14,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 675 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-21 20:50:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2021-12-21 20:50:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 98 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2021-12-21 20:50:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2021-12-21 20:50:14,819 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 42 [2021-12-21 20:50:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:14,819 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2021-12-21 20:50:14,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2021-12-21 20:50:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 20:50:14,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:14,820 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:14,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 20:50:14,820 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:14,820 INFO L85 PathProgramCache]: Analyzing trace with hash -911687433, now seen corresponding path program 1 times [2021-12-21 20:50:14,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:14,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521071875] [2021-12-21 20:50:14,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:14,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 20:50:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 20:50:14,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:14,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521071875] [2021-12-21 20:50:14,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521071875] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:50:14,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352689831] [2021-12-21 20:50:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:14,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:50:14,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:50:14,909 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) [2021-12-21 20:50:14,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 20:50:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:14,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 20:50:14,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 20:50:15,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:50:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 20:50:15,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352689831] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:50:15,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:50:15,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2021-12-21 20:50:15,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202757927] [2021-12-21 20:50:15,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:50:15,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 20:50:15,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:15,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 20:50:15,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-21 20:50:15,255 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 20:50:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:15,582 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2021-12-21 20:50:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:50:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2021-12-21 20:50:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:15,583 INFO L225 Difference]: With dead ends: 198 [2021-12-21 20:50:15,583 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 20:50:15,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:50:15,584 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 75 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:15,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 846 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:50:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 20:50:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 136. [2021-12-21 20:50:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 121 states have internal predecessors, (142), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2021-12-21 20:50:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2021-12-21 20:50:15,592 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 42 [2021-12-21 20:50:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:15,592 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2021-12-21 20:50:15,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 20:50:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2021-12-21 20:50:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 20:50:15,593 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:15,593 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:15,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-21 20:50:15,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-21 20:50:15,807 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1541169633, now seen corresponding path program 1 times [2021-12-21 20:50:15,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:15,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677074868] [2021-12-21 20:50:15,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:15,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 20:50:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 20:50:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 20:50:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:50:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 20:50:16,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:50:16,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677074868] [2021-12-21 20:50:16,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677074868] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:16,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:50:16,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 20:50:16,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975463739] [2021-12-21 20:50:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:16,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 20:50:16,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:16,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 20:50:16,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:50:16,035 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:16,241 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2021-12-21 20:50:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 20:50:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2021-12-21 20:50:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:16,242 INFO L225 Difference]: With dead ends: 183 [2021-12-21 20:50:16,242 INFO L226 Difference]: Without dead ends: 182 [2021-12-21 20:50:16,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-21 20:50:16,243 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 119 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:16,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 662 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:50:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-21 20:50:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 133. [2021-12-21 20:50:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.2321428571428572) internal successors, (138), 118 states have internal predecessors, (138), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2021-12-21 20:50:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2021-12-21 20:50:16,253 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 44 [2021-12-21 20:50:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:16,253 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2021-12-21 20:50:16,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 20:50:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2021-12-21 20:50:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 20:50:16,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:16,254 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:16,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 20:50:16,254 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-12-21 20:50:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1634349713, now seen corresponding path program 1 times [2021-12-21 20:50:16,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:16,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683435770] [2021-12-21 20:50:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:16,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:50:16,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 20:50:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:50:16,333 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 20:50:16,333 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 20:50:16,334 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2021-12-21 20:50:16,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2021-12-21 20:50:16,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2021-12-21 20:50:16,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2021-12-21 20:50:16,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2021-12-21 20:50:16,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2021-12-21 20:50:16,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2021-12-21 20:50:16,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2021-12-21 20:50:16,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2021-12-21 20:50:16,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2021-12-21 20:50:16,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2021-12-21 20:50:16,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2021-12-21 20:50:16,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2021-12-21 20:50:16,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2021-12-21 20:50:16,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2021-12-21 20:50:16,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2021-12-21 20:50:16,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 20:50:16,340 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:16,342 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 20:50:16,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:50:16 BoogieIcfgContainer [2021-12-21 20:50:16,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 20:50:16,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 20:50:16,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 20:50:16,392 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 20:50:16,392 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:50:11" (3/4) ... [2021-12-21 20:50:16,394 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 20:50:16,394 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 20:50:16,395 INFO L158 Benchmark]: Toolchain (without parser) took 6214.23ms. Allocated memory was 79.7MB in the beginning and 209.7MB in the end (delta: 130.0MB). Free memory was 38.9MB in the beginning and 171.9MB in the end (delta: -133.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:50:16,395 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:50:16,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.99ms. Allocated memory was 79.7MB in the beginning and 113.2MB in the end (delta: 33.6MB). Free memory was 38.7MB in the beginning and 83.5MB in the end (delta: -44.9MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.83ms. Allocated memory is still 113.2MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,396 INFO L158 Benchmark]: Boogie Preprocessor took 35.05ms. Allocated memory is still 113.2MB. Free memory was 81.4MB in the beginning and 79.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,396 INFO L158 Benchmark]: RCFGBuilder took 428.65ms. Allocated memory is still 113.2MB. Free memory was 79.9MB in the beginning and 77.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,396 INFO L158 Benchmark]: TraceAbstraction took 5373.59ms. Allocated memory was 113.2MB in the beginning and 209.7MB in the end (delta: 96.5MB). Free memory was 77.0MB in the beginning and 172.9MB in the end (delta: -95.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2021-12-21 20:50:16,396 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 209.7MB. Free memory was 172.9MB in the beginning and 171.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:50:16,401 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.15ms. Allocated memory is still 79.7MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.99ms. Allocated memory was 79.7MB in the beginning and 113.2MB in the end (delta: 33.6MB). Free memory was 38.7MB in the beginning and 83.5MB in the end (delta: -44.9MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.83ms. Allocated memory is still 113.2MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.05ms. Allocated memory is still 113.2MB. Free memory was 81.4MB in the beginning and 79.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 428.65ms. Allocated memory is still 113.2MB. Free memory was 79.9MB in the beginning and 77.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5373.59ms. Allocated memory was 113.2MB in the beginning and 209.7MB in the end (delta: 96.5MB). Free memory was 77.0MB in the beginning and 172.9MB in the end (delta: -95.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 209.7MB. Free memory was 172.9MB in the beginning and 171.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 110, overapproximation of bitwiseAnd at line 111. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=127, eb=0] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) 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] [L77] EXPR e + 128 [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=1, e=0, res=1] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-36028797018963967, __retres4=1, e=0, res=1] [L253] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=-36028797018963967, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=4294967295, b=1, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1] [L109] EXPR (int )(a >> 24U) - 128 [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127] [L112] (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=1, a=4294967295, b=1, ea=127] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 102 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1132 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1104 mSDsluCounter, 6197 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4829 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1227 IncrementalHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 1368 mSDtfsCounter, 1227 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 272 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=16, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 373 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 1955 SizeOfPredicates, 14 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 184/232 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 [2021-12-21 20:50:16,419 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 No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample