./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/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 64bit --witnessprinter.graph.data.programhash 4f493a0ec5685991b86ced08697f863f174636a1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:21:01,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:21:01,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:21:01,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:21:01,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:21:01,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:21:01,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:21:01,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:21:01,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:21:01,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:21:01,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:21:01,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:21:01,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:21:01,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:21:01,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:21:01,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:21:01,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:21:01,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:21:01,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:21:01,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:21:01,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:21:01,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:21:01,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:21:01,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:21:01,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:21:01,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:21:01,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:21:01,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:21:01,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:21:01,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:21:01,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:21:01,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:21:01,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:21:01,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:21:01,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:21:01,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:21:01,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:21:01,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:21:01,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:21:01,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:21:01,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:21:01,222 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-12-07 20:21:01,232 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:21:01,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:21:01,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:21:01,233 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:21:01,233 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:21:01,233 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:21:01,233 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:21:01,233 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:21:01,233 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:21:01,234 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:21:01,234 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:21:01,234 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:21:01,234 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:21:01,234 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:21:01,234 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:21:01,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:21:01,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:21:01,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:21:01,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:21:01,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:21:01,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:21:01,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:21:01,236 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 20:21:01,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:21:01,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:21:01,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:21:01,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:21:01,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:21:01,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:21:01,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:21:01,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:21:01,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:21:01,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:21:01,237 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:21:01,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:21:01,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:21:01,238 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:21:01,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:21:01,238 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_72515ed3-41d9-4f85-b65e-03f120c886b8/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f493a0ec5685991b86ced08697f863f174636a1 [2019-12-07 20:21:01,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:21:01,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:21:01,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:21:01,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:21:01,354 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:21:01,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2019-12-07 20:21:01,394 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/data/fb55b9d12/21d3139f07e44179a6e1c416df288881/FLAG6f7955d19 [2019-12-07 20:21:01,795 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:21:01,795 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2019-12-07 20:21:01,800 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/data/fb55b9d12/21d3139f07e44179a6e1c416df288881/FLAG6f7955d19 [2019-12-07 20:21:01,809 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/data/fb55b9d12/21d3139f07e44179a6e1c416df288881 [2019-12-07 20:21:01,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:21:01,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:21:01,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:21:01,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:21:01,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:21:01,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:21:01" (1/1) ... [2019-12-07 20:21:01,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619ba5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:01, skipping insertion in model container [2019-12-07 20:21:01,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:21:01" (1/1) ... [2019-12-07 20:21:01,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:21:01,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:21:01,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:21:01,961 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:21:02,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:21:02,025 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:21:02,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02 WrapperNode [2019-12-07 20:21:02,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:21:02,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:21:02,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:21:02,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:21:02,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:21:02,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:21:02,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:21:02,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:21:02,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... [2019-12-07 20:21:02,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:21:02,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:21:02,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:21:02,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:21:02,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/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 20:21:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:21:02,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:21:02,335 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:21:02,335 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 20:21:02,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:21:02 BoogieIcfgContainer [2019-12-07 20:21:02,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:21:02,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:21:02,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:21:02,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:21:02,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:21:01" (1/3) ... [2019-12-07 20:21:02,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd86c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:21:02, skipping insertion in model container [2019-12-07 20:21:02,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:21:02" (2/3) ... [2019-12-07 20:21:02,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd86c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:21:02, skipping insertion in model container [2019-12-07 20:21:02,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:21:02" (3/3) ... [2019-12-07 20:21:02,341 INFO L109 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-1.c [2019-12-07 20:21:02,347 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:21:02,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-12-07 20:21:02,359 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-12-07 20:21:02,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:21:02,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:21:02,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:21:02,375 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:21:02,375 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:21:02,375 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:21:02,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:21:02,376 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:21:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-12-07 20:21:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:21:02,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:02,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:21:02,394 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.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]=== [2019-12-07 20:21:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash 172532, now seen corresponding path program 1 times [2019-12-07 20:21:02,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:02,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114012187] [2019-12-07 20:21:02,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:02,486 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 20:21:02,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114012187] [2019-12-07 20:21:02,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:02,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:21:02,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984502958] [2019-12-07 20:21:02,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:21:02,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:02,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:21:02,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:02,501 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-12-07 20:21:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:02,637 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2019-12-07 20:21:02,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:21:02,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:21:02,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:02,649 INFO L225 Difference]: With dead ends: 162 [2019-12-07 20:21:02,649 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 20:21:02,652 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 20:21:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 20:21:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-12-07 20:21:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 20:21:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-12-07 20:21:02,679 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 3 [2019-12-07 20:21:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:02,679 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-12-07 20:21:02,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:21:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-12-07 20:21:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:21:02,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:02,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:21:02,680 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.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]=== [2019-12-07 20:21:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:02,680 INFO L82 PathProgramCache]: Analyzing trace with hash 172340, now seen corresponding path program 1 times [2019-12-07 20:21:02,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:02,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964391728] [2019-12-07 20:21:02,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:02,699 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 20:21:02,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964391728] [2019-12-07 20:21:02,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:02,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:21:02,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12392294] [2019-12-07 20:21:02,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:21:02,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:02,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:21:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:02,702 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 3 states. [2019-12-07 20:21:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:02,787 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2019-12-07 20:21:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:21:02,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:21:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:02,788 INFO L225 Difference]: With dead ends: 90 [2019-12-07 20:21:02,788 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 20:21:02,789 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 20:21:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 20:21:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-12-07 20:21:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 20:21:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-12-07 20:21:02,796 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 3 [2019-12-07 20:21:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:02,796 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-12-07 20:21:02,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:21:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-12-07 20:21:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:21:02,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:02,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:21:02,797 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.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]=== [2019-12-07 20:21:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash 5348542, now seen corresponding path program 1 times [2019-12-07 20:21:02,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:02,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238044059] [2019-12-07 20:21:02,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:02,817 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 20:21:02,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238044059] [2019-12-07 20:21:02,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:02,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:21:02,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525073629] [2019-12-07 20:21:02,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:21:02,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:02,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:21:02,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:21:02,819 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 3 states. [2019-12-07 20:21:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:02,907 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-12-07 20:21:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:21:02,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 20:21:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:02,908 INFO L225 Difference]: With dead ends: 110 [2019-12-07 20:21:02,909 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 20:21:02,909 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 20:21:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 20:21:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-12-07 20:21:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 20:21:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2019-12-07 20:21:02,915 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 4 [2019-12-07 20:21:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:02,915 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2019-12-07 20:21:02,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:21:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2019-12-07 20:21:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 20:21:02,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:02,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 20:21:02,916 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.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]=== [2019-12-07 20:21:02,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:02,916 INFO L82 PathProgramCache]: Analyzing trace with hash 839257658, now seen corresponding path program 1 times [2019-12-07 20:21:02,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:02,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528551015] [2019-12-07 20:21:02,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:02,938 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 20:21:02,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528551015] [2019-12-07 20:21:02,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:02,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:21:02,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723820433] [2019-12-07 20:21:02,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:02,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:02,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:02,939 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 4 states. [2019-12-07 20:21:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:03,026 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-12-07 20:21:03,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:03,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 20:21:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:03,028 INFO L225 Difference]: With dead ends: 94 [2019-12-07 20:21:03,028 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 20:21:03,029 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 20:21:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 20:21:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-12-07 20:21:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 20:21:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2019-12-07 20:21:03,035 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2019-12-07 20:21:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:03,035 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2019-12-07 20:21:03,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2019-12-07 20:21:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:21:03,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:03,036 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:03,036 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.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]=== [2019-12-07 20:21:03,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash 424684416, now seen corresponding path program 1 times [2019-12-07 20:21:03,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:03,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706990795] [2019-12-07 20:21:03,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:03,057 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 20:21:03,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706990795] [2019-12-07 20:21:03,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:03,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:21:03,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2719548] [2019-12-07 20:21:03,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:03,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:03,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:03,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:03,058 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 4 states. [2019-12-07 20:21:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:03,179 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2019-12-07 20:21:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:03,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 20:21:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:03,181 INFO L225 Difference]: With dead ends: 126 [2019-12-07 20:21:03,181 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 20:21:03,181 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 20:21:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 20:21:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2019-12-07 20:21:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 20:21:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-12-07 20:21:03,186 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 7 [2019-12-07 20:21:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:03,187 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-12-07 20:21:03,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-12-07 20:21:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:21:03,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:03,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:03,188 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.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]=== [2019-12-07 20:21:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1320317378, now seen corresponding path program 1 times [2019-12-07 20:21:03,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:03,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235026266] [2019-12-07 20:21:03,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:03,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 20:21:03,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235026266] [2019-12-07 20:21:03,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:03,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:21:03,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328289695] [2019-12-07 20:21:03,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:21:03,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:03,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:21:03,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:21:03,214 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 5 states. [2019-12-07 20:21:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:03,296 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-12-07 20:21:03,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:21:03,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 20:21:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:03,297 INFO L225 Difference]: With dead ends: 108 [2019-12-07 20:21:03,297 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 20:21:03,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:21:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 20:21:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2019-12-07 20:21:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 20:21:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-12-07 20:21:03,302 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 9 [2019-12-07 20:21:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:03,302 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-12-07 20:21:03,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:21:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-12-07 20:21:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:21:03,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:03,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:03,303 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.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]=== [2019-12-07 20:21:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1200143412, now seen corresponding path program 1 times [2019-12-07 20:21:03,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:03,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467308447] [2019-12-07 20:21:03,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:03,327 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 20:21:03,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467308447] [2019-12-07 20:21:03,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:03,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:21:03,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756290437] [2019-12-07 20:21:03,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:21:03,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:21:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:21:03,329 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 5 states. [2019-12-07 20:21:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:03,471 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2019-12-07 20:21:03,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:21:03,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 20:21:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:03,473 INFO L225 Difference]: With dead ends: 147 [2019-12-07 20:21:03,473 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 20:21:03,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:21:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 20:21:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 107. [2019-12-07 20:21:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 20:21:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-12-07 20:21:03,479 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-12-07 20:21:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:03,480 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-12-07 20:21:03,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:21:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-12-07 20:21:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:21:03,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:03,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:03,481 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.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]=== [2019-12-07 20:21:03,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:03,482 INFO L82 PathProgramCache]: Analyzing trace with hash 264583048, now seen corresponding path program 1 times [2019-12-07 20:21:03,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:03,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26281329] [2019-12-07 20:21:03,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:03,519 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 20:21:03,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26281329] [2019-12-07 20:21:03,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:03,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:21:03,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505535641] [2019-12-07 20:21:03,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:21:03,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:03,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:21:03,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:21:03,521 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 6 states. [2019-12-07 20:21:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:03,605 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-12-07 20:21:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:21:03,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-12-07 20:21:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:03,606 INFO L225 Difference]: With dead ends: 116 [2019-12-07 20:21:03,607 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 20:21:03,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:21:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 20:21:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2019-12-07 20:21:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 20:21:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-12-07 20:21:03,610 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 12 [2019-12-07 20:21:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:03,610 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-12-07 20:21:03,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:21:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-12-07 20:21:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:21:03,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:03,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:03,611 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.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]=== [2019-12-07 20:21:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2130439758, now seen corresponding path program 1 times [2019-12-07 20:21:03,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:03,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834209708] [2019-12-07 20:21:03,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:03,639 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 20:21:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834209708] [2019-12-07 20:21:03,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:03,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:21:03,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177342882] [2019-12-07 20:21:03,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:21:03,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:03,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:21:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:21:03,640 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 6 states. [2019-12-07 20:21:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:03,785 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2019-12-07 20:21:03,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:21:03,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 20:21:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:03,786 INFO L225 Difference]: With dead ends: 165 [2019-12-07 20:21:03,787 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 20:21:03,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:21:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 20:21:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 109. [2019-12-07 20:21:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 20:21:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-12-07 20:21:03,790 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 13 [2019-12-07 20:21:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:03,790 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-12-07 20:21:03,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:21:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-12-07 20:21:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:21:03,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:03,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:03,791 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.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]=== [2019-12-07 20:21:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash 928680528, now seen corresponding path program 1 times [2019-12-07 20:21:03,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:03,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632225570] [2019-12-07 20:21:03,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:03,831 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 20:21:03,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632225570] [2019-12-07 20:21:03,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:03,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:21:03,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399598274] [2019-12-07 20:21:03,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:21:03,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:21:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:21:03,832 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 7 states. [2019-12-07 20:21:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:03,915 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-12-07 20:21:03,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:21:03,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 20:21:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:03,916 INFO L225 Difference]: With dead ends: 118 [2019-12-07 20:21:03,917 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 20:21:03,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:21:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 20:21:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-12-07 20:21:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 20:21:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-12-07 20:21:03,919 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 15 [2019-12-07 20:21:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:03,919 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-12-07 20:21:03,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:21:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-12-07 20:21:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:21:03,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:03,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:03,920 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.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]=== [2019-12-07 20:21:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1199198938, now seen corresponding path program 1 times [2019-12-07 20:21:03,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:03,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951344106] [2019-12-07 20:21:03,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:03,956 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 20:21:03,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951344106] [2019-12-07 20:21:03,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:03,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:21:03,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406203884] [2019-12-07 20:21:03,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:21:03,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:03,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:21:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:21:03,957 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 7 states. [2019-12-07 20:21:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:04,109 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-12-07 20:21:04,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:21:04,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 20:21:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:04,111 INFO L225 Difference]: With dead ends: 180 [2019-12-07 20:21:04,111 INFO L226 Difference]: Without dead ends: 176 [2019-12-07 20:21:04,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:21:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-07 20:21:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 105. [2019-12-07 20:21:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 20:21:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-12-07 20:21:04,114 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 16 [2019-12-07 20:21:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:04,114 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-12-07 20:21:04,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:21:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-12-07 20:21:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:21:04,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:04,115 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 20:21:04,115 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.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]=== [2019-12-07 20:21:04,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1857611562, now seen corresponding path program 1 times [2019-12-07 20:21:04,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:04,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023116871] [2019-12-07 20:21:04,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:04,151 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 20:21:04,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023116871] [2019-12-07 20:21:04,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:04,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:21:04,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076187115] [2019-12-07 20:21:04,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:21:04,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:04,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:21:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:21:04,152 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 8 states. [2019-12-07 20:21:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:04,243 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-12-07 20:21:04,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:21:04,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 20:21:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:04,243 INFO L225 Difference]: With dead ends: 114 [2019-12-07 20:21:04,244 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 20:21:04,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:21:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 20:21:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2019-12-07 20:21:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 20:21:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-12-07 20:21:04,246 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-12-07 20:21:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:04,246 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-12-07 20:21:04,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:21:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-12-07 20:21:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:21:04,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:04,247 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 20:21:04,247 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.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]=== [2019-12-07 20:21:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash -202290916, now seen corresponding path program 1 times [2019-12-07 20:21:04,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:04,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169209148] [2019-12-07 20:21:04,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:04,286 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 20:21:04,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169209148] [2019-12-07 20:21:04,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:04,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:21:04,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944168438] [2019-12-07 20:21:04,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:21:04,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:04,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:21:04,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:21:04,288 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 8 states. [2019-12-07 20:21:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:04,463 INFO L93 Difference]: Finished difference Result 192 states and 200 transitions. [2019-12-07 20:21:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:21:04,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 20:21:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:04,464 INFO L225 Difference]: With dead ends: 192 [2019-12-07 20:21:04,464 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 20:21:04,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:21:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 20:21:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 95. [2019-12-07 20:21:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 20:21:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2019-12-07 20:21:04,467 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 19 [2019-12-07 20:21:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:04,467 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2019-12-07 20:21:04,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:21:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2019-12-07 20:21:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:21:04,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:04,468 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 20:21:04,468 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.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]=== [2019-12-07 20:21:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash 547678942, now seen corresponding path program 1 times [2019-12-07 20:21:04,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:04,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882023198] [2019-12-07 20:21:04,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:04,510 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 20:21:04,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882023198] [2019-12-07 20:21:04,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:04,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:21:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391079997] [2019-12-07 20:21:04,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:21:04,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:21:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:21:04,511 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 9 states. [2019-12-07 20:21:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:04,584 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-12-07 20:21:04,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:21:04,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 20:21:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:04,585 INFO L225 Difference]: With dead ends: 104 [2019-12-07 20:21:04,585 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 20:21:04,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:21:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 20:21:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2019-12-07 20:21:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 20:21:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-12-07 20:21:04,587 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 21 [2019-12-07 20:21:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:04,588 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-12-07 20:21:04,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:21:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-12-07 20:21:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:21:04,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:04,588 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 20:21:04,589 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.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]=== [2019-12-07 20:21:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -609433112, now seen corresponding path program 1 times [2019-12-07 20:21:04,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:04,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024169206] [2019-12-07 20:21:04,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:04,626 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 20:21:04,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024169206] [2019-12-07 20:21:04,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:04,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:21:04,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215540881] [2019-12-07 20:21:04,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:21:04,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:21:04,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:21:04,627 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 9 states. [2019-12-07 20:21:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:04,793 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2019-12-07 20:21:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:21:04,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 20:21:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:04,795 INFO L225 Difference]: With dead ends: 201 [2019-12-07 20:21:04,795 INFO L226 Difference]: Without dead ends: 199 [2019-12-07 20:21:04,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:21:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-12-07 20:21:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 79. [2019-12-07 20:21:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 20:21:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-12-07 20:21:04,798 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 22 [2019-12-07 20:21:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:04,799 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-12-07 20:21:04,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:21:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-12-07 20:21:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:21:04,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:04,799 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, 1, 1] [2019-12-07 20:21:04,800 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.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]=== [2019-12-07 20:21:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash -677268956, now seen corresponding path program 1 times [2019-12-07 20:21:04,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:04,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525882095] [2019-12-07 20:21:04,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:04,847 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 20:21:04,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525882095] [2019-12-07 20:21:04,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:04,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:21:04,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855219307] [2019-12-07 20:21:04,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:21:04,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:04,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:21:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:21:04,848 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 10 states. [2019-12-07 20:21:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:04,937 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2019-12-07 20:21:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:21:04,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-07 20:21:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:04,937 INFO L225 Difference]: With dead ends: 88 [2019-12-07 20:21:04,937 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 20:21:04,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:21:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 20:21:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2019-12-07 20:21:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 20:21:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-12-07 20:21:04,939 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 24 [2019-12-07 20:21:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:04,940 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-12-07 20:21:04,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:21:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-12-07 20:21:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:21:04,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:04,940 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, 1, 1, 1] [2019-12-07 20:21:04,940 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.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]=== [2019-12-07 20:21:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash -794936342, now seen corresponding path program 1 times [2019-12-07 20:21:04,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:04,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253613676] [2019-12-07 20:21:04,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:04,988 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 20:21:04,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253613676] [2019-12-07 20:21:04,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:04,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:21:04,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37379755] [2019-12-07 20:21:04,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:21:04,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:04,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:21:04,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:21:04,989 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 10 states. [2019-12-07 20:21:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:05,152 INFO L93 Difference]: Finished difference Result 207 states and 215 transitions. [2019-12-07 20:21:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:21:05,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-12-07 20:21:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:05,154 INFO L225 Difference]: With dead ends: 207 [2019-12-07 20:21:05,154 INFO L226 Difference]: Without dead ends: 206 [2019-12-07 20:21:05,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:21:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-07 20:21:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 57. [2019-12-07 20:21:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 20:21:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-12-07 20:21:05,156 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 25 [2019-12-07 20:21:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:05,157 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-12-07 20:21:05,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:21:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-12-07 20:21:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:21:05,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:05,157 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, 1, 1, 1, 1, 1] [2019-12-07 20:21:05,157 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.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]=== [2019-12-07 20:21:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 570359052, now seen corresponding path program 1 times [2019-12-07 20:21:05,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:05,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876071594] [2019-12-07 20:21:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:05,222 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 20:21:05,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876071594] [2019-12-07 20:21:05,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:05,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 20:21:05,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138197890] [2019-12-07 20:21:05,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:21:05,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:05,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:21:05,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:21:05,224 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 13 states. [2019-12-07 20:21:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:05,322 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-12-07 20:21:05,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:21:05,322 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-12-07 20:21:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:05,323 INFO L225 Difference]: With dead ends: 87 [2019-12-07 20:21:05,323 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 20:21:05,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:21:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 20:21:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2019-12-07 20:21:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 20:21:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-12-07 20:21:05,325 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 27 [2019-12-07 20:21:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:05,325 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-12-07 20:21:05,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 20:21:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-12-07 20:21:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:21:05,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:05,326 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, 1, 1, 1, 1, 1] [2019-12-07 20:21:05,326 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.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]=== [2019-12-07 20:21:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash 16545356, now seen corresponding path program 1 times [2019-12-07 20:21:05,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:05,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478938333] [2019-12-07 20:21:05,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:05,340 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 20:21:05,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478938333] [2019-12-07 20:21:05,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:05,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:21:05,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707131759] [2019-12-07 20:21:05,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:21:05,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:05,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:21:05,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:21:05,342 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 4 states. [2019-12-07 20:21:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:05,392 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-12-07 20:21:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:21:05,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 20:21:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:05,393 INFO L225 Difference]: With dead ends: 94 [2019-12-07 20:21:05,393 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 20:21:05,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:21:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 20:21:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-12-07 20:21:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 20:21:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-12-07 20:21:05,395 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 27 [2019-12-07 20:21:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:05,395 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-12-07 20:21:05,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:21:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-12-07 20:21:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:21:05,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:05,395 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, 1, 1, 1, 1, 1] [2019-12-07 20:21:05,396 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.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]=== [2019-12-07 20:21:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1237029900, now seen corresponding path program 1 times [2019-12-07 20:21:05,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:05,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783835885] [2019-12-07 20:21:05,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:21:05,455 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 20:21:05,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783835885] [2019-12-07 20:21:05,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:21:05,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 20:21:05,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953995181] [2019-12-07 20:21:05,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:21:05,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:21:05,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:21:05,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:21:05,457 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 12 states. [2019-12-07 20:21:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:21:05,579 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-12-07 20:21:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:21:05,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-12-07 20:21:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:21:05,579 INFO L225 Difference]: With dead ends: 65 [2019-12-07 20:21:05,580 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 20:21:05,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:21:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 20:21:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2019-12-07 20:21:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 20:21:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-12-07 20:21:05,582 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 27 [2019-12-07 20:21:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:21:05,582 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-12-07 20:21:05,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:21:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-12-07 20:21:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:21:05,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:21:05,582 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, 1, 1, 1, 1, 1, 1] [2019-12-07 20:21:05,583 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.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]=== [2019-12-07 20:21:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:21:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash 501261589, now seen corresponding path program 1 times [2019-12-07 20:21:05,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:21:05,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938590190] [2019-12-07 20:21:05,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:21:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:21:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:21:05,612 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:21:05,612 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:21:05,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:21:05 BoogieIcfgContainer [2019-12-07 20:21:05,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:21:05,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:21:05,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:21:05,629 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:21:05,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:21:02" (3/4) ... [2019-12-07 20:21:05,630 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:21:05,663 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_72515ed3-41d9-4f85-b65e-03f120c886b8/bin/utaipan/witness.graphml [2019-12-07 20:21:05,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:21:05,665 INFO L168 Benchmark]: Toolchain (without parser) took 3852.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 938.1 MB in the beginning and 1.2 GB in the end (delta: -223.1 MB). Peak memory consumption was 250.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:05,665 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:21:05,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:05,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.87 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 20:21:05,666 INFO L168 Benchmark]: Boogie Preprocessor took 15.21 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 20:21:05,666 INFO L168 Benchmark]: RCFGBuilder took 268.73 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:05,666 INFO L168 Benchmark]: TraceAbstraction took 3291.60 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 849.7 MB in the end (delta: 230.5 MB). Peak memory consumption was 276.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:05,667 INFO L168 Benchmark]: Witness Printer took 34.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.7 MB). Free memory was 849.7 MB in the beginning and 1.2 GB in the end (delta: -311.4 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:21:05,668 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.21 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 268.73 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3291.60 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 849.7 MB in the end (delta: 230.5 MB). Peak memory consumption was 276.1 MB. Max. memory is 11.5 GB. * Witness Printer took 34.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.7 MB). Free memory was 849.7 MB in the beginning and 1.2 GB in the end (delta: -311.4 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 65]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 [L24] COND FALSE !(x > 0) [L27] EXPR x - 1 [L27] x = x - 1 [L29] COND FALSE !(x > 0) [L32] EXPR x - 1 [L32] x = x - 1 [L34] COND FALSE !(x > 0) [L37] EXPR x - 1 [L37] x = x - 1 [L39] COND FALSE !(x > 0) [L42] EXPR x - 1 [L42] x = x - 1 [L44] COND FALSE !(x > 0) [L47] EXPR x - 1 [L47] x = x - 1 [L49] COND FALSE !(x > 0) [L52] EXPR x - 1 [L52] x = x - 1 [L54] COND FALSE !(x > 0) [L57] EXPR x - 1 [L57] x = x - 1 [L59] COND FALSE !(x > 0) [L62] EXPR x - 1 [L62] x = x - 1 [L64] COND TRUE y<100 && z<100 [L65] y+x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 36 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 439 SDtfs, 1788 SDslu, 96 SDs, 0 SdLazy, 3784 SolverSat, 678 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 644 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 20468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! Received shutdown request...