./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/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 0e04f2515dd5c7ce697460622800d33932bf1903 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/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.25-f470102 [2019-12-07 21:23:42,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:23:42,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:23:42,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:23:42,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:23:42,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:23:42,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:23:42,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:23:42,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:23:42,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:23:42,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:23:42,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:23:42,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:23:42,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:23:42,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:23:42,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:23:42,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:23:42,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:23:42,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:23:42,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:23:42,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:23:42,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:23:42,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:23:42,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:23:42,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:23:42,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:23:42,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:23:42,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:23:42,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:23:42,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:23:42,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:23:42,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:23:42,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:23:42,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:23:42,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:23:42,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:23:42,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:23:42,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:23:42,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:23:42,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:23:42,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:23:42,085 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-12-07 21:23:42,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:23:42,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:23:42,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:23:42,096 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:23:42,096 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:23:42,096 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:23:42,096 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:23:42,096 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:23:42,096 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:23:42,096 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:23:42,096 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:23:42,096 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:23:42,097 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:23:42,097 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:23:42,097 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:23:42,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:23:42,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:23:42,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 21:23:42,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:23:42,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:23:42,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:23:42,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:23:42,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:23:42,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:23:42,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:23:42,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:23:42,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:23:42,100 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:23:42,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:23:42,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:23:42,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:23:42,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:23:42,100 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/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/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 -> 0e04f2515dd5c7ce697460622800d33932bf1903 [2019-12-07 21:23:42,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:23:42,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:23:42,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:23:42,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:23:42,214 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:23:42,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-12-07 21:23:42,255 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/data/956f6b33a/62731c45fa06437da2dfdeb0a14bd6c6/FLAG9f601f0b5 [2019-12-07 21:23:42,701 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:23:42,702 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-12-07 21:23:42,707 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/data/956f6b33a/62731c45fa06437da2dfdeb0a14bd6c6/FLAG9f601f0b5 [2019-12-07 21:23:42,715 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/bin/utaipan/data/956f6b33a/62731c45fa06437da2dfdeb0a14bd6c6 [2019-12-07 21:23:42,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:23:42,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:23:42,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:23:42,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:23:42,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:23:42,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:42,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39660cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42, skipping insertion in model container [2019-12-07 21:23:42,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:42,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:23:42,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:23:42,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:23:42,933 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:23:42,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:23:42,971 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:23:42,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42 WrapperNode [2019-12-07 21:23:42,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:23:42,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:23:42,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:23:42,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:23:42,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:42,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:43,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:23:43,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:23:43,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:23:43,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:23:43,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:43,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:43,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:43,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:43,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:43,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:43,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... [2019-12-07 21:23:43,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:23:43,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:23:43,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:23:43,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:23:43,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012baba9-2278-40b1-863d-28773ac1e63e/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-12-07 21:23:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:23:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:23:43,615 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:23:43,615 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-12-07 21:23:43,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:23:43 BoogieIcfgContainer [2019-12-07 21:23:43,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:23:43,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:23:43,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:23:43,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:23:43,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:23:42" (1/3) ... [2019-12-07 21:23:43,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503bf3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:23:43, skipping insertion in model container [2019-12-07 21:23:43,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:23:42" (2/3) ... [2019-12-07 21:23:43,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503bf3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:23:43, skipping insertion in model container [2019-12-07 21:23:43,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:23:43" (3/3) ... [2019-12-07 21:23:43,621 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2019-12-07 21:23:43,627 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:23:43,632 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-12-07 21:23:43,640 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-12-07 21:23:43,656 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:23:43,656 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:23:43,656 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:23:43,656 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:23:43,656 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:23:43,656 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:23:43,656 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:23:43,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:23:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-12-07 21:23:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:23:43,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:43,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:23:43,675 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash 923330977, now seen corresponding path program 1 times [2019-12-07 21:23:43,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:43,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536773979] [2019-12-07 21:23:43,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:43,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536773979] [2019-12-07 21:23:43,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:43,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:43,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507079042] [2019-12-07 21:23:43,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 21:23:43,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 21:23:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 21:23:43,774 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2019-12-07 21:23:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:43,792 INFO L93 Difference]: Finished difference Result 177 states and 229 transitions. [2019-12-07 21:23:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 21:23:43,793 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-12-07 21:23:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:43,800 INFO L225 Difference]: With dead ends: 177 [2019-12-07 21:23:43,800 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 21:23:43,803 INFO L630 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-12-07 21:23:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 21:23:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-07 21:23:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 21:23:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2019-12-07 21:23:43,830 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 6 [2019-12-07 21:23:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:43,830 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2019-12-07 21:23:43,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 21:23:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2019-12-07 21:23:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:23:43,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:43,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:23:43,831 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-12-07 21:23:43,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:43,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321635851] [2019-12-07 21:23:43,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:43,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321635851] [2019-12-07 21:23:43,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:43,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:43,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021208680] [2019-12-07 21:23:43,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:43,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:43,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:43,871 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand 4 states. [2019-12-07 21:23:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:43,969 INFO L93 Difference]: Finished difference Result 183 states and 213 transitions. [2019-12-07 21:23:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:43,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 21:23:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:43,971 INFO L225 Difference]: With dead ends: 183 [2019-12-07 21:23:43,971 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 21:23:43,972 INFO L630 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-12-07 21:23:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 21:23:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2019-12-07 21:23:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 21:23:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-12-07 21:23:43,977 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 6 [2019-12-07 21:23:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:43,977 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-12-07 21:23:43,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-12-07 21:23:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 21:23:43,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:43,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:43,978 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash -476318092, now seen corresponding path program 1 times [2019-12-07 21:23:43,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:43,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377080489] [2019-12-07 21:23:43,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377080489] [2019-12-07 21:23:44,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:44,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652314371] [2019-12-07 21:23:44,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:44,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:44,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:44,004 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 4 states. [2019-12-07 21:23:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,051 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2019-12-07 21:23:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:44,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 21:23:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,052 INFO L225 Difference]: With dead ends: 102 [2019-12-07 21:23:44,052 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 21:23:44,053 INFO L630 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-12-07 21:23:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 21:23:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2019-12-07 21:23:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 21:23:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-12-07 21:23:44,059 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 8 [2019-12-07 21:23:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,059 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-12-07 21:23:44,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-12-07 21:23:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:23:44,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,060 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1880958831, now seen corresponding path program 1 times [2019-12-07 21:23:44,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766053311] [2019-12-07 21:23:44,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766053311] [2019-12-07 21:23:44,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:44,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428589293] [2019-12-07 21:23:44,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:44,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:44,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:44,078 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 3 states. [2019-12-07 21:23:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,108 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-12-07 21:23:44,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:44,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:23:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,110 INFO L225 Difference]: With dead ends: 96 [2019-12-07 21:23:44,110 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 21:23:44,110 INFO L630 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-12-07 21:23:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 21:23:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2019-12-07 21:23:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 21:23:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-12-07 21:23:44,116 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 9 [2019-12-07 21:23:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,116 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-12-07 21:23:44,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-12-07 21:23:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:23:44,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,117 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1587633182, now seen corresponding path program 1 times [2019-12-07 21:23:44,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029933543] [2019-12-07 21:23:44,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029933543] [2019-12-07 21:23:44,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:44,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438916968] [2019-12-07 21:23:44,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:44,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:44,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:44,141 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 4 states. [2019-12-07 21:23:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,177 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-12-07 21:23:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:44,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 21:23:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,178 INFO L225 Difference]: With dead ends: 100 [2019-12-07 21:23:44,179 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 21:23:44,179 INFO L630 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-12-07 21:23:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 21:23:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2019-12-07 21:23:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 21:23:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-12-07 21:23:44,185 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 10 [2019-12-07 21:23:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,185 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-12-07 21:23:44,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-12-07 21:23:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:23:44,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,186 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,186 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2121037700, now seen corresponding path program 1 times [2019-12-07 21:23:44,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525464636] [2019-12-07 21:23:44,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525464636] [2019-12-07 21:23:44,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:23:44,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969706642] [2019-12-07 21:23:44,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:44,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:44,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:44,280 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 7 states. [2019-12-07 21:23:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,373 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2019-12-07 21:23:44,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:23:44,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 21:23:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,374 INFO L225 Difference]: With dead ends: 141 [2019-12-07 21:23:44,375 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 21:23:44,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:23:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 21:23:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2019-12-07 21:23:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 21:23:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-12-07 21:23:44,381 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-12-07 21:23:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,381 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-12-07 21:23:44,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-12-07 21:23:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:23:44,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,382 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2130010618, now seen corresponding path program 1 times [2019-12-07 21:23:44,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340895291] [2019-12-07 21:23:44,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340895291] [2019-12-07 21:23:44,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:44,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130197022] [2019-12-07 21:23:44,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:44,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:44,403 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 4 states. [2019-12-07 21:23:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,443 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2019-12-07 21:23:44,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:44,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 21:23:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,445 INFO L225 Difference]: With dead ends: 103 [2019-12-07 21:23:44,445 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 21:23:44,445 INFO L630 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-12-07 21:23:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 21:23:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2019-12-07 21:23:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 21:23:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-12-07 21:23:44,451 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 10 [2019-12-07 21:23:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,451 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-12-07 21:23:44,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-12-07 21:23:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 21:23:44,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,452 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1648316274, now seen corresponding path program 1 times [2019-12-07 21:23:44,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984467107] [2019-12-07 21:23:44,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984467107] [2019-12-07 21:23:44,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:44,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948314662] [2019-12-07 21:23:44,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:44,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:44,473 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 4 states. [2019-12-07 21:23:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,517 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-12-07 21:23:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:44,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 21:23:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,519 INFO L225 Difference]: With dead ends: 105 [2019-12-07 21:23:44,519 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 21:23:44,519 INFO L630 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-12-07 21:23:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 21:23:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2019-12-07 21:23:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 21:23:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-12-07 21:23:44,526 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 12 [2019-12-07 21:23:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,527 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-12-07 21:23:44,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-12-07 21:23:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:23:44,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,529 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1158446442, now seen corresponding path program 1 times [2019-12-07 21:23:44,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923281808] [2019-12-07 21:23:44,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923281808] [2019-12-07 21:23:44,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:44,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138278928] [2019-12-07 21:23:44,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:44,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:44,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:44,553 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 4 states. [2019-12-07 21:23:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,601 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2019-12-07 21:23:44,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:44,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 21:23:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,603 INFO L225 Difference]: With dead ends: 130 [2019-12-07 21:23:44,603 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 21:23:44,603 INFO L630 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-12-07 21:23:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 21:23:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2019-12-07 21:23:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 21:23:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-12-07 21:23:44,608 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 13 [2019-12-07 21:23:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,608 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-12-07 21:23:44,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-12-07 21:23:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:23:44,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,609 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,609 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1124214116, now seen corresponding path program 1 times [2019-12-07 21:23:44,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383807590] [2019-12-07 21:23:44,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383807590] [2019-12-07 21:23:44,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:44,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055052022] [2019-12-07 21:23:44,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:44,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:44,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:44,627 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 4 states. [2019-12-07 21:23:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,677 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-12-07 21:23:44,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:44,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 21:23:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,678 INFO L225 Difference]: With dead ends: 98 [2019-12-07 21:23:44,678 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 21:23:44,678 INFO L630 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-12-07 21:23:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 21:23:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2019-12-07 21:23:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 21:23:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-12-07 21:23:44,682 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 14 [2019-12-07 21:23:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,682 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-12-07 21:23:44,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-12-07 21:23:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:23:44,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,683 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash 818349229, now seen corresponding path program 1 times [2019-12-07 21:23:44,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814695532] [2019-12-07 21:23:44,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814695532] [2019-12-07 21:23:44,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:23:44,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132979550] [2019-12-07 21:23:44,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:44,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:44,774 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 7 states. [2019-12-07 21:23:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:44,834 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-12-07 21:23:44,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:23:44,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 21:23:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:44,835 INFO L225 Difference]: With dead ends: 122 [2019-12-07 21:23:44,835 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 21:23:44,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:23:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 21:23:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2019-12-07 21:23:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 21:23:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-12-07 21:23:44,839 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 14 [2019-12-07 21:23:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:44,839 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-12-07 21:23:44,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-12-07 21:23:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:23:44,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:44,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:44,841 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -71077193, now seen corresponding path program 1 times [2019-12-07 21:23:44,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:44,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919736228] [2019-12-07 21:23:44,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:44,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919736228] [2019-12-07 21:23:44,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:44,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:23:44,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314554549] [2019-12-07 21:23:44,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:23:44,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:44,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:23:44,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:23:44,979 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 8 states. [2019-12-07 21:23:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:45,101 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2019-12-07 21:23:45,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:23:45,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 21:23:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:45,103 INFO L225 Difference]: With dead ends: 98 [2019-12-07 21:23:45,103 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 21:23:45,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:23:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 21:23:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2019-12-07 21:23:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 21:23:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-12-07 21:23:45,110 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 16 [2019-12-07 21:23:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:45,110 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-12-07 21:23:45,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:23:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2019-12-07 21:23:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:23:45,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:45,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:45,112 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:45,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1972500898, now seen corresponding path program 1 times [2019-12-07 21:23:45,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:45,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053439208] [2019-12-07 21:23:45,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:45,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053439208] [2019-12-07 21:23:45,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:45,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:23:45,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639904121] [2019-12-07 21:23:45,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:45,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:45,208 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 7 states. [2019-12-07 21:23:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:45,275 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2019-12-07 21:23:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:23:45,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 21:23:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:45,277 INFO L225 Difference]: With dead ends: 165 [2019-12-07 21:23:45,277 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 21:23:45,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:23:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 21:23:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 86. [2019-12-07 21:23:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 21:23:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2019-12-07 21:23:45,284 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 18 [2019-12-07 21:23:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:45,285 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2019-12-07 21:23:45,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2019-12-07 21:23:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:23:45,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:45,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:45,286 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash 414303865, now seen corresponding path program 1 times [2019-12-07 21:23:45,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:45,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031076019] [2019-12-07 21:23:45,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:45,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031076019] [2019-12-07 21:23:45,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:45,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:23:45,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540278877] [2019-12-07 21:23:45,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:23:45,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:45,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:23:45,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:45,368 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand 6 states. [2019-12-07 21:23:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:45,433 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2019-12-07 21:23:45,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:23:45,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-12-07 21:23:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:45,435 INFO L225 Difference]: With dead ends: 117 [2019-12-07 21:23:45,435 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 21:23:45,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:23:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 21:23:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 21:23:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 21:23:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-12-07 21:23:45,441 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 18 [2019-12-07 21:23:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:45,441 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-12-07 21:23:45,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:23:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-12-07 21:23:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:23:45,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:45,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:45,442 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 627339272, now seen corresponding path program 1 times [2019-12-07 21:23:45,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:45,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404446356] [2019-12-07 21:23:45,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:45,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404446356] [2019-12-07 21:23:45,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:45,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:45,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626759356] [2019-12-07 21:23:45,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:45,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:45,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:45,582 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 7 states. [2019-12-07 21:23:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:45,682 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-12-07 21:23:45,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:23:45,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 21:23:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:45,684 INFO L225 Difference]: With dead ends: 106 [2019-12-07 21:23:45,684 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 21:23:45,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:23:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 21:23:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2019-12-07 21:23:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 21:23:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-12-07 21:23:45,688 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 20 [2019-12-07 21:23:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:45,688 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-12-07 21:23:45,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-12-07 21:23:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:23:45,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:45,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:45,689 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:45,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:45,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1492775840, now seen corresponding path program 1 times [2019-12-07 21:23:45,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:45,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873657552] [2019-12-07 21:23:45,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:45,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873657552] [2019-12-07 21:23:45,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:45,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:23:45,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853116532] [2019-12-07 21:23:45,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:45,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:45,772 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 7 states. [2019-12-07 21:23:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:45,829 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-12-07 21:23:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:23:45,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 21:23:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:45,830 INFO L225 Difference]: With dead ends: 143 [2019-12-07 21:23:45,830 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 21:23:45,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:23:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 21:23:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2019-12-07 21:23:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 21:23:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-12-07 21:23:45,836 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 20 [2019-12-07 21:23:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:45,836 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-12-07 21:23:45,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-12-07 21:23:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:23:45,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:45,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:45,837 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash 968595791, now seen corresponding path program 1 times [2019-12-07 21:23:45,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:45,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146434968] [2019-12-07 21:23:45,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:46,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146434968] [2019-12-07 21:23:46,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:46,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:23:46,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448137708] [2019-12-07 21:23:46,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:23:46,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:46,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:23:46,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:23:46,029 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 10 states. [2019-12-07 21:23:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:46,492 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2019-12-07 21:23:46,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 21:23:46,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 21:23:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:46,494 INFO L225 Difference]: With dead ends: 162 [2019-12-07 21:23:46,494 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 21:23:46,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:23:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 21:23:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 92. [2019-12-07 21:23:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 21:23:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2019-12-07 21:23:46,501 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 21 [2019-12-07 21:23:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:46,501 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2019-12-07 21:23:46,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:23:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2019-12-07 21:23:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:23:46,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:46,502 INFO L410 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-12-07 21:23:46,502 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:23:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1577628554, now seen corresponding path program 1 times [2019-12-07 21:23:46,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:46,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71966471] [2019-12-07 21:23:46,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:23:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:23:46,552 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:23:46,553 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:23:46,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:23:46 BoogieIcfgContainer [2019-12-07 21:23:46,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:23:46,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:23:46,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:23:46,577 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:23:46,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:23:43" (3/4) ... [2019-12-07 21:23:46,580 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 21:23:46,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:23:46,582 INFO L168 Benchmark]: Toolchain (without parser) took 3863.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.2 MB in the beginning and 1.0 GB in the end (delta: -86.7 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:46,582 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:23:46,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:46,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:23:46,583 INFO L168 Benchmark]: Boogie Preprocessor took 24.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:23:46,584 INFO L168 Benchmark]: RCFGBuilder took 585.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.8 MB in the end (delta: 89.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:46,584 INFO L168 Benchmark]: TraceAbstraction took 2960.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 998.8 MB in the beginning and 1.0 GB in the end (delta: -34.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:46,585 INFO L168 Benchmark]: Witness Printer took 3.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:23:46,587 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 585.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.8 MB in the end (delta: 89.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2960.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 998.8 MB in the beginning and 1.0 GB in the end (delta: -34.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 101. Possible FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add ; [L223] unsigned int zero ; [L224] int sa ; [L225] int sb ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int tmp___1 ; [L229] int tmp___2 ; [L230] int tmp___3 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L233] int tmp___6 ; [L234] int tmp___7 ; [L235] int tmp___8 ; [L236] int tmp___9 ; [L237] int __retres23 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L241] zero = base2flt(0, 0) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] EXPR e + 128 [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L242] a = base2flt(ma, ea) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND TRUE m >= 1U << 25U [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U [L70] return (__retres4); [L243] b = base2flt(mb, eb) [L245] COND FALSE !(a < zero) [L248] COND TRUE a > zero [L249] tmp = 1 [L253] sa = tmp [L255] COND FALSE !(b < zero) [L258] COND TRUE b > zero [L259] tmp___0 = 1 [L263] sb = tmp___0 [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; [L84] COND TRUE a < b [L85] tmp = a [L86] a = b [L87] b = tmp [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] EXPR (int )(a >> 24U) - 128 [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 98 locations, 28 error locations. Result: UNSAFE, OverallTime: 2.8s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1319 SDtfs, 1523 SDslu, 2810 SDs, 0 SdLazy, 900 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 581 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 19968 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...