./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/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.24-6b5699a [2019-11-26 03:00:54,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 03:00:54,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 03:00:54,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 03:00:54,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 03:00:54,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 03:00:54,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 03:00:54,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 03:00:54,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 03:00:54,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 03:00:54,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 03:00:54,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 03:00:54,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 03:00:54,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 03:00:54,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 03:00:54,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 03:00:54,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 03:00:54,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 03:00:54,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 03:00:54,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 03:00:54,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 03:00:54,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 03:00:54,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 03:00:54,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 03:00:54,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 03:00:54,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 03:00:54,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 03:00:54,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 03:00:54,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 03:00:54,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 03:00:54,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 03:00:54,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 03:00:54,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 03:00:54,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 03:00:54,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 03:00:54,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 03:00:54,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 03:00:54,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 03:00:54,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 03:00:54,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 03:00:54,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 03:00:54,633 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-11-26 03:00:54,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 03:00:54,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 03:00:54,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 03:00:54,646 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 03:00:54,647 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 03:00:54,647 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 03:00:54,647 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 03:00:54,647 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 03:00:54,647 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 03:00:54,647 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 03:00:54,648 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 03:00:54,648 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 03:00:54,648 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 03:00:54,648 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 03:00:54,648 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 03:00:54,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 03:00:54,649 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 03:00:54,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 03:00:54,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 03:00:54,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 03:00:54,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 03:00:54,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 03:00:54,650 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-26 03:00:54,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 03:00:54,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 03:00:54,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 03:00:54,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 03:00:54,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 03:00:54,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:00:54,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 03:00:54,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 03:00:54,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 03:00:54,652 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 03:00:54,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 03:00:54,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 03:00:54,653 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 03:00:54,653 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_d642f483-2894-46dd-ade6-78e4545c300c/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-11-26 03:00:54,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 03:00:54,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 03:00:54,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 03:00:54,806 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 03:00:54,807 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 03:00:54,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2019-11-26 03:00:54,870 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/data/33dd4d4ae/78cb1352098e409e932e1e0ebd08877d/FLAG254e8464f [2019-11-26 03:00:55,297 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 03:00:55,298 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2019-11-26 03:00:55,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/data/33dd4d4ae/78cb1352098e409e932e1e0ebd08877d/FLAG254e8464f [2019-11-26 03:00:55,690 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/data/33dd4d4ae/78cb1352098e409e932e1e0ebd08877d [2019-11-26 03:00:55,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 03:00:55,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 03:00:55,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 03:00:55,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 03:00:55,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 03:00:55,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:55,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28508500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55, skipping insertion in model container [2019-11-26 03:00:55,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:55,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 03:00:55,731 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 03:00:55,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:00:55,937 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 03:00:55,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:00:55,971 INFO L205 MainTranslator]: Completed translation [2019-11-26 03:00:55,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55 WrapperNode [2019-11-26 03:00:55,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 03:00:55,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 03:00:55,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 03:00:55,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 03:00:55,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:55,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:56,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 03:00:56,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 03:00:56,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 03:00:56,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 03:00:56,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:56,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:56,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:56,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:56,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:56,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:56,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... [2019-11-26 03:00:56,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 03:00:56,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 03:00:56,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 03:00:56,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 03:00:56,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:00:56,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 03:00:56,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 03:00:56,562 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 03:00:56,562 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-26 03:00:56,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:00:56 BoogieIcfgContainer [2019-11-26 03:00:56,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 03:00:56,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 03:00:56,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 03:00:56,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 03:00:56,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 03:00:55" (1/3) ... [2019-11-26 03:00:56,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8095ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:00:56, skipping insertion in model container [2019-11-26 03:00:56,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:55" (2/3) ... [2019-11-26 03:00:56,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8095ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:00:56, skipping insertion in model container [2019-11-26 03:00:56,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:00:56" (3/3) ... [2019-11-26 03:00:56,572 INFO L109 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-1.c [2019-11-26 03:00:56,582 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 03:00:56,588 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-11-26 03:00:56,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-11-26 03:00:56,625 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 03:00:56,625 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 03:00:56,625 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 03:00:56,625 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 03:00:56,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 03:00:56,626 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 03:00:56,626 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 03:00:56,626 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 03:00:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-11-26 03:00:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 03:00:56,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:56,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 03:00:56,655 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-11-26 03:00:56,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash 172532, now seen corresponding path program 1 times [2019-11-26 03:00:56,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:56,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336944252] [2019-11-26 03:00:56,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:56,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336944252] [2019-11-26 03:00:56,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:56,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:56,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676197706] [2019-11-26 03:00:56,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:00:56,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:00:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:00:56,821 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-11-26 03:00:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:57,099 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2019-11-26 03:00:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:00:57,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-26 03:00:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:57,113 INFO L225 Difference]: With dead ends: 162 [2019-11-26 03:00:57,113 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 03:00:57,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:00:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 03:00:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-11-26 03:00:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-26 03:00:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-11-26 03:00:57,168 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 3 [2019-11-26 03:00:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:57,169 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-11-26 03:00:57,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:00:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-11-26 03:00:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 03:00:57,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:57,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 03:00:57,171 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-11-26 03:00:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash 172340, now seen corresponding path program 1 times [2019-11-26 03:00:57,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:57,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825485641] [2019-11-26 03:00:57,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:57,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825485641] [2019-11-26 03:00:57,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:57,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-26 03:00:57,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515683341] [2019-11-26 03:00:57,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:00:57,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:00:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:00:57,212 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 3 states. [2019-11-26 03:00:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:57,384 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2019-11-26 03:00:57,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:00:57,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-26 03:00:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:57,386 INFO L225 Difference]: With dead ends: 90 [2019-11-26 03:00:57,386 INFO L226 Difference]: Without dead ends: 89 [2019-11-26 03:00:57,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:00:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-26 03:00:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-11-26 03:00:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 03:00:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-11-26 03:00:57,399 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 3 [2019-11-26 03:00:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:57,399 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-11-26 03:00:57,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:00:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-11-26 03:00:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 03:00:57,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:57,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 03:00:57,402 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-11-26 03:00:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:57,403 INFO L82 PathProgramCache]: Analyzing trace with hash 5348542, now seen corresponding path program 1 times [2019-11-26 03:00:57,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:57,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445894891] [2019-11-26 03:00:57,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:57,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445894891] [2019-11-26 03:00:57,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:57,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-26 03:00:57,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242020388] [2019-11-26 03:00:57,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:00:57,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:57,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:00:57,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:00:57,434 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 3 states. [2019-11-26 03:00:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:57,689 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-11-26 03:00:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:00:57,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-26 03:00:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:57,690 INFO L225 Difference]: With dead ends: 110 [2019-11-26 03:00:57,690 INFO L226 Difference]: Without dead ends: 94 [2019-11-26 03:00:57,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:00:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-26 03:00:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-11-26 03:00:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-26 03:00:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2019-11-26 03:00:57,698 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 4 [2019-11-26 03:00:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:57,699 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2019-11-26 03:00:57,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:00:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2019-11-26 03:00:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 03:00:57,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:57,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 03:00:57,700 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-11-26 03:00:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash 839257658, now seen corresponding path program 1 times [2019-11-26 03:00:57,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:57,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118903537] [2019-11-26 03:00:57,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:57,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118903537] [2019-11-26 03:00:57,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:57,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:57,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676326577] [2019-11-26 03:00:57,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:57,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:57,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:57,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:57,737 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 4 states. [2019-11-26 03:00:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:57,889 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-11-26 03:00:57,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:57,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-26 03:00:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:57,891 INFO L225 Difference]: With dead ends: 94 [2019-11-26 03:00:57,891 INFO L226 Difference]: Without dead ends: 93 [2019-11-26 03:00:57,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-26 03:00:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-11-26 03:00:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-26 03:00:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2019-11-26 03:00:57,899 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2019-11-26 03:00:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:57,899 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2019-11-26 03:00:57,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2019-11-26 03:00:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 03:00:57,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:57,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:57,901 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-11-26 03:00:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash 424684416, now seen corresponding path program 1 times [2019-11-26 03:00:57,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:57,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240190102] [2019-11-26 03:00:57,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:57,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240190102] [2019-11-26 03:00:57,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:57,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:00:57,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332363857] [2019-11-26 03:00:57,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:57,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:57,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:57,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:57,945 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 4 states. [2019-11-26 03:00:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:58,195 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2019-11-26 03:00:58,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:58,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 03:00:58,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:58,197 INFO L225 Difference]: With dead ends: 126 [2019-11-26 03:00:58,197 INFO L226 Difference]: Without dead ends: 119 [2019-11-26 03:00:58,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-26 03:00:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2019-11-26 03:00:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-26 03:00:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-26 03:00:58,205 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 7 [2019-11-26 03:00:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:58,209 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-26 03:00:58,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-11-26 03:00:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 03:00:58,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:58,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:58,211 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-11-26 03:00:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1320317378, now seen corresponding path program 1 times [2019-11-26 03:00:58,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:58,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13059262] [2019-11-26 03:00:58,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:58,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13059262] [2019-11-26 03:00:58,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:58,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:00:58,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433159118] [2019-11-26 03:00:58,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:00:58,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:58,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:00:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:00:58,275 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 5 states. [2019-11-26 03:00:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:58,439 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-26 03:00:58,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:00:58,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-26 03:00:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:58,440 INFO L225 Difference]: With dead ends: 108 [2019-11-26 03:00:58,440 INFO L226 Difference]: Without dead ends: 107 [2019-11-26 03:00:58,440 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-11-26 03:00:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-26 03:00:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2019-11-26 03:00:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 03:00:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-26 03:00:58,448 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 9 [2019-11-26 03:00:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:58,448 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-26 03:00:58,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:00:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-26 03:00:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:00:58,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:58,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:58,450 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-11-26 03:00:58,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1200143412, now seen corresponding path program 1 times [2019-11-26 03:00:58,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:58,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207119406] [2019-11-26 03:00:58,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:58,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207119406] [2019-11-26 03:00:58,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:58,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:00:58,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998170980] [2019-11-26 03:00:58,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:00:58,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:58,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:00:58,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:00:58,490 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 5 states. [2019-11-26 03:00:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:58,750 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2019-11-26 03:00:58,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:00:58,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-26 03:00:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:58,751 INFO L225 Difference]: With dead ends: 147 [2019-11-26 03:00:58,752 INFO L226 Difference]: Without dead ends: 141 [2019-11-26 03:00:58,752 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-11-26 03:00:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-26 03:00:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 107. [2019-11-26 03:00:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-26 03:00:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-26 03:00:58,762 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-26 03:00:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:58,762 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-26 03:00:58,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:00:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-26 03:00:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 03:00:58,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:58,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:58,766 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-11-26 03:00:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash 264583048, now seen corresponding path program 1 times [2019-11-26 03:00:58,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:58,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180629316] [2019-11-26 03:00:58,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:58,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180629316] [2019-11-26 03:00:58,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:58,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:00:58,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485035206] [2019-11-26 03:00:58,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 03:00:58,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:58,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 03:00:58,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:00:58,831 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 6 states. [2019-11-26 03:00:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:58,993 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-26 03:00:58,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 03:00:58,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-26 03:00:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:58,995 INFO L225 Difference]: With dead ends: 116 [2019-11-26 03:00:58,995 INFO L226 Difference]: Without dead ends: 115 [2019-11-26 03:00:58,995 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-11-26 03:00:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-26 03:00:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2019-11-26 03:00:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-26 03:00:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-11-26 03:00:59,001 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 12 [2019-11-26 03:00:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:59,002 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-11-26 03:00:59,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 03:00:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-11-26 03:00:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 03:00:59,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:59,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:59,003 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-11-26 03:00:59,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2130439758, now seen corresponding path program 1 times [2019-11-26 03:00:59,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:59,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028648057] [2019-11-26 03:00:59,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:59,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028648057] [2019-11-26 03:00:59,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:59,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:00:59,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872070580] [2019-11-26 03:00:59,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 03:00:59,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:59,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 03:00:59,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:00:59,071 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 6 states. [2019-11-26 03:00:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:59,331 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2019-11-26 03:00:59,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 03:00:59,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-26 03:00:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:59,333 INFO L225 Difference]: With dead ends: 165 [2019-11-26 03:00:59,333 INFO L226 Difference]: Without dead ends: 160 [2019-11-26 03:00:59,333 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-11-26 03:00:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-26 03:00:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 109. [2019-11-26 03:00:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-26 03:00:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-26 03:00:59,338 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 13 [2019-11-26 03:00:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:59,338 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-26 03:00:59,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 03:00:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-26 03:00:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 03:00:59,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:59,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:59,340 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-11-26 03:00:59,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:59,340 INFO L82 PathProgramCache]: Analyzing trace with hash 928680528, now seen corresponding path program 1 times [2019-11-26 03:00:59,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:59,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836917570] [2019-11-26 03:00:59,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:59,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836917570] [2019-11-26 03:00:59,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:59,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:00:59,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617687466] [2019-11-26 03:00:59,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 03:00:59,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 03:00:59,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:00:59,404 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 7 states. [2019-11-26 03:00:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:59,552 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-11-26 03:00:59,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 03:00:59,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-26 03:00:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:59,553 INFO L225 Difference]: With dead ends: 118 [2019-11-26 03:00:59,553 INFO L226 Difference]: Without dead ends: 117 [2019-11-26 03:00:59,553 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-11-26 03:00:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-26 03:00:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-11-26 03:00:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-26 03:00:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-26 03:00:59,557 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 15 [2019-11-26 03:00:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:59,558 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-26 03:00:59,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 03:00:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-26 03:00:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 03:00:59,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:59,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:59,559 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-11-26 03:00:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1199198938, now seen corresponding path program 1 times [2019-11-26 03:00:59,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:59,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632130594] [2019-11-26 03:00:59,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:59,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-11-26 03:00:59,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632130594] [2019-11-26 03:00:59,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:59,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:00:59,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308698046] [2019-11-26 03:00:59,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 03:00:59,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:59,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 03:00:59,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:00:59,640 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 7 states. [2019-11-26 03:00:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:59,891 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-11-26 03:00:59,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 03:00:59,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-26 03:00:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:59,893 INFO L225 Difference]: With dead ends: 180 [2019-11-26 03:00:59,893 INFO L226 Difference]: Without dead ends: 176 [2019-11-26 03:00:59,894 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-11-26 03:00:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-26 03:00:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 105. [2019-11-26 03:00:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-26 03:00:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-11-26 03:00:59,897 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 16 [2019-11-26 03:00:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:59,898 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-11-26 03:00:59,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 03:00:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-11-26 03:00:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 03:00:59,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:59,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:59,899 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-11-26 03:00:59,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:59,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1857611562, now seen corresponding path program 1 times [2019-11-26 03:00:59,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:00:59,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325955850] [2019-11-26 03:00:59,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:00:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:00:59,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325955850] [2019-11-26 03:00:59,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:59,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 03:00:59,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373653925] [2019-11-26 03:00:59,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 03:00:59,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:00:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 03:00:59,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-26 03:00:59,988 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 8 states. [2019-11-26 03:01:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:00,145 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-26 03:01:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 03:01:00,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-26 03:01:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:00,147 INFO L225 Difference]: With dead ends: 114 [2019-11-26 03:01:00,147 INFO L226 Difference]: Without dead ends: 113 [2019-11-26 03:01:00,147 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-11-26 03:01:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-26 03:01:00,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2019-11-26 03:01:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-26 03:01:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-26 03:01:00,150 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-26 03:01:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:00,151 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-26 03:01:00,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 03:01:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-26 03:01:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 03:01:00,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:00,152 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-11-26 03:01:00,152 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-11-26 03:01:00,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash -202290916, now seen corresponding path program 1 times [2019-11-26 03:01:00,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:00,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734154966] [2019-11-26 03:01:00,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:00,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734154966] [2019-11-26 03:01:00,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:00,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 03:01:00,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097662906] [2019-11-26 03:01:00,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 03:01:00,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:00,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 03:01:00,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-26 03:01:00,245 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 8 states. [2019-11-26 03:01:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:00,551 INFO L93 Difference]: Finished difference Result 192 states and 200 transitions. [2019-11-26 03:01:00,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 03:01:00,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-26 03:01:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:00,553 INFO L225 Difference]: With dead ends: 192 [2019-11-26 03:01:00,553 INFO L226 Difference]: Without dead ends: 189 [2019-11-26 03:01:00,553 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-11-26 03:01:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-26 03:01:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 95. [2019-11-26 03:01:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-26 03:01:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2019-11-26 03:01:00,557 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 19 [2019-11-26 03:01:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:00,557 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2019-11-26 03:01:00,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 03:01:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2019-11-26 03:01:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 03:01:00,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:00,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:00,559 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-11-26 03:01:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:00,559 INFO L82 PathProgramCache]: Analyzing trace with hash 547678942, now seen corresponding path program 1 times [2019-11-26 03:01:00,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:00,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058956398] [2019-11-26 03:01:00,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:00,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058956398] [2019-11-26 03:01:00,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:00,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 03:01:00,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245954575] [2019-11-26 03:01:00,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 03:01:00,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:00,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 03:01:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-26 03:01:00,653 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 9 states. [2019-11-26 03:01:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:00,785 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-26 03:01:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 03:01:00,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-26 03:01:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:00,786 INFO L225 Difference]: With dead ends: 104 [2019-11-26 03:01:00,786 INFO L226 Difference]: Without dead ends: 103 [2019-11-26 03:01:00,786 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-11-26 03:01:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-26 03:01:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2019-11-26 03:01:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-26 03:01:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-26 03:01:00,789 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 21 [2019-11-26 03:01:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:00,789 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-26 03:01:00,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 03:01:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-26 03:01:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 03:01:00,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:00,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:00,790 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-11-26 03:01:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:00,791 INFO L82 PathProgramCache]: Analyzing trace with hash -609433112, now seen corresponding path program 1 times [2019-11-26 03:01:00,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:00,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455703684] [2019-11-26 03:01:00,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:00,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455703684] [2019-11-26 03:01:00,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:00,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 03:01:00,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000187818] [2019-11-26 03:01:00,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 03:01:00,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 03:01:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-26 03:01:00,854 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 9 states. [2019-11-26 03:01:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:01,140 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2019-11-26 03:01:01,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 03:01:01,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-26 03:01:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:01,142 INFO L225 Difference]: With dead ends: 201 [2019-11-26 03:01:01,142 INFO L226 Difference]: Without dead ends: 199 [2019-11-26 03:01:01,143 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-11-26 03:01:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-26 03:01:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 79. [2019-11-26 03:01:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-26 03:01:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-11-26 03:01:01,146 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 22 [2019-11-26 03:01:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:01,147 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-11-26 03:01:01,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 03:01:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-11-26 03:01:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 03:01:01,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:01,148 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-11-26 03:01:01,148 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-11-26 03:01:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash -677268956, now seen corresponding path program 1 times [2019-11-26 03:01:01,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:01,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916567534] [2019-11-26 03:01:01,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:01,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916567534] [2019-11-26 03:01:01,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:01,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 03:01:01,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237663480] [2019-11-26 03:01:01,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 03:01:01,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:01,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 03:01:01,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-26 03:01:01,250 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 10 states. [2019-11-26 03:01:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:01,424 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2019-11-26 03:01:01,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 03:01:01,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-26 03:01:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:01,426 INFO L225 Difference]: With dead ends: 88 [2019-11-26 03:01:01,426 INFO L226 Difference]: Without dead ends: 87 [2019-11-26 03:01:01,426 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-11-26 03:01:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-26 03:01:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2019-11-26 03:01:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 03:01:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-11-26 03:01:01,429 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 24 [2019-11-26 03:01:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:01,432 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-11-26 03:01:01,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 03:01:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-11-26 03:01:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 03:01:01,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:01,434 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-11-26 03:01:01,434 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-11-26 03:01:01,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash -794936342, now seen corresponding path program 1 times [2019-11-26 03:01:01,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:01,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686028416] [2019-11-26 03:01:01,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:01,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686028416] [2019-11-26 03:01:01,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:01,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 03:01:01,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25663390] [2019-11-26 03:01:01,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 03:01:01,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:01,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 03:01:01,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-26 03:01:01,514 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 10 states. [2019-11-26 03:01:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:01,843 INFO L93 Difference]: Finished difference Result 207 states and 215 transitions. [2019-11-26 03:01:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 03:01:01,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-26 03:01:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:01,844 INFO L225 Difference]: With dead ends: 207 [2019-11-26 03:01:01,844 INFO L226 Difference]: Without dead ends: 206 [2019-11-26 03:01:01,845 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-11-26 03:01:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-26 03:01:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 57. [2019-11-26 03:01:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-26 03:01:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-11-26 03:01:01,848 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 25 [2019-11-26 03:01:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:01,848 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-11-26 03:01:01,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 03:01:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-11-26 03:01:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 03:01:01,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:01,849 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-11-26 03:01:01,849 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-11-26 03:01:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 570359052, now seen corresponding path program 1 times [2019-11-26 03:01:01,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:01,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914339899] [2019-11-26 03:01:01,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:01,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914339899] [2019-11-26 03:01:01,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:01,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-26 03:01:01,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897594083] [2019-11-26 03:01:01,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 03:01:01,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 03:01:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-26 03:01:01,941 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 13 states. [2019-11-26 03:01:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:02,139 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-11-26 03:01:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 03:01:02,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-11-26 03:01:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:02,140 INFO L225 Difference]: With dead ends: 87 [2019-11-26 03:01:02,140 INFO L226 Difference]: Without dead ends: 86 [2019-11-26 03:01:02,141 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-11-26 03:01:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-26 03:01:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2019-11-26 03:01:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-26 03:01:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-11-26 03:01:02,144 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 27 [2019-11-26 03:01:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:02,144 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-11-26 03:01:02,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 03:01:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-11-26 03:01:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 03:01:02,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:02,145 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-11-26 03:01:02,145 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-11-26 03:01:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 16545356, now seen corresponding path program 1 times [2019-11-26 03:01:02,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:02,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595329767] [2019-11-26 03:01:02,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:02,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595329767] [2019-11-26 03:01:02,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:02,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:02,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324693886] [2019-11-26 03:01:02,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:02,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:02,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:02,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:02,168 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 4 states. [2019-11-26 03:01:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:02,257 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-11-26 03:01:02,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:02,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-26 03:01:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:02,258 INFO L225 Difference]: With dead ends: 94 [2019-11-26 03:01:02,258 INFO L226 Difference]: Without dead ends: 65 [2019-11-26 03:01:02,258 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-11-26 03:01:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-26 03:01:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-11-26 03:01:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-26 03:01:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-26 03:01:02,261 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 27 [2019-11-26 03:01:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:02,261 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-26 03:01:02,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-26 03:01:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 03:01:02,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:02,262 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-11-26 03:01:02,262 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-11-26 03:01:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1237029900, now seen corresponding path program 1 times [2019-11-26 03:01:02,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:02,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980359792] [2019-11-26 03:01:02,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:01:02,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980359792] [2019-11-26 03:01:02,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:02,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 03:01:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139957588] [2019-11-26 03:01:02,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 03:01:02,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 03:01:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-26 03:01:02,345 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 12 states. [2019-11-26 03:01:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:02,565 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-11-26 03:01:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 03:01:02,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-26 03:01:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:02,566 INFO L225 Difference]: With dead ends: 65 [2019-11-26 03:01:02,566 INFO L226 Difference]: Without dead ends: 64 [2019-11-26 03:01:02,566 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-11-26 03:01:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-26 03:01:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2019-11-26 03:01:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-26 03:01:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-26 03:01:02,568 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 27 [2019-11-26 03:01:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:02,569 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-26 03:01:02,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 03:01:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-26 03:01:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 03:01:02,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:02,569 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-11-26 03:01:02,570 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-11-26 03:01:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash 501261589, now seen corresponding path program 1 times [2019-11-26 03:01:02,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:02,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748438239] [2019-11-26 03:01:02,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 03:01:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 03:01:02,602 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 03:01:02,603 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 03:01:02,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 03:01:02 BoogieIcfgContainer [2019-11-26 03:01:02,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 03:01:02,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 03:01:02,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 03:01:02,625 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 03:01:02,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:00:56" (3/4) ... [2019-11-26 03:01:02,628 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 03:01:02,678 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d642f483-2894-46dd-ade6-78e4545c300c/bin/utaipan/witness.graphml [2019-11-26 03:01:02,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 03:01:02,680 INFO L168 Benchmark]: Toolchain (without parser) took 6980.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 950.1 MB in the beginning and 846.7 MB in the end (delta: 103.5 MB). Peak memory consumption was 258.1 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:02,686 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:01:02,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:02,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.86 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-11-26 03:01:02,687 INFO L168 Benchmark]: Boogie Preprocessor took 22.49 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-11-26 03:01:02,688 INFO L168 Benchmark]: RCFGBuilder took 533.04 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.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:02,688 INFO L168 Benchmark]: TraceAbstraction took 6059.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 39.3 MB). Free memory was 1.1 GB in the beginning and 848.4 MB in the end (delta: 232.7 MB). Peak memory consumption was 272.0 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:02,689 INFO L168 Benchmark]: Witness Printer took 53.84 ms. Allocated memory is still 1.2 GB. Free memory was 848.4 MB in the beginning and 846.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:02,691 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.86 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 22.49 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 533.04 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.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6059.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 39.3 MB). Free memory was 1.1 GB in the beginning and 848.4 MB in the end (delta: 232.7 MB). Peak memory consumption was 272.0 MB. Max. memory is 11.5 GB. * Witness Printer took 53.84 ms. Allocated memory is still 1.2 GB. Free memory was 848.4 MB in the beginning and 846.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 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: 5.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 439 SDtfs, 1788 SDslu, 96 SDs, 0 SdLazy, 3784 SolverSat, 678 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 644 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s 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...