./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94419cb5ed7b14b2ed497048686126b88cc40ca2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/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 --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:50,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:50,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:50,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:50,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:50,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:50,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:50,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:50,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:50,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:50,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:50,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:50,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:50,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:50,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:50,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:50,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:50,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:50,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:50,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:50,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:50,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:50,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:50,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:50,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:50,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:50,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:50,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:50,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:50,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:50,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:50,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:50,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:50,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:50,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:50,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:50,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:50,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:50,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:50,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:50,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:50,460 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-10-22 11:22:50,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:50,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:50,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:50,473 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:50,474 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:50,474 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:50,474 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:50,474 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:50,474 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:50,475 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:50,475 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:50,475 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:50,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:50,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:50,476 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:22:50,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:50,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:50,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:50,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:50,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:50,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:50,478 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 11:22:50,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:50,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:50,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:50,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:50,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:50,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:50,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:50,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:50,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:50,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:50,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:50,480 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:50,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:50,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:50,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:50,481 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan 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 -> Taipan 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 -> 94419cb5ed7b14b2ed497048686126b88cc40ca2 [2019-10-22 11:22:50,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:50,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:50,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:50,520 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:50,521 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:50,521 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2019-10-22 11:22:50,573 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/data/7160c27b6/2137ac4e65504959818fd2a6ca7bd3b1/FLAGd0a9cf72d [2019-10-22 11:22:50,942 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:50,943 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2019-10-22 11:22:50,948 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/data/7160c27b6/2137ac4e65504959818fd2a6ca7bd3b1/FLAGd0a9cf72d [2019-10-22 11:22:50,958 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/data/7160c27b6/2137ac4e65504959818fd2a6ca7bd3b1 [2019-10-22 11:22:50,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:50,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:50,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:50,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:50,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:50,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:50" (1/1) ... [2019-10-22 11:22:50,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51050e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:50, skipping insertion in model container [2019-10-22 11:22:50,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:50" (1/1) ... [2019-10-22 11:22:50,977 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:50,998 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:51,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:51,222 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:51,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:51,270 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:51,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51 WrapperNode [2019-10-22 11:22:51,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:51,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:51,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:51,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:51,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:51,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:51,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:51,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:51,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:51,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:51,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:51,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:51,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd240d7b-067c-4748-90da-99c9e2942edb/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:51,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:51,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:51,948 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:51,949 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-22 11:22:51,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:51 BoogieIcfgContainer [2019-10-22 11:22:51,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:51,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:51,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:51,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:51,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:50" (1/3) ... [2019-10-22 11:22:51,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abb17a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:51, skipping insertion in model container [2019-10-22 11:22:51,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (2/3) ... [2019-10-22 11:22:51,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abb17a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:51, skipping insertion in model container [2019-10-22 11:22:51,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:51" (3/3) ... [2019-10-22 11:22:51,957 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2019-10-22 11:22:51,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:51,971 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-10-22 11:22:51,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-10-22 11:22:51,998 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:51,998 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:51,998 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:51,998 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:52,000 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:52,000 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:52,000 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:52,001 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-10-22 11:22:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:52,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,034 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,037 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:52,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,044 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-10-22 11:22:52,052 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801980338] [2019-10-22 11:22:52,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801980338] [2019-10-22 11:22:52,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:52,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72417996] [2019-10-22 11:22:52,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:52,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:52,182 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 2 states. [2019-10-22 11:22:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,214 INFO L93 Difference]: Finished difference Result 271 states and 357 transitions. [2019-10-22 11:22:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:52,215 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:22:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,226 INFO L225 Difference]: With dead ends: 271 [2019-10-22 11:22:52,226 INFO L226 Difference]: Without dead ends: 126 [2019-10-22 11:22:52,229 INFO L600 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 [2019-10-22 11:22:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-22 11:22:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-10-22 11:22:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-22 11:22:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2019-10-22 11:22:52,270 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 6 [2019-10-22 11:22:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,271 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2019-10-22 11:22:52,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2019-10-22 11:22:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:52,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,271 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,272 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-10-22 11:22:52,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566211887] [2019-10-22 11:22:52,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566211887] [2019-10-22 11:22:52,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:52,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555097321] [2019-10-22 11:22:52,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,329 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 4 states. [2019-10-22 11:22:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,515 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2019-10-22 11:22:52,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:52,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:22:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,520 INFO L225 Difference]: With dead ends: 290 [2019-10-22 11:22:52,520 INFO L226 Difference]: Without dead ends: 166 [2019-10-22 11:22:52,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-22 11:22:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 106. [2019-10-22 11:22:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-22 11:22:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-10-22 11:22:52,529 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 6 [2019-10-22 11:22:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,529 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-10-22 11:22:52,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-10-22 11:22:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:22:52,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,530 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,531 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-10-22 11:22:52,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695225847] [2019-10-22 11:22:52,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695225847] [2019-10-22 11:22:52,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:52,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432535434] [2019-10-22 11:22:52,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,589 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 4 states. [2019-10-22 11:22:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,663 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2019-10-22 11:22:52,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:52,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:22:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,665 INFO L225 Difference]: With dead ends: 173 [2019-10-22 11:22:52,665 INFO L226 Difference]: Without dead ends: 169 [2019-10-22 11:22:52,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-22 11:22:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 107. [2019-10-22 11:22:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 11:22:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-10-22 11:22:52,676 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 9 [2019-10-22 11:22:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,677 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-10-22 11:22:52,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2019-10-22 11:22:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:22:52,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,678 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:52,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,679 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-10-22 11:22:52,679 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836200734] [2019-10-22 11:22:52,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836200734] [2019-10-22 11:22:52,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:52,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474766733] [2019-10-22 11:22:52,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:52,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:52,702 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand 3 states. [2019-10-22 11:22:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,746 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2019-10-22 11:22:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:52,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 11:22:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,747 INFO L225 Difference]: With dead ends: 167 [2019-10-22 11:22:52,747 INFO L226 Difference]: Without dead ends: 165 [2019-10-22 11:22:52,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-22 11:22:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 105. [2019-10-22 11:22:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-22 11:22:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-10-22 11:22:52,757 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 10 [2019-10-22 11:22:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,757 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-10-22 11:22:52,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-10-22 11:22:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:22:52,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,759 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-10-22 11:22:52,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359555279] [2019-10-22 11:22:52,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359555279] [2019-10-22 11:22:52,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:52,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536660069] [2019-10-22 11:22:52,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,788 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 4 states. [2019-10-22 11:22:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,846 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2019-10-22 11:22:52,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:52,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:22:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,847 INFO L225 Difference]: With dead ends: 171 [2019-10-22 11:22:52,847 INFO L226 Difference]: Without dead ends: 169 [2019-10-22 11:22:52,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-22 11:22:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 107. [2019-10-22 11:22:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 11:22:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2019-10-22 11:22:52,857 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 11 [2019-10-22 11:22:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,857 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2019-10-22 11:22:52,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2019-10-22 11:22:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:52,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,859 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:52,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,859 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-10-22 11:22:52,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903624335] [2019-10-22 11:22:52,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903624335] [2019-10-22 11:22:52,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:52,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106659250] [2019-10-22 11:22:52,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,892 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand 4 states. [2019-10-22 11:22:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,948 INFO L93 Difference]: Finished difference Result 174 states and 202 transitions. [2019-10-22 11:22:52,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:52,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:22:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,949 INFO L225 Difference]: With dead ends: 174 [2019-10-22 11:22:52,949 INFO L226 Difference]: Without dead ends: 172 [2019-10-22 11:22:52,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-22 11:22:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 110. [2019-10-22 11:22:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:22:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2019-10-22 11:22:52,958 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 12 [2019-10-22 11:22:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,958 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2019-10-22 11:22:52,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2019-10-22 11:22:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:22:52,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,959 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-10-22 11:22:52,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904616418] [2019-10-22 11:22:52,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904616418] [2019-10-22 11:22:52,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:52,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063169153] [2019-10-22 11:22:52,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,990 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand 4 states. [2019-10-22 11:22:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:53,057 INFO L93 Difference]: Finished difference Result 238 states and 272 transitions. [2019-10-22 11:22:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:53,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-22 11:22:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:53,059 INFO L225 Difference]: With dead ends: 238 [2019-10-22 11:22:53,059 INFO L226 Difference]: Without dead ends: 236 [2019-10-22 11:22:53,059 INFO L600 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 [2019-10-22 11:22:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-22 11:22:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 109. [2019-10-22 11:22:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-22 11:22:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2019-10-22 11:22:53,068 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 14 [2019-10-22 11:22:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:53,069 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2019-10-22 11:22:53,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2019-10-22 11:22:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:22:53,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:53,070 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,071 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1259484934, now seen corresponding path program 1 times [2019-10-22 11:22:53,071 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:53,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323058593] [2019-10-22 11:22:53,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323058593] [2019-10-22 11:22:53,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:22:53,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732475074] [2019-10-22 11:22:53,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:53,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:53,179 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand 8 states. [2019-10-22 11:22:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:53,514 INFO L93 Difference]: Finished difference Result 267 states and 313 transitions. [2019-10-22 11:22:53,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:22:53,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-10-22 11:22:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:53,516 INFO L225 Difference]: With dead ends: 267 [2019-10-22 11:22:53,516 INFO L226 Difference]: Without dead ends: 197 [2019-10-22 11:22:53,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:22:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-22 11:22:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 158. [2019-10-22 11:22:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-22 11:22:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2019-10-22 11:22:53,530 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 14 [2019-10-22 11:22:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:53,530 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2019-10-22 11:22:53,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2019-10-22 11:22:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:22:53,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:53,531 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,532 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-10-22 11:22:53,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:53,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144430379] [2019-10-22 11:22:53,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144430379] [2019-10-22 11:22:53,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:53,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45223938] [2019-10-22 11:22:53,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:53,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:53,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:53,576 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand 4 states. [2019-10-22 11:22:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:53,650 INFO L93 Difference]: Finished difference Result 247 states and 296 transitions. [2019-10-22 11:22:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:53,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-22 11:22:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:53,652 INFO L225 Difference]: With dead ends: 247 [2019-10-22 11:22:53,652 INFO L226 Difference]: Without dead ends: 245 [2019-10-22 11:22:53,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-22 11:22:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 150. [2019-10-22 11:22:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-22 11:22:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2019-10-22 11:22:53,685 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 183 transitions. Word has length 14 [2019-10-22 11:22:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:53,685 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 183 transitions. [2019-10-22 11:22:53,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2019-10-22 11:22:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:22:53,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:53,686 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,687 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-10-22 11:22:53,687 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:53,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282637742] [2019-10-22 11:22:53,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282637742] [2019-10-22 11:22:53,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:53,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676117948] [2019-10-22 11:22:53,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:53,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:53,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:53,740 INFO L87 Difference]: Start difference. First operand 150 states and 183 transitions. Second operand 4 states. [2019-10-22 11:22:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:53,809 INFO L93 Difference]: Finished difference Result 272 states and 322 transitions. [2019-10-22 11:22:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:53,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 11:22:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:53,811 INFO L225 Difference]: With dead ends: 272 [2019-10-22 11:22:53,811 INFO L226 Difference]: Without dead ends: 270 [2019-10-22 11:22:53,811 INFO L600 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 [2019-10-22 11:22:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-22 11:22:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 136. [2019-10-22 11:22:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-22 11:22:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2019-10-22 11:22:53,822 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 15 [2019-10-22 11:22:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:53,822 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2019-10-22 11:22:53,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2019-10-22 11:22:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:22:53,823 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:53,823 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,830 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1435914485, now seen corresponding path program 1 times [2019-10-22 11:22:53,830 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:53,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605820531] [2019-10-22 11:22:53,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605820531] [2019-10-22 11:22:53,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:53,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799890020] [2019-10-22 11:22:53,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:53,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:53,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:53,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:53,970 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand 6 states. [2019-10-22 11:22:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:54,132 INFO L93 Difference]: Finished difference Result 245 states and 291 transitions. [2019-10-22 11:22:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:54,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-22 11:22:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:54,133 INFO L225 Difference]: With dead ends: 245 [2019-10-22 11:22:54,134 INFO L226 Difference]: Without dead ends: 244 [2019-10-22 11:22:54,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-22 11:22:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 152. [2019-10-22 11:22:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 11:22:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2019-10-22 11:22:54,145 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 20 [2019-10-22 11:22:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:54,146 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2019-10-22 11:22:54,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2019-10-22 11:22:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:22:54,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:54,147 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:54,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1468941615, now seen corresponding path program 1 times [2019-10-22 11:22:54,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:54,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271933826] [2019-10-22 11:22:54,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:54,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271933826] [2019-10-22 11:22:54,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:54,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:22:54,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234459166] [2019-10-22 11:22:54,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:22:54,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:54,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:22:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:54,293 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand 9 states. [2019-10-22 11:22:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:54,703 INFO L93 Difference]: Finished difference Result 478 states and 553 transitions. [2019-10-22 11:22:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:22:54,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:22:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:54,705 INFO L225 Difference]: With dead ends: 478 [2019-10-22 11:22:54,706 INFO L226 Difference]: Without dead ends: 423 [2019-10-22 11:22:54,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:22:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-10-22 11:22:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 216. [2019-10-22 11:22:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-22 11:22:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 267 transitions. [2019-10-22 11:22:54,724 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 267 transitions. Word has length 22 [2019-10-22 11:22:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:54,725 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 267 transitions. [2019-10-22 11:22:54,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:22:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 267 transitions. [2019-10-22 11:22:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:22:54,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:54,726 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:54,727 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1469001197, now seen corresponding path program 1 times [2019-10-22 11:22:54,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:54,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816293376] [2019-10-22 11:22:54,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:54,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816293376] [2019-10-22 11:22:54,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:54,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:54,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038667980] [2019-10-22 11:22:54,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:54,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:54,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:54,864 INFO L87 Difference]: Start difference. First operand 216 states and 267 transitions. Second operand 8 states. [2019-10-22 11:22:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:55,088 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2019-10-22 11:22:55,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:22:55,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-10-22 11:22:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:55,090 INFO L225 Difference]: With dead ends: 286 [2019-10-22 11:22:55,090 INFO L226 Difference]: Without dead ends: 285 [2019-10-22 11:22:55,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:22:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-22 11:22:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 225. [2019-10-22 11:22:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-22 11:22:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 278 transitions. [2019-10-22 11:22:55,108 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 278 transitions. Word has length 22 [2019-10-22 11:22:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:55,108 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 278 transitions. [2019-10-22 11:22:55,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 278 transitions. [2019-10-22 11:22:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:22:55,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:55,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:55,109 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1229309041, now seen corresponding path program 1 times [2019-10-22 11:22:55,113 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:55,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940838521] [2019-10-22 11:22:55,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:55,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940838521] [2019-10-22 11:22:55,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:55,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:55,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207500828] [2019-10-22 11:22:55,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:55,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:55,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:55,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:55,282 INFO L87 Difference]: Start difference. First operand 225 states and 278 transitions. Second operand 8 states. [2019-10-22 11:22:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:55,768 INFO L93 Difference]: Finished difference Result 400 states and 480 transitions. [2019-10-22 11:22:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:55,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-10-22 11:22:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:55,770 INFO L225 Difference]: With dead ends: 400 [2019-10-22 11:22:55,770 INFO L226 Difference]: Without dead ends: 397 [2019-10-22 11:22:55,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-22 11:22:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 258. [2019-10-22 11:22:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-22 11:22:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 321 transitions. [2019-10-22 11:22:55,788 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 321 transitions. Word has length 22 [2019-10-22 11:22:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:55,788 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 321 transitions. [2019-10-22 11:22:55,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 321 transitions. [2019-10-22 11:22:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:22:55,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:55,789 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:55,790 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1239889621, now seen corresponding path program 1 times [2019-10-22 11:22:55,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:55,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114654562] [2019-10-22 11:22:55,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:55,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114654562] [2019-10-22 11:22:55,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:55,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:22:55,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907372783] [2019-10-22 11:22:55,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:55,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:55,911 INFO L87 Difference]: Start difference. First operand 258 states and 321 transitions. Second operand 8 states. [2019-10-22 11:22:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:56,092 INFO L93 Difference]: Finished difference Result 296 states and 352 transitions. [2019-10-22 11:22:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:56,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-10-22 11:22:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:56,093 INFO L225 Difference]: With dead ends: 296 [2019-10-22 11:22:56,094 INFO L226 Difference]: Without dead ends: 232 [2019-10-22 11:22:56,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-22 11:22:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 201. [2019-10-22 11:22:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-22 11:22:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions. [2019-10-22 11:22:56,109 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 249 transitions. Word has length 22 [2019-10-22 11:22:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:56,109 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 249 transitions. [2019-10-22 11:22:56,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions. [2019-10-22 11:22:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:22:56,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:56,111 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:56,111 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1089831035, now seen corresponding path program 1 times [2019-10-22 11:22:56,112 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:56,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985873260] [2019-10-22 11:22:56,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:56,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985873260] [2019-10-22 11:22:56,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:56,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:22:56,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799246507] [2019-10-22 11:22:56,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:56,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:56,196 INFO L87 Difference]: Start difference. First operand 201 states and 249 transitions. Second operand 8 states. [2019-10-22 11:22:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:56,409 INFO L93 Difference]: Finished difference Result 237 states and 285 transitions. [2019-10-22 11:22:56,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:22:56,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-10-22 11:22:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:56,410 INFO L225 Difference]: With dead ends: 237 [2019-10-22 11:22:56,411 INFO L226 Difference]: Without dead ends: 188 [2019-10-22 11:22:56,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:22:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-22 11:22:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2019-10-22 11:22:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-22 11:22:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 226 transitions. [2019-10-22 11:22:56,425 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 226 transitions. Word has length 24 [2019-10-22 11:22:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:56,425 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 226 transitions. [2019-10-22 11:22:56,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2019-10-22 11:22:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:22:56,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:56,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:56,426 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:56,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:56,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1968302766, now seen corresponding path program 1 times [2019-10-22 11:22:56,426 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:56,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741772435] [2019-10-22 11:22:56,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:56,736 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-10-22 11:22:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:56,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741772435] [2019-10-22 11:22:56,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:56,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:56,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007959763] [2019-10-22 11:22:56,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:56,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:56,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:56,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:56,822 INFO L87 Difference]: Start difference. First operand 184 states and 226 transitions. Second operand 8 states. [2019-10-22 11:22:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:57,136 INFO L93 Difference]: Finished difference Result 265 states and 314 transitions. [2019-10-22 11:22:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:57,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-10-22 11:22:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:57,138 INFO L225 Difference]: With dead ends: 265 [2019-10-22 11:22:57,138 INFO L226 Difference]: Without dead ends: 264 [2019-10-22 11:22:57,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:22:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-22 11:22:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 184. [2019-10-22 11:22:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-22 11:22:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2019-10-22 11:22:57,150 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 24 [2019-10-22 11:22:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:57,150 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2019-10-22 11:22:57,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2019-10-22 11:22:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:22:57,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:57,150 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:57,151 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:22:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1696098322, now seen corresponding path program 1 times [2019-10-22 11:22:57,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:57,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058085741] [2019-10-22 11:22:57,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:57,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:57,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:57,219 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:22:57,219 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:22:57,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:57 BoogieIcfgContainer [2019-10-22 11:22:57,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:57,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:57,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:57,247 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:57,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:51" (3/4) ... [2019-10-22 11:22:57,251 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:22:57,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:57,252 INFO L168 Benchmark]: Toolchain (without parser) took 6290.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 944.5 MB in the beginning and 932.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 203.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:57,253 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:57,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:57,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:57,257 INFO L168 Benchmark]: Boogie Preprocessor took 59.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:57,257 INFO L168 Benchmark]: RCFGBuilder took 557.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:57,257 INFO L168 Benchmark]: TraceAbstraction took 5296.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.6 MB). Free memory was 1.1 GB in the beginning and 932.3 MB in the end (delta: 158.3 MB). Peak memory consumption was 202.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:57,258 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.2 GB. Free memory is still 932.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:57,259 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 557.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5296.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.6 MB). Free memory was 1.1 GB in the beginning and 932.3 MB in the end (delta: 158.3 MB). Peak memory consumption was 202.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.2 GB. Free memory is still 932.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add1 ; [L224] unsigned int r_add2 ; [L225] unsigned int zero ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int __retres14 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L232] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] EXPR e + 128 [L68] res = m | ((unsigned int )(e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L233] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND TRUE m >= 1U << 25U [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U [L71] return (__retres4); [L234] b = base2flt(mb, eb) [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] EXPR (int )(a >> 24U) - 128 [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 38 error locations. Result: UNSAFE, OverallTime: 5.2s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2467 SDtfs, 3174 SDslu, 5632 SDs, 0 SdLazy, 1577 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=14, 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, 1314 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 22248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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 Received shutdown request...