./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94419cb5ed7b14b2ed497048686126b88cc40ca2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:32:19,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:32:19,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:32:19,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:32:19,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:32:19,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:32:19,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:32:19,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:32:19,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:32:19,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:32:19,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:32:19,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:32:19,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:32:19,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:32:19,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:32:19,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:32:19,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:32:19,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:32:19,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:32:19,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:32:19,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:32:19,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:32:19,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:32:19,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:32:19,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:32:19,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:32:19,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:32:19,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:32:19,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:32:19,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:32:19,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:32:19,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:32:19,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:32:19,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:32:19,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:32:19,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:32:19,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:32:19,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:32:19,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:32:19,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:32:19,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:32:19,202 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-12-07 19:32:19,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:32:19,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:32:19,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:32:19,216 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:32:19,216 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:32:19,216 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:32:19,216 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:32:19,217 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:32:19,217 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:32:19,217 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:32:19,217 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:32:19,217 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:32:19,217 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:32:19,218 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:32:19,218 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:32:19,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:32:19,218 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:32:19,219 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:32:19,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:32:19,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:32:19,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:32:19,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:32:19,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:32:19,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:32:19,220 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 19:32:19,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:32:19,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:32:19,220 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:32:19,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:32:19,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:32:19,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:32:19,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:32:19,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:32:19,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:32:19,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:32:19,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:32:19,222 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:32:19,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:32:19,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:32:19,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:32:19,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:32:19,223 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_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94419cb5ed7b14b2ed497048686126b88cc40ca2 [2019-12-07 19:32:19,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:32:19,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:32:19,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:32:19,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:32:19,344 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:32:19,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/../../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2019-12-07 19:32:19,388 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/data/71109cea0/0d56aebab1b94bbfbd7a9878cf143825/FLAG0ae0e97c3 [2019-12-07 19:32:19,779 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:32:19,780 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2019-12-07 19:32:19,784 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/data/71109cea0/0d56aebab1b94bbfbd7a9878cf143825/FLAG0ae0e97c3 [2019-12-07 19:32:20,168 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/data/71109cea0/0d56aebab1b94bbfbd7a9878cf143825 [2019-12-07 19:32:20,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:32:20,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:32:20,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:32:20,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:32:20,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:32:20,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21912893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20, skipping insertion in model container [2019-12-07 19:32:20,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:32:20,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:32:20,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:32:20,365 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:32:20,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:32:20,399 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:32:20,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20 WrapperNode [2019-12-07 19:32:20,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:32:20,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:32:20,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:32:20,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:32:20,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:32:20,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:32:20,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:32:20,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:32:20,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... [2019-12-07 19:32:20,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:32:20,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:32:20,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:32:20,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:32:20,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b78fa19d-a2c5-4ff9-8f42-a64786e6bedd/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:32:20,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:32:20,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:32:20,910 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:32:20,910 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-12-07 19:32:20,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:32:20 BoogieIcfgContainer [2019-12-07 19:32:20,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:32:20,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:32:20,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:32:20,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:32:20,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:32:20" (1/3) ... [2019-12-07 19:32:20,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7238a42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:32:20, skipping insertion in model container [2019-12-07 19:32:20,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:32:20" (2/3) ... [2019-12-07 19:32:20,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7238a42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:32:20, skipping insertion in model container [2019-12-07 19:32:20,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:32:20" (3/3) ... [2019-12-07 19:32:20,915 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2019-12-07 19:32:20,921 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:32:20,926 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-12-07 19:32:20,933 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-12-07 19:32:20,948 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:32:20,948 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:32:20,948 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:32:20,949 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:32:20,949 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:32:20,949 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:32:20,949 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:32:20,949 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:32:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-12-07 19:32:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:32:20,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:20,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:32:20,967 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:20,971 INFO L82 PathProgramCache]: Analyzing trace with hash 923251214, now seen corresponding path program 1 times [2019-12-07 19:32:20,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:20,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128599635] [2019-12-07 19:32:20,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128599635] [2019-12-07 19:32:21,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:21,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820785088] [2019-12-07 19:32:21,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 19:32:21,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 19:32:21,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 19:32:21,067 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2019-12-07 19:32:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,085 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2019-12-07 19:32:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:32:21,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-12-07 19:32:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,094 INFO L225 Difference]: With dead ends: 219 [2019-12-07 19:32:21,094 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 19:32:21,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 19:32:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 19:32:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-12-07 19:32:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 19:32:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2019-12-07 19:32:21,124 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 6 [2019-12-07 19:32:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,125 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2019-12-07 19:32:21,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 19:32:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2019-12-07 19:32:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:32:21,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,126 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-12-07 19:32:21,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173697994] [2019-12-07 19:32:21,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173697994] [2019-12-07 19:32:21,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:21,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201508373] [2019-12-07 19:32:21,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:21,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:21,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,164 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand 4 states. [2019-12-07 19:32:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,230 INFO L93 Difference]: Finished difference Result 255 states and 297 transitions. [2019-12-07 19:32:21,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:21,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 19:32:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,233 INFO L225 Difference]: With dead ends: 255 [2019-12-07 19:32:21,233 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 19:32:21,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 19:32:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 94. [2019-12-07 19:32:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 19:32:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2019-12-07 19:32:21,244 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 6 [2019-12-07 19:32:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,244 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2019-12-07 19:32:21,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2019-12-07 19:32:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:32:21,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,246 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2108179699, now seen corresponding path program 1 times [2019-12-07 19:32:21,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940201286] [2019-12-07 19:32:21,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940201286] [2019-12-07 19:32:21,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:21,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313599638] [2019-12-07 19:32:21,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:21,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,272 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 4 states. [2019-12-07 19:32:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,328 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2019-12-07 19:32:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:21,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 19:32:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,330 INFO L225 Difference]: With dead ends: 150 [2019-12-07 19:32:21,330 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 19:32:21,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 19:32:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2019-12-07 19:32:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 19:32:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2019-12-07 19:32:21,340 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 8 [2019-12-07 19:32:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,340 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2019-12-07 19:32:21,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2019-12-07 19:32:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:32:21,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash -929061096, now seen corresponding path program 1 times [2019-12-07 19:32:21,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650714463] [2019-12-07 19:32:21,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650714463] [2019-12-07 19:32:21,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:21,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038797411] [2019-12-07 19:32:21,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:32:21,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:32:21,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:32:21,365 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand 3 states. [2019-12-07 19:32:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,400 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2019-12-07 19:32:21,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:32:21,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 19:32:21,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,401 INFO L225 Difference]: With dead ends: 144 [2019-12-07 19:32:21,401 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 19:32:21,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:32:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 19:32:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 93. [2019-12-07 19:32:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 19:32:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2019-12-07 19:32:21,409 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 9 [2019-12-07 19:32:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,410 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-12-07 19:32:21,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:32:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2019-12-07 19:32:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:32:21,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,411 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2143574469, now seen corresponding path program 1 times [2019-12-07 19:32:21,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440503606] [2019-12-07 19:32:21,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440503606] [2019-12-07 19:32:21,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:21,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51167196] [2019-12-07 19:32:21,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:21,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,440 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand 4 states. [2019-12-07 19:32:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,484 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2019-12-07 19:32:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:21,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 19:32:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,485 INFO L225 Difference]: With dead ends: 148 [2019-12-07 19:32:21,485 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 19:32:21,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 19:32:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2019-12-07 19:32:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 19:32:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2019-12-07 19:32:21,490 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 10 [2019-12-07 19:32:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,490 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2019-12-07 19:32:21,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2019-12-07 19:32:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:32:21,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,491 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,492 INFO L82 PathProgramCache]: Analyzing trace with hash -45359405, now seen corresponding path program 1 times [2019-12-07 19:32:21,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882166682] [2019-12-07 19:32:21,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882166682] [2019-12-07 19:32:21,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:32:21,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135157304] [2019-12-07 19:32:21,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:32:21,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:32:21,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:21,577 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand 7 states. [2019-12-07 19:32:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,694 INFO L93 Difference]: Finished difference Result 217 states and 249 transitions. [2019-12-07 19:32:21,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:32:21,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 19:32:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,696 INFO L225 Difference]: With dead ends: 217 [2019-12-07 19:32:21,696 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 19:32:21,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:32:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 19:32:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 129. [2019-12-07 19:32:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 19:32:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2019-12-07 19:32:21,706 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 10 [2019-12-07 19:32:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,707 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2019-12-07 19:32:21,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:32:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2019-12-07 19:32:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:32:21,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,708 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash -51475367, now seen corresponding path program 1 times [2019-12-07 19:32:21,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918267943] [2019-12-07 19:32:21,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918267943] [2019-12-07 19:32:21,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:21,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654165498] [2019-12-07 19:32:21,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:21,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,733 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand 4 states. [2019-12-07 19:32:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,778 INFO L93 Difference]: Finished difference Result 207 states and 259 transitions. [2019-12-07 19:32:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:21,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 19:32:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,780 INFO L225 Difference]: With dead ends: 207 [2019-12-07 19:32:21,780 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 19:32:21,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 19:32:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 136. [2019-12-07 19:32:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 19:32:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 170 transitions. [2019-12-07 19:32:21,787 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 170 transitions. Word has length 10 [2019-12-07 19:32:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,787 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 170 transitions. [2019-12-07 19:32:21,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 170 transitions. [2019-12-07 19:32:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 19:32:21,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,789 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1335732703, now seen corresponding path program 1 times [2019-12-07 19:32:21,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938322244] [2019-12-07 19:32:21,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938322244] [2019-12-07 19:32:21,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:32:21,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360746019] [2019-12-07 19:32:21,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:21,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:21,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,811 INFO L87 Difference]: Start difference. First operand 136 states and 170 transitions. Second operand 4 states. [2019-12-07 19:32:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,863 INFO L93 Difference]: Finished difference Result 214 states and 262 transitions. [2019-12-07 19:32:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:21,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 19:32:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,865 INFO L225 Difference]: With dead ends: 214 [2019-12-07 19:32:21,865 INFO L226 Difference]: Without dead ends: 212 [2019-12-07 19:32:21,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-12-07 19:32:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 141. [2019-12-07 19:32:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 19:32:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 174 transitions. [2019-12-07 19:32:21,874 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 174 transitions. Word has length 12 [2019-12-07 19:32:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,874 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 174 transitions. [2019-12-07 19:32:21,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 174 transitions. [2019-12-07 19:32:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:32:21,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,875 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1811434083, now seen corresponding path program 1 times [2019-12-07 19:32:21,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843446310] [2019-12-07 19:32:21,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843446310] [2019-12-07 19:32:21,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:32:21,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917958106] [2019-12-07 19:32:21,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:21,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:21,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,893 INFO L87 Difference]: Start difference. First operand 141 states and 174 transitions. Second operand 4 states. [2019-12-07 19:32:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:21,940 INFO L93 Difference]: Finished difference Result 280 states and 339 transitions. [2019-12-07 19:32:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:21,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:32:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:21,942 INFO L225 Difference]: With dead ends: 280 [2019-12-07 19:32:21,942 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 19:32:21,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 19:32:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 130. [2019-12-07 19:32:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 19:32:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2019-12-07 19:32:21,949 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 13 [2019-12-07 19:32:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:21,949 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2019-12-07 19:32:21,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2019-12-07 19:32:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:32:21,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:21,950 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:21,951 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1938533571, now seen corresponding path program 1 times [2019-12-07 19:32:21,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:21,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236550264] [2019-12-07 19:32:21,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:21,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236550264] [2019-12-07 19:32:21,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:21,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:32:21,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117071657] [2019-12-07 19:32:21,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:21,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:21,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:21,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:21,968 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand 4 states. [2019-12-07 19:32:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:22,014 INFO L93 Difference]: Finished difference Result 228 states and 275 transitions. [2019-12-07 19:32:22,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:22,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:32:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:22,016 INFO L225 Difference]: With dead ends: 228 [2019-12-07 19:32:22,016 INFO L226 Difference]: Without dead ends: 226 [2019-12-07 19:32:22,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-12-07 19:32:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 116. [2019-12-07 19:32:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 19:32:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2019-12-07 19:32:22,022 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 14 [2019-12-07 19:32:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:22,022 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2019-12-07 19:32:22,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2019-12-07 19:32:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:32:22,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:22,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:22,024 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash 560593284, now seen corresponding path program 1 times [2019-12-07 19:32:22,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:22,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66920320] [2019-12-07 19:32:22,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:22,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66920320] [2019-12-07 19:32:22,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:22,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:32:22,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305629162] [2019-12-07 19:32:22,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:32:22,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:22,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:32:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:32:22,182 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand 8 states. [2019-12-07 19:32:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:22,358 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2019-12-07 19:32:22,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:32:22,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 19:32:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:22,359 INFO L225 Difference]: With dead ends: 149 [2019-12-07 19:32:22,359 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 19:32:22,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:32:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 19:32:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2019-12-07 19:32:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 19:32:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-12-07 19:32:22,365 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 14 [2019-12-07 19:32:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:22,365 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-12-07 19:32:22,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:32:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2019-12-07 19:32:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:32:22,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:22,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:22,366 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 573296884, now seen corresponding path program 1 times [2019-12-07 19:32:22,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684257201] [2019-12-07 19:32:22,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:22,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684257201] [2019-12-07 19:32:22,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:22,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:32:22,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021454021] [2019-12-07 19:32:22,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:32:22,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:22,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:32:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:32:22,497 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 8 states. [2019-12-07 19:32:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:22,625 INFO L93 Difference]: Finished difference Result 140 states and 167 transitions. [2019-12-07 19:32:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:32:22,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 19:32:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:22,626 INFO L225 Difference]: With dead ends: 140 [2019-12-07 19:32:22,626 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 19:32:22,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:32:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 19:32:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2019-12-07 19:32:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 19:32:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2019-12-07 19:32:22,631 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 16 [2019-12-07 19:32:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:22,631 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2019-12-07 19:32:22,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:32:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2019-12-07 19:32:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:32:22,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:22,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:22,632 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1859242662, now seen corresponding path program 1 times [2019-12-07 19:32:22,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:22,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137307539] [2019-12-07 19:32:22,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:22,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137307539] [2019-12-07 19:32:22,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:22,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:32:22,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257731653] [2019-12-07 19:32:22,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:32:22,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:22,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:32:22,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:32:22,802 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand 9 states. [2019-12-07 19:32:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:22,913 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2019-12-07 19:32:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:32:22,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-12-07 19:32:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:22,915 INFO L225 Difference]: With dead ends: 169 [2019-12-07 19:32:22,915 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 19:32:22,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:32:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 19:32:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2019-12-07 19:32:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 19:32:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2019-12-07 19:32:22,923 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 16 [2019-12-07 19:32:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:22,923 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2019-12-07 19:32:22,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:32:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2019-12-07 19:32:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:32:22,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:22,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:22,925 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:22,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1801953261, now seen corresponding path program 1 times [2019-12-07 19:32:22,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:22,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575438828] [2019-12-07 19:32:22,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:23,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575438828] [2019-12-07 19:32:23,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:23,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 19:32:23,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565657168] [2019-12-07 19:32:23,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:32:23,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:32:23,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:32:23,213 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 12 states. [2019-12-07 19:32:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:25,604 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2019-12-07 19:32:25,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:32:25,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-12-07 19:32:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:25,606 INFO L225 Difference]: With dead ends: 173 [2019-12-07 19:32:25,606 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 19:32:25,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:32:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 19:32:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 127. [2019-12-07 19:32:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 19:32:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2019-12-07 19:32:25,611 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 17 [2019-12-07 19:32:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:25,612 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2019-12-07 19:32:25,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:32:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2019-12-07 19:32:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:32:25,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:25,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:25,613 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:25,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:25,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1182502646, now seen corresponding path program 1 times [2019-12-07 19:32:25,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:25,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435421573] [2019-12-07 19:32:25,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:25,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435421573] [2019-12-07 19:32:25,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:25,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:32:25,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369459283] [2019-12-07 19:32:25,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:32:25,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:32:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:32:25,783 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand 10 states. [2019-12-07 19:32:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:25,969 INFO L93 Difference]: Finished difference Result 321 states and 371 transitions. [2019-12-07 19:32:25,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:32:25,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-07 19:32:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:25,971 INFO L225 Difference]: With dead ends: 321 [2019-12-07 19:32:25,971 INFO L226 Difference]: Without dead ends: 319 [2019-12-07 19:32:25,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:32:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-12-07 19:32:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 154. [2019-12-07 19:32:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 19:32:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2019-12-07 19:32:25,978 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 18 [2019-12-07 19:32:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:25,978 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2019-12-07 19:32:25,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:32:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2019-12-07 19:32:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:32:25,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:25,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:25,979 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:25,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash -131832139, now seen corresponding path program 1 times [2019-12-07 19:32:25,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:25,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503155933] [2019-12-07 19:32:25,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:26,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503155933] [2019-12-07 19:32:26,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:26,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:32:26,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384629733] [2019-12-07 19:32:26,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:26,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:26,041 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand 6 states. [2019-12-07 19:32:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:26,137 INFO L93 Difference]: Finished difference Result 302 states and 353 transitions. [2019-12-07 19:32:26,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:32:26,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-12-07 19:32:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:26,139 INFO L225 Difference]: With dead ends: 302 [2019-12-07 19:32:26,139 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 19:32:26,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:32:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 19:32:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 161. [2019-12-07 19:32:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 19:32:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 196 transitions. [2019-12-07 19:32:26,146 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 196 transitions. Word has length 18 [2019-12-07 19:32:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:26,146 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 196 transitions. [2019-12-07 19:32:26,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 196 transitions. [2019-12-07 19:32:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:32:26,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:26,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:26,147 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash 25976531, now seen corresponding path program 1 times [2019-12-07 19:32:26,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:26,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112174941] [2019-12-07 19:32:26,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:26,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112174941] [2019-12-07 19:32:26,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:26,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:32:26,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952554973] [2019-12-07 19:32:26,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:32:26,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:26,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:32:26,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:26,214 INFO L87 Difference]: Start difference. First operand 161 states and 196 transitions. Second operand 7 states. [2019-12-07 19:32:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:26,316 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-12-07 19:32:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:32:26,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 19:32:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:26,317 INFO L225 Difference]: With dead ends: 201 [2019-12-07 19:32:26,317 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 19:32:26,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:32:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 19:32:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 154. [2019-12-07 19:32:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 19:32:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 188 transitions. [2019-12-07 19:32:26,324 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 188 transitions. Word has length 18 [2019-12-07 19:32:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:26,324 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 188 transitions. [2019-12-07 19:32:26,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:32:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 188 transitions. [2019-12-07 19:32:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:32:26,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:26,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:26,325 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash 257041776, now seen corresponding path program 1 times [2019-12-07 19:32:26,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:26,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348725655] [2019-12-07 19:32:26,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:26,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348725655] [2019-12-07 19:32:26,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:26,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:32:26,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073651260] [2019-12-07 19:32:26,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:32:26,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:32:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:26,463 INFO L87 Difference]: Start difference. First operand 154 states and 188 transitions. Second operand 7 states. [2019-12-07 19:32:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:26,575 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2019-12-07 19:32:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:32:26,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 19:32:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:26,576 INFO L225 Difference]: With dead ends: 181 [2019-12-07 19:32:26,576 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 19:32:26,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:32:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 19:32:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 154. [2019-12-07 19:32:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 19:32:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 187 transitions. [2019-12-07 19:32:26,582 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 187 transitions. Word has length 18 [2019-12-07 19:32:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:26,582 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 187 transitions. [2019-12-07 19:32:26,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:32:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 187 transitions. [2019-12-07 19:32:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:32:26,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:26,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:26,583 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1997119809, now seen corresponding path program 1 times [2019-12-07 19:32:26,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:26,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225051582] [2019-12-07 19:32:26,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:26,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225051582] [2019-12-07 19:32:26,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:26,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:32:26,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275184986] [2019-12-07 19:32:26,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:32:26,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:32:26,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:32:26,752 INFO L87 Difference]: Start difference. First operand 154 states and 187 transitions. Second operand 10 states. [2019-12-07 19:32:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:26,963 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2019-12-07 19:32:26,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:32:26,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-07 19:32:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:26,964 INFO L225 Difference]: With dead ends: 178 [2019-12-07 19:32:26,964 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 19:32:26,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:32:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 19:32:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 164. [2019-12-07 19:32:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 19:32:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 200 transitions. [2019-12-07 19:32:26,973 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 200 transitions. Word has length 19 [2019-12-07 19:32:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:26,973 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 200 transitions. [2019-12-07 19:32:26,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:32:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 200 transitions. [2019-12-07 19:32:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:32:26,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:26,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:26,974 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash -621633949, now seen corresponding path program 1 times [2019-12-07 19:32:26,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:26,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399774561] [2019-12-07 19:32:26,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:27,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399774561] [2019-12-07 19:32:27,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:27,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:32:27,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321669107] [2019-12-07 19:32:27,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:32:27,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:32:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:32:27,148 INFO L87 Difference]: Start difference. First operand 164 states and 200 transitions. Second operand 10 states. [2019-12-07 19:32:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:27,379 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2019-12-07 19:32:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 19:32:27,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-07 19:32:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:27,380 INFO L225 Difference]: With dead ends: 184 [2019-12-07 19:32:27,380 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 19:32:27,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:32:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 19:32:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2019-12-07 19:32:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 19:32:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2019-12-07 19:32:27,387 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 19 [2019-12-07 19:32:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:27,388 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2019-12-07 19:32:27,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:32:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2019-12-07 19:32:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:32:27,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:27,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:27,388 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1450247776, now seen corresponding path program 1 times [2019-12-07 19:32:27,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:27,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392907610] [2019-12-07 19:32:27,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:27,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392907610] [2019-12-07 19:32:27,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:27,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:32:27,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746559088] [2019-12-07 19:32:27,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:32:27,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:32:27,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:27,502 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand 7 states. [2019-12-07 19:32:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:27,616 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2019-12-07 19:32:27,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:32:27,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 19:32:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:27,617 INFO L225 Difference]: With dead ends: 176 [2019-12-07 19:32:27,617 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 19:32:27,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:32:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 19:32:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-12-07 19:32:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 19:32:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 191 transitions. [2019-12-07 19:32:27,624 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 191 transitions. Word has length 20 [2019-12-07 19:32:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:27,624 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 191 transitions. [2019-12-07 19:32:27,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:32:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 191 transitions. [2019-12-07 19:32:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:32:27,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:27,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:27,625 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 135912991, now seen corresponding path program 1 times [2019-12-07 19:32:27,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:27,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804180202] [2019-12-07 19:32:27,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:27,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804180202] [2019-12-07 19:32:27,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:27,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:32:27,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082657348] [2019-12-07 19:32:27,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:32:27,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:27,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:32:27,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:27,689 INFO L87 Difference]: Start difference. First operand 158 states and 191 transitions. Second operand 5 states. [2019-12-07 19:32:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:27,761 INFO L93 Difference]: Finished difference Result 206 states and 243 transitions. [2019-12-07 19:32:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:27,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 19:32:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:27,763 INFO L225 Difference]: With dead ends: 206 [2019-12-07 19:32:27,763 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 19:32:27,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 19:32:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 158. [2019-12-07 19:32:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 19:32:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 191 transitions. [2019-12-07 19:32:27,770 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 191 transitions. Word has length 20 [2019-12-07 19:32:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:27,770 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 191 transitions. [2019-12-07 19:32:27,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:32:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 191 transitions. [2019-12-07 19:32:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:32:27,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:27,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:27,771 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1781171576, now seen corresponding path program 1 times [2019-12-07 19:32:27,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:27,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009259384] [2019-12-07 19:32:27,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:27,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009259384] [2019-12-07 19:32:27,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:27,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:32:27,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710944924] [2019-12-07 19:32:27,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:32:27,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:27,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:32:27,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:32:27,859 INFO L87 Difference]: Start difference. First operand 158 states and 191 transitions. Second operand 8 states. [2019-12-07 19:32:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:27,962 INFO L93 Difference]: Finished difference Result 312 states and 355 transitions. [2019-12-07 19:32:27,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:32:27,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-07 19:32:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:27,964 INFO L225 Difference]: With dead ends: 312 [2019-12-07 19:32:27,964 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 19:32:27,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:32:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 19:32:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 158. [2019-12-07 19:32:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 19:32:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2019-12-07 19:32:27,971 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 20 [2019-12-07 19:32:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:27,971 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2019-12-07 19:32:27,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:32:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2019-12-07 19:32:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:32:27,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:27,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:27,972 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:27,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2133073179, now seen corresponding path program 1 times [2019-12-07 19:32:27,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:27,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120824430] [2019-12-07 19:32:27,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:28,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120824430] [2019-12-07 19:32:28,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:28,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:32:28,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298163687] [2019-12-07 19:32:28,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:28,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:28,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:28,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:28,017 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand 6 states. [2019-12-07 19:32:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:28,111 INFO L93 Difference]: Finished difference Result 312 states and 353 transitions. [2019-12-07 19:32:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:32:28,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 19:32:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:28,113 INFO L225 Difference]: With dead ends: 312 [2019-12-07 19:32:28,113 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 19:32:28,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 19:32:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 158. [2019-12-07 19:32:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 19:32:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 188 transitions. [2019-12-07 19:32:28,120 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 188 transitions. Word has length 20 [2019-12-07 19:32:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:28,120 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 188 transitions. [2019-12-07 19:32:28,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 188 transitions. [2019-12-07 19:32:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:32:28,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:28,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:28,121 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:28,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2090782947, now seen corresponding path program 1 times [2019-12-07 19:32:28,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:28,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128200452] [2019-12-07 19:32:28,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:28,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128200452] [2019-12-07 19:32:28,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:28,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:32:28,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491821159] [2019-12-07 19:32:28,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:32:28,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:32:28,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:32:28,322 INFO L87 Difference]: Start difference. First operand 158 states and 188 transitions. Second operand 11 states. [2019-12-07 19:32:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:28,715 INFO L93 Difference]: Finished difference Result 170 states and 196 transitions. [2019-12-07 19:32:28,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:32:28,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-12-07 19:32:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:28,716 INFO L225 Difference]: With dead ends: 170 [2019-12-07 19:32:28,716 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 19:32:28,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:32:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 19:32:28,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2019-12-07 19:32:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 19:32:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2019-12-07 19:32:28,723 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 20 [2019-12-07 19:32:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:28,723 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2019-12-07 19:32:28,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:32:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2019-12-07 19:32:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:32:28,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:28,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:28,723 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1810867940, now seen corresponding path program 1 times [2019-12-07 19:32:28,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:28,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626585666] [2019-12-07 19:32:28,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:28,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626585666] [2019-12-07 19:32:28,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:28,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:32:28,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694843676] [2019-12-07 19:32:28,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:32:28,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:32:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:32:28,885 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand 10 states. [2019-12-07 19:32:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:31,639 INFO L93 Difference]: Finished difference Result 321 states and 352 transitions. [2019-12-07 19:32:31,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:32:31,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 19:32:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:31,640 INFO L225 Difference]: With dead ends: 321 [2019-12-07 19:32:31,640 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 19:32:31,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-12-07 19:32:31,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 19:32:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 161. [2019-12-07 19:32:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 19:32:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2019-12-07 19:32:31,647 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 21 [2019-12-07 19:32:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:31,648 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2019-12-07 19:32:31,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:32:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2019-12-07 19:32:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:32:31,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:31,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:31,648 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:31,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:31,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1766926287, now seen corresponding path program 1 times [2019-12-07 19:32:31,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:31,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107869473] [2019-12-07 19:32:31,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:31,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107869473] [2019-12-07 19:32:31,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:31,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:32:31,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655367728] [2019-12-07 19:32:31,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:31,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:31,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:31,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:31,710 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand 6 states. [2019-12-07 19:32:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:31,786 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2019-12-07 19:32:31,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:32:31,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:32:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:31,787 INFO L225 Difference]: With dead ends: 206 [2019-12-07 19:32:31,787 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 19:32:31,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:32:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 19:32:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 181. [2019-12-07 19:32:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-12-07 19:32:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 219 transitions. [2019-12-07 19:32:31,795 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 219 transitions. Word has length 22 [2019-12-07 19:32:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:31,795 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 219 transitions. [2019-12-07 19:32:31,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 219 transitions. [2019-12-07 19:32:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:32:31,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:31,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:31,796 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_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.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:32:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1763374209, now seen corresponding path program 1 times [2019-12-07 19:32:31,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:31,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029985214] [2019-12-07 19:32:31,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:32:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:32:31,823 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:32:31,823 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:32:31,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:32:31 BoogieIcfgContainer [2019-12-07 19:32:31,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:32:31,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:32:31,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:32:31,843 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:32:31,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:32:20" (3/4) ... [2019-12-07 19:32:31,846 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 19:32:31,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:32:31,848 INFO L168 Benchmark]: Toolchain (without parser) took 11674.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 937.2 MB in the beginning and 899.5 MB in the end (delta: 37.7 MB). Peak memory consumption was 218.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:31,848 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:32:31,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:31,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:31,849 INFO L168 Benchmark]: Boogie Preprocessor took 22.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:32:31,849 INFO L168 Benchmark]: RCFGBuilder took 456.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:31,849 INFO L168 Benchmark]: TraceAbstraction took 10931.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 92.3 MB). Free memory was 1.0 GB in the beginning and 899.5 MB in the end (delta: 116.9 MB). Peak memory consumption was 209.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:31,849 INFO L168 Benchmark]: Witness Printer took 3.16 ms. Allocated memory is still 1.2 GB. Free memory is still 899.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:32:31,851 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 225.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10931.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 92.3 MB). Free memory was 1.0 GB in the beginning and 899.5 MB in the end (delta: 116.9 MB). Peak memory consumption was 209.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.16 ms. Allocated memory is still 1.2 GB. Free memory is still 899.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add1 ; [L224] unsigned int r_add2 ; [L225] unsigned int zero ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int __retres14 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L232] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] EXPR e + 128 [L68] res = m | ((unsigned int )(e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L233] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND TRUE m >= 1U << 25U [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U [L71] return (__retres4); [L234] b = base2flt(mb, eb) [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] EXPR (int )(a >> 24U) - 128 [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 38 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 28, TraceHistogramMax: 2, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3196 SDtfs, 4090 SDslu, 9150 SDs, 0 SdLazy, 2888 SolverSat, 303 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=27, 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, 27 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 40370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...