./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/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_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/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_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 03:00:27,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 03:00:27,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 03:00:27,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 03:00:27,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 03:00:27,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 03:00:27,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 03:00:27,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 03:00:27,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 03:00:27,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 03:00:27,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 03:00:27,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 03:00:27,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 03:00:27,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 03:00:27,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 03:00:27,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 03:00:27,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 03:00:27,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 03:00:27,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 03:00:27,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 03:00:27,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 03:00:27,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 03:00:27,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 03:00:27,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 03:00:27,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 03:00:27,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 03:00:27,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 03:00:27,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 03:00:27,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 03:00:27,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 03:00:27,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 03:00:27,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 03:00:27,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 03:00:27,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 03:00:27,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 03:00:27,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 03:00:27,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 03:00:27,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 03:00:27,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 03:00:27,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 03:00:27,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 03:00:27,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-11-26 03:00:27,445 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 03:00:27,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 03:00:27,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 03:00:27,446 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 03:00:27,446 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 03:00:27,446 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 03:00:27,446 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 03:00:27,446 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 03:00:27,447 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 03:00:27,447 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 03:00:27,447 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 03:00:27,447 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 03:00:27,447 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 03:00:27,448 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 03:00:27,448 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 03:00:27,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 03:00:27,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 03:00:27,449 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 03:00:27,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 03:00:27,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 03:00:27,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 03:00:27,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 03:00:27,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 03:00:27,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 03:00:27,450 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-26 03:00:27,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 03:00:27,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 03:00:27,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 03:00:27,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 03:00:27,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 03:00:27,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 03:00:27,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:00:27,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 03:00:27,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 03:00:27,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 03:00:27,452 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 03:00:27,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 03:00:27,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 03:00:27,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 03:00:27,453 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_cffa3d69-f895-415c-80cf-b7f530d33194/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-11-26 03:00:27,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 03:00:27,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 03:00:27,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 03:00:27,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 03:00:27,613 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 03:00:27,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-26 03:00:27,664 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/data/6020514eb/1c2b3f4ef795457a9e6d96b510f4af7a/FLAG5e4bff65e [2019-11-26 03:00:28,125 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 03:00:28,126 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-26 03:00:28,136 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/data/6020514eb/1c2b3f4ef795457a9e6d96b510f4af7a/FLAG5e4bff65e [2019-11-26 03:00:28,633 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/bin/utaipan/data/6020514eb/1c2b3f4ef795457a9e6d96b510f4af7a [2019-11-26 03:00:28,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 03:00:28,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 03:00:28,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 03:00:28,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 03:00:28,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 03:00:28,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:00:28" (1/1) ... [2019-11-26 03:00:28,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a23bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:28, skipping insertion in model container [2019-11-26 03:00:28,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:00:28" (1/1) ... [2019-11-26 03:00:28,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 03:00:28,682 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 03:00:29,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:00:29,032 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 03:00:29,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:00:29,090 INFO L205 MainTranslator]: Completed translation [2019-11-26 03:00:29,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29 WrapperNode [2019-11-26 03:00:29,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 03:00:29,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 03:00:29,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 03:00:29,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 03:00:29,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 03:00:29,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 03:00:29,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 03:00:29,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 03:00:29,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... [2019-11-26 03:00:29,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 03:00:29,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 03:00:29,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 03:00:29,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 03:00:29,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cffa3d69-f895-415c-80cf-b7f530d33194/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-11-26 03:00:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 03:00:29,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 03:00:30,225 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 03:00:30,225 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-26 03:00:30,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:00:30 BoogieIcfgContainer [2019-11-26 03:00:30,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 03:00:30,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 03:00:30,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 03:00:30,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 03:00:30,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 03:00:28" (1/3) ... [2019-11-26 03:00:30,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520db7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:00:30, skipping insertion in model container [2019-11-26 03:00:30,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:29" (2/3) ... [2019-11-26 03:00:30,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520db7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:00:30, skipping insertion in model container [2019-11-26 03:00:30,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:00:30" (3/3) ... [2019-11-26 03:00:30,238 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2019-11-26 03:00:30,247 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 03:00:30,254 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-26 03:00:30,264 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-26 03:00:30,297 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 03:00:30,298 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 03:00:30,298 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 03:00:30,298 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 03:00:30,298 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 03:00:30,298 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 03:00:30,298 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 03:00:30,298 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 03:00:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-11-26 03:00:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 03:00:30,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:30,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 03:00:30,333 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-11-26 03:00:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash 923330977, now seen corresponding path program 1 times [2019-11-26 03:00:30,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:30,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263258936] [2019-11-26 03:00:30,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:30,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263258936] [2019-11-26 03:00:30,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:30,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:30,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459693916] [2019-11-26 03:00:30,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 03:00:30,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 03:00:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 03:00:30,495 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2019-11-26 03:00:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:30,525 INFO L93 Difference]: Finished difference Result 177 states and 229 transitions. [2019-11-26 03:00:30,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 03:00:30,526 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-26 03:00:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:30,536 INFO L225 Difference]: With dead ends: 177 [2019-11-26 03:00:30,536 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 03:00:30,539 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-11-26 03:00:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 03:00:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-26 03:00:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-26 03:00:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2019-11-26 03:00:30,580 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 6 [2019-11-26 03:00:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:30,580 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2019-11-26 03:00:30,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 03:00:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2019-11-26 03:00:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 03:00:30,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:30,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 03:00:30,581 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-11-26 03:00:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-11-26 03:00:30,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:30,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833555183] [2019-11-26 03:00:30,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:30,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833555183] [2019-11-26 03:00:30,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:30,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:30,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600263985] [2019-11-26 03:00:30,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:30,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:30,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:30,650 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand 4 states. [2019-11-26 03:00:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:30,804 INFO L93 Difference]: Finished difference Result 183 states and 213 transitions. [2019-11-26 03:00:30,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:30,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-26 03:00:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:30,806 INFO L225 Difference]: With dead ends: 183 [2019-11-26 03:00:30,806 INFO L226 Difference]: Without dead ends: 95 [2019-11-26 03:00:30,807 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-11-26 03:00:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-26 03:00:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2019-11-26 03:00:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 03:00:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-11-26 03:00:30,815 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 6 [2019-11-26 03:00:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:30,815 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-26 03:00:30,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-11-26 03:00:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 03:00:30,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:30,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:30,817 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-11-26 03:00:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash -476318092, now seen corresponding path program 1 times [2019-11-26 03:00:30,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:30,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872901220] [2019-11-26 03:00:30,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:30,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872901220] [2019-11-26 03:00:30,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:30,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:30,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984300025] [2019-11-26 03:00:30,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:30,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:30,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:30,862 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 4 states. [2019-11-26 03:00:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:30,951 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2019-11-26 03:00:30,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:30,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-26 03:00:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:30,953 INFO L225 Difference]: With dead ends: 102 [2019-11-26 03:00:30,953 INFO L226 Difference]: Without dead ends: 98 [2019-11-26 03:00:30,954 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-11-26 03:00:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-26 03:00:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2019-11-26 03:00:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 03:00:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-11-26 03:00:30,962 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 8 [2019-11-26 03:00:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:30,963 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-11-26 03:00:30,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-11-26 03:00:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 03:00:30,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:30,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:30,964 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-11-26 03:00:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1880958831, now seen corresponding path program 1 times [2019-11-26 03:00:30,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:30,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859079439] [2019-11-26 03:00:30,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:30,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859079439] [2019-11-26 03:00:30,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:30,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:30,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674670156] [2019-11-26 03:00:30,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:00:30,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:30,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:00:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:00:30,993 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 3 states. [2019-11-26 03:00:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:31,048 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-11-26 03:00:31,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:00:31,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 03:00:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:31,050 INFO L225 Difference]: With dead ends: 96 [2019-11-26 03:00:31,050 INFO L226 Difference]: Without dead ends: 94 [2019-11-26 03:00:31,051 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-11-26 03:00:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-26 03:00:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2019-11-26 03:00:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-26 03:00:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-11-26 03:00:31,058 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 9 [2019-11-26 03:00:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:31,058 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-26 03:00:31,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:00:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-11-26 03:00:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:00:31,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:31,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:31,059 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-11-26 03:00:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1587633182, now seen corresponding path program 1 times [2019-11-26 03:00:31,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:31,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843536980] [2019-11-26 03:00:31,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:31,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843536980] [2019-11-26 03:00:31,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:31,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:31,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955487367] [2019-11-26 03:00:31,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:31,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:31,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:31,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:31,115 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 4 states. [2019-11-26 03:00:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:31,194 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-11-26 03:00:31,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:31,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 03:00:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:31,196 INFO L225 Difference]: With dead ends: 100 [2019-11-26 03:00:31,196 INFO L226 Difference]: Without dead ends: 98 [2019-11-26 03:00:31,196 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-11-26 03:00:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-26 03:00:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2019-11-26 03:00:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 03:00:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-11-26 03:00:31,209 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 10 [2019-11-26 03:00:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:31,209 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-11-26 03:00:31,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-11-26 03:00:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:00:31,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:31,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:31,211 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-11-26 03:00:31,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2121037700, now seen corresponding path program 1 times [2019-11-26 03:00:31,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:31,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151484684] [2019-11-26 03:00:31,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:31,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151484684] [2019-11-26 03:00:31,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:31,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 03:00:31,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546864912] [2019-11-26 03:00:31,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 03:00:31,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:31,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 03:00:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:00:31,390 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 7 states. [2019-11-26 03:00:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:31,546 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2019-11-26 03:00:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 03:00:31,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-26 03:00:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:31,549 INFO L225 Difference]: With dead ends: 141 [2019-11-26 03:00:31,549 INFO L226 Difference]: Without dead ends: 115 [2019-11-26 03:00:31,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-26 03:00:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-26 03:00:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2019-11-26 03:00:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 03:00:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-26 03:00:31,564 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-26 03:00:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:31,564 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-26 03:00:31,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 03:00:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-26 03:00:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:00:31,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:31,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:31,571 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-11-26 03:00:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2130010618, now seen corresponding path program 1 times [2019-11-26 03:00:31,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:31,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124267609] [2019-11-26 03:00:31,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:31,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124267609] [2019-11-26 03:00:31,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:31,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:31,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849994219] [2019-11-26 03:00:31,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:31,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:31,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:31,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:31,634 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 4 states. [2019-11-26 03:00:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:31,707 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2019-11-26 03:00:31,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:31,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 03:00:31,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:31,708 INFO L225 Difference]: With dead ends: 103 [2019-11-26 03:00:31,709 INFO L226 Difference]: Without dead ends: 101 [2019-11-26 03:00:31,709 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-11-26 03:00:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-26 03:00:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2019-11-26 03:00:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 03:00:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-26 03:00:31,717 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 10 [2019-11-26 03:00:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:31,717 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-26 03:00:31,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-11-26 03:00:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 03:00:31,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:31,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:31,719 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-11-26 03:00:31,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1648316274, now seen corresponding path program 1 times [2019-11-26 03:00:31,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:31,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164383158] [2019-11-26 03:00:31,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:31,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164383158] [2019-11-26 03:00:31,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:31,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:31,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393703607] [2019-11-26 03:00:31,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:31,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:31,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:31,756 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 4 states. [2019-11-26 03:00:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:31,827 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-11-26 03:00:31,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:31,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-26 03:00:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:31,830 INFO L225 Difference]: With dead ends: 105 [2019-11-26 03:00:31,831 INFO L226 Difference]: Without dead ends: 103 [2019-11-26 03:00:31,831 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-11-26 03:00:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-26 03:00:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2019-11-26 03:00:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 03:00:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-11-26 03:00:31,844 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 12 [2019-11-26 03:00:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:31,845 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-11-26 03:00:31,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-11-26 03:00:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 03:00:31,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:31,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:31,851 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-11-26 03:00:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1158446442, now seen corresponding path program 1 times [2019-11-26 03:00:31,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:31,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114801275] [2019-11-26 03:00:31,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:31,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114801275] [2019-11-26 03:00:31,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:31,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:00:31,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379328649] [2019-11-26 03:00:31,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:31,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:31,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:31,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:31,901 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 4 states. [2019-11-26 03:00:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:31,974 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2019-11-26 03:00:31,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:31,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-26 03:00:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:31,976 INFO L225 Difference]: With dead ends: 130 [2019-11-26 03:00:31,976 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 03:00:31,977 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-11-26 03:00:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 03:00:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2019-11-26 03:00:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-26 03:00:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-26 03:00:31,983 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 13 [2019-11-26 03:00:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:31,984 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-26 03:00:31,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-26 03:00:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 03:00:31,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:31,985 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:31,985 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-11-26 03:00:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1124214116, now seen corresponding path program 1 times [2019-11-26 03:00:31,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:31,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977136085] [2019-11-26 03:00:31,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:32,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977136085] [2019-11-26 03:00:32,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:32,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:00:32,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382960480] [2019-11-26 03:00:32,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:32,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:32,031 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 4 states. [2019-11-26 03:00:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:32,091 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-11-26 03:00:32,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:32,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-26 03:00:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:32,093 INFO L225 Difference]: With dead ends: 98 [2019-11-26 03:00:32,093 INFO L226 Difference]: Without dead ends: 96 [2019-11-26 03:00:32,093 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-11-26 03:00:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-26 03:00:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2019-11-26 03:00:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-26 03:00:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-11-26 03:00:32,098 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 14 [2019-11-26 03:00:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:32,098 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-11-26 03:00:32,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-11-26 03:00:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 03:00:32,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:32,099 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:32,100 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-11-26 03:00:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:32,100 INFO L82 PathProgramCache]: Analyzing trace with hash 818349229, now seen corresponding path program 1 times [2019-11-26 03:00:32,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:32,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775804493] [2019-11-26 03:00:32,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:32,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775804493] [2019-11-26 03:00:32,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:32,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 03:00:32,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381270894] [2019-11-26 03:00:32,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 03:00:32,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 03:00:32,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:00:32,279 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 7 states. [2019-11-26 03:00:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:32,390 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-11-26 03:00:32,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 03:00:32,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-26 03:00:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:32,391 INFO L225 Difference]: With dead ends: 122 [2019-11-26 03:00:32,391 INFO L226 Difference]: Without dead ends: 98 [2019-11-26 03:00:32,392 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-11-26 03:00:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-26 03:00:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2019-11-26 03:00:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-26 03:00:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-11-26 03:00:32,397 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 14 [2019-11-26 03:00:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:32,397 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-11-26 03:00:32,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 03:00:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-11-26 03:00:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 03:00:32,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:32,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:32,399 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-11-26 03:00:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash -71077193, now seen corresponding path program 1 times [2019-11-26 03:00:32,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:32,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677480340] [2019-11-26 03:00:32,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:32,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677480340] [2019-11-26 03:00:32,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:32,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 03:00:32,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559949393] [2019-11-26 03:00:32,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 03:00:32,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:32,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 03:00:32,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-26 03:00:32,632 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 8 states. [2019-11-26 03:00:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:32,821 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2019-11-26 03:00:32,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 03:00:32,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-26 03:00:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:32,822 INFO L225 Difference]: With dead ends: 98 [2019-11-26 03:00:32,822 INFO L226 Difference]: Without dead ends: 97 [2019-11-26 03:00:32,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-26 03:00:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-26 03:00:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2019-11-26 03:00:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 03:00:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-11-26 03:00:32,830 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 16 [2019-11-26 03:00:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:32,830 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-11-26 03:00:32,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 03:00:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2019-11-26 03:00:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 03:00:32,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:32,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:32,832 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-11-26 03:00:32,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:32,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1972500898, now seen corresponding path program 1 times [2019-11-26 03:00:32,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:32,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773841768] [2019-11-26 03:00:32,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:32,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-11-26 03:00:32,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773841768] [2019-11-26 03:00:32,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:32,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 03:00:32,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752327503] [2019-11-26 03:00:32,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 03:00:32,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 03:00:32,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:00:32,979 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 7 states. [2019-11-26 03:00:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:33,092 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2019-11-26 03:00:33,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 03:00:33,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-26 03:00:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:33,093 INFO L225 Difference]: With dead ends: 165 [2019-11-26 03:00:33,094 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 03:00:33,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-26 03:00:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 03:00:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 86. [2019-11-26 03:00:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-26 03:00:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2019-11-26 03:00:33,102 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 18 [2019-11-26 03:00:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:33,102 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2019-11-26 03:00:33,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 03:00:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2019-11-26 03:00:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 03:00:33,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:33,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:33,104 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-11-26 03:00:33,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:33,104 INFO L82 PathProgramCache]: Analyzing trace with hash 414303865, now seen corresponding path program 1 times [2019-11-26 03:00:33,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:33,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520605621] [2019-11-26 03:00:33,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:33,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520605621] [2019-11-26 03:00:33,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:33,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 03:00:33,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576504058] [2019-11-26 03:00:33,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 03:00:33,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 03:00:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:00:33,251 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand 6 states. [2019-11-26 03:00:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:33,354 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2019-11-26 03:00:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 03:00:33,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-26 03:00:33,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:33,356 INFO L225 Difference]: With dead ends: 117 [2019-11-26 03:00:33,356 INFO L226 Difference]: Without dead ends: 78 [2019-11-26 03:00:33,356 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-11-26 03:00:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-26 03:00:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-26 03:00:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 03:00:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-11-26 03:00:33,363 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 18 [2019-11-26 03:00:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:33,363 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-11-26 03:00:33,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 03:00:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-11-26 03:00:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 03:00:33,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:33,364 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-11-26 03:00:33,365 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-11-26 03:00:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash 627339272, now seen corresponding path program 1 times [2019-11-26 03:00:33,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:33,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020023291] [2019-11-26 03:00:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:33,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020023291] [2019-11-26 03:00:33,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:33,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:00:33,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163398215] [2019-11-26 03:00:33,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 03:00:33,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:33,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 03:00:33,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:00:33,583 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 7 states. [2019-11-26 03:00:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:33,726 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-11-26 03:00:33,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 03:00:33,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-26 03:00:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:33,727 INFO L225 Difference]: With dead ends: 106 [2019-11-26 03:00:33,727 INFO L226 Difference]: Without dead ends: 105 [2019-11-26 03:00:33,729 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-11-26 03:00:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-26 03:00:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2019-11-26 03:00:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 03:00:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-11-26 03:00:33,736 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 20 [2019-11-26 03:00:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:33,737 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-11-26 03:00:33,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 03:00:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-11-26 03:00:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 03:00:33,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:33,738 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-11-26 03:00:33,738 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-11-26 03:00:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1492775840, now seen corresponding path program 1 times [2019-11-26 03:00:33,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:33,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423177332] [2019-11-26 03:00:33,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:33,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423177332] [2019-11-26 03:00:33,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:33,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 03:00:33,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212426274] [2019-11-26 03:00:33,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 03:00:33,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:33,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 03:00:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:00:33,883 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 7 states. [2019-11-26 03:00:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:33,969 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-11-26 03:00:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 03:00:33,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-26 03:00:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:33,971 INFO L225 Difference]: With dead ends: 143 [2019-11-26 03:00:33,971 INFO L226 Difference]: Without dead ends: 142 [2019-11-26 03:00:33,971 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-11-26 03:00:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-26 03:00:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2019-11-26 03:00:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-26 03:00:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-11-26 03:00:33,979 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 20 [2019-11-26 03:00:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:33,979 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-11-26 03:00:33,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 03:00:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-11-26 03:00:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 03:00:33,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:33,980 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-11-26 03:00:33,980 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-11-26 03:00:33,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:33,981 INFO L82 PathProgramCache]: Analyzing trace with hash 968595791, now seen corresponding path program 1 times [2019-11-26 03:00:33,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:33,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107920917] [2019-11-26 03:00:33,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:34,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107920917] [2019-11-26 03:00:34,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:34,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 03:00:34,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481444571] [2019-11-26 03:00:34,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 03:00:34,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:34,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 03:00:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-26 03:00:34,310 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 10 states. [2019-11-26 03:00:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:35,056 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2019-11-26 03:00:35,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 03:00:35,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-26 03:00:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:35,057 INFO L225 Difference]: With dead ends: 162 [2019-11-26 03:00:35,058 INFO L226 Difference]: Without dead ends: 159 [2019-11-26 03:00:35,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-11-26 03:00:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-26 03:00:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 92. [2019-11-26 03:00:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-26 03:00:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2019-11-26 03:00:35,068 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 21 [2019-11-26 03:00:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:35,069 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2019-11-26 03:00:35,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 03:00:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2019-11-26 03:00:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 03:00:35,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:35,071 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-11-26 03:00:35,071 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-11-26 03:00:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1577628554, now seen corresponding path program 1 times [2019-11-26 03:00:35,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:35,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677755955] [2019-11-26 03:00:35,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 03:00:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 03:00:35,149 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 03:00:35,150 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 03:00:35,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 03:00:35 BoogieIcfgContainer [2019-11-26 03:00:35,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 03:00:35,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 03:00:35,192 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 03:00:35,192 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 03:00:35,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:00:30" (3/4) ... [2019-11-26 03:00:35,196 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 03:00:35,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 03:00:35,202 INFO L168 Benchmark]: Toolchain (without parser) took 6557.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -103.8 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:35,203 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:00:35,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:35,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:35,205 INFO L168 Benchmark]: Boogie Preprocessor took 32.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:35,209 INFO L168 Benchmark]: RCFGBuilder took 1045.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:35,209 INFO L168 Benchmark]: TraceAbstraction took 4964.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -22.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:35,209 INFO L168 Benchmark]: Witness Printer took 4.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:00:35,215 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 450.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1045.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4964.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -22.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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: 4.8s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1319 SDtfs, 1523 SDslu, 2810 SDs, 0 SdLazy, 900 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.6s 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.4s SatisfiabilityAnalysisTime, 1.5s 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...