./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96aededabe895f84f71d6d614ed1af512bf7353b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:20:55,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:20:55,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:20:55,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:20:55,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:20:55,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:20:55,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:20:55,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:20:55,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:20:55,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:20:55,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:20:55,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:20:55,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:20:55,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:20:55,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:20:55,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:20:55,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:20:55,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:20:55,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:20:55,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:20:55,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:20:55,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:20:55,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:20:55,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:20:55,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:20:55,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:20:55,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:20:55,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:20:55,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:20:55,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:20:55,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:20:55,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:20:55,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:20:55,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:20:55,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:20:55,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:20:55,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:20:55,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:20:55,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:20:55,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:20:55,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:20:55,998 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-10-22 11:20:56,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:20:56,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:20:56,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:20:56,010 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:20:56,010 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:20:56,010 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:20:56,010 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:20:56,011 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:20:56,011 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:20:56,011 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:20:56,011 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:20:56,011 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:20:56,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:20:56,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:20:56,012 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:20:56,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:20:56,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:20:56,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:20:56,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:20:56,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:20:56,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:20:56,013 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 11:20:56,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:20:56,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:20:56,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:20:56,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:20:56,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:20:56,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:20:56,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:20:56,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:56,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:20:56,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:20:56,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:20:56,015 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:20:56,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:20:56,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:20:56,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:20:56,016 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/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-10-22 11:20:56,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:20:56,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:20:56,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:20:56,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:20:56,054 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:20:56,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 11:20:56,103 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/data/0d9130ba6/d47f25e142314ea2ac2f75cafddeec58/FLAG4d661d9a1 [2019-10-22 11:20:56,538 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:20:56,539 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 11:20:56,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/data/0d9130ba6/d47f25e142314ea2ac2f75cafddeec58/FLAG4d661d9a1 [2019-10-22 11:20:56,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/data/0d9130ba6/d47f25e142314ea2ac2f75cafddeec58 [2019-10-22 11:20:56,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:20:56,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:20:56,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:56,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:20:56,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:20:56,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@483fd736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:56, skipping insertion in model container [2019-10-22 11:20:56,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:56" (1/1) ... [2019-10-22 11:20:56,593 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:20:56,636 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:20:56,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:56,964 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:20:57,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:57,049 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:20:57,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57 WrapperNode [2019-10-22 11:20:57,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:57,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:57,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:20:57,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:20:57,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:57,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:20:57,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:20:57,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:20:57,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:20:57,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:20:57,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:20:57,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:20:57,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/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-10-22 11:20:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:20:57,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:20:57,299 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:20:57,903 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 11:20:57,903 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 11:20:57,904 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:20:57,904 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:20:57,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:57 BoogieIcfgContainer [2019-10-22 11:20:57,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:20:57,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:20:57,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:20:57,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:20:57,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:20:56" (1/3) ... [2019-10-22 11:20:57,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc143c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (2/3) ... [2019-10-22 11:20:57,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc143c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:57" (3/3) ... [2019-10-22 11:20:57,912 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-10-22 11:20:57,921 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:20:57,928 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-10-22 11:20:57,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-10-22 11:20:57,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:20:57,959 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:20:57,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:20:57,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:20:57,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:20:57,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:20:57,960 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:20:57,960 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:20:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-22 11:20:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:20:57,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:57,982 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:57,984 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:20:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:57,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-10-22 11:20:57,997 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:57,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130523946] [2019-10-22 11:20:57,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:57,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130523946] [2019-10-22 11:20:58,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:58,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509172491] [2019-10-22 11:20:58,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,176 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-10-22 11:20:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,377 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-10-22 11:20:58,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 11:20:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,394 INFO L225 Difference]: With dead ends: 323 [2019-10-22 11:20:58,394 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 11:20:58,399 INFO L600 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-10-22 11:20:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 11:20:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-10-22 11:20:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-22 11:20:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-10-22 11:20:58,444 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-10-22 11:20:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,445 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-10-22 11:20:58,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-10-22 11:20:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:20:58,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,446 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,446 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:20:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-10-22 11:20:58,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503950499] [2019-10-22 11:20:58,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503950499] [2019-10-22 11:20:58,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:58,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772262442] [2019-10-22 11:20:58,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,496 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-10-22 11:20:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,648 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-10-22 11:20:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:20:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,649 INFO L225 Difference]: With dead ends: 313 [2019-10-22 11:20:58,650 INFO L226 Difference]: Without dead ends: 165 [2019-10-22 11:20:58,651 INFO L600 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-10-22 11:20:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-22 11:20:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-10-22 11:20:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 11:20:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-10-22 11:20:58,662 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-10-22 11:20:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,663 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-10-22 11:20:58,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-10-22 11:20:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:20:58,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,664 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,664 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:20:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-10-22 11:20:58,664 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810332811] [2019-10-22 11:20:58,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810332811] [2019-10-22 11:20:58,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:58,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706901601] [2019-10-22 11:20:58,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,700 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-10-22 11:20:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,839 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-10-22 11:20:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 11:20:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,841 INFO L225 Difference]: With dead ends: 315 [2019-10-22 11:20:58,842 INFO L226 Difference]: Without dead ends: 166 [2019-10-22 11:20:58,842 INFO L600 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-10-22 11:20:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-22 11:20:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-10-22 11:20:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-22 11:20:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-10-22 11:20:58,862 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-10-22 11:20:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,862 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-10-22 11:20:58,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-10-22 11:20:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:20:58,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,864 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,864 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:20:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-10-22 11:20:58,865 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18423463] [2019-10-22 11:20:58,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18423463] [2019-10-22 11:20:58,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:58,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607541024] [2019-10-22 11:20:58,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,936 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-10-22 11:20:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,093 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-10-22 11:20:59,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:20:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,095 INFO L225 Difference]: With dead ends: 317 [2019-10-22 11:20:59,098 INFO L226 Difference]: Without dead ends: 167 [2019-10-22 11:20:59,099 INFO L600 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-10-22 11:20:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-22 11:20:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-10-22 11:20:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-22 11:20:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-10-22 11:20:59,112 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-10-22 11:20:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,113 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-10-22 11:20:59,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-10-22 11:20:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:20:59,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,114 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:20:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-10-22 11:20:59,117 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640497249] [2019-10-22 11:20:59,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640497249] [2019-10-22 11:20:59,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:59,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032261099] [2019-10-22 11:20:59,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,181 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-10-22 11:20:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,341 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-10-22 11:20:59,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 11:20:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,343 INFO L225 Difference]: With dead ends: 319 [2019-10-22 11:20:59,343 INFO L226 Difference]: Without dead ends: 168 [2019-10-22 11:20:59,344 INFO L600 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-10-22 11:20:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-22 11:20:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-10-22 11:20:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-22 11:20:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-10-22 11:20:59,365 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-10-22 11:20:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,365 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-10-22 11:20:59,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-10-22 11:20:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:20:59,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,373 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,373 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:20:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-10-22 11:20:59,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122677978] [2019-10-22 11:20:59,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,406 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 11:20:59,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603740605] [2019-10-22 11:20:59,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:20:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:20:59,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:20:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,508 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:20:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122677978] [2019-10-22 11:20:59,522 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 11:20:59,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603740605] [2019-10-22 11:20:59,522 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-10-22 11:20:59,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554082691] [2019-10-22 11:20:59,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:20:59,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:20:59,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:59,524 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 4 states. [2019-10-22 11:20:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,584 INFO L93 Difference]: Finished difference Result 599 states and 887 transitions. [2019-10-22 11:20:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:20:59,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-22 11:20:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,587 INFO L225 Difference]: With dead ends: 599 [2019-10-22 11:20:59,587 INFO L226 Difference]: Without dead ends: 447 [2019-10-22 11:20:59,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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-10-22 11:20:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-22 11:20:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 439. [2019-10-22 11:20:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-22 11:20:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 660 transitions. [2019-10-22 11:20:59,608 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 660 transitions. Word has length 39 [2019-10-22 11:20:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,609 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 660 transitions. [2019-10-22 11:20:59,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:20:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 660 transitions. [2019-10-22 11:20:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:20:59,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,611 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:20:59,812 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:20:59,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-10-22 11:20:59,813 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342104494] [2019-10-22 11:20:59,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342104494] [2019-10-22 11:20:59,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:59,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968108811] [2019-10-22 11:20:59,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,871 INFO L87 Difference]: Start difference. First operand 439 states and 660 transitions. Second operand 3 states. [2019-10-22 11:21:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:00,044 INFO L93 Difference]: Finished difference Result 964 states and 1468 transitions. [2019-10-22 11:21:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:00,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 11:21:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:00,047 INFO L225 Difference]: With dead ends: 964 [2019-10-22 11:21:00,047 INFO L226 Difference]: Without dead ends: 532 [2019-10-22 11:21:00,048 INFO L600 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-10-22 11:21:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-22 11:21:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2019-10-22 11:21:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-10-22 11:21:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 816 transitions. [2019-10-22 11:21:00,078 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 816 transitions. Word has length 44 [2019-10-22 11:21:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:00,078 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 816 transitions. [2019-10-22 11:21:00,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 816 transitions. [2019-10-22 11:21:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:21:00,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:00,081 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:00,081 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:00,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-10-22 11:21:00,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:00,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148583160] [2019-10-22 11:21:00,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 11:21:00,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148583160] [2019-10-22 11:21:00,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:00,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:00,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994546355] [2019-10-22 11:21:00,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:00,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:00,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:00,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:00,141 INFO L87 Difference]: Start difference. First operand 532 states and 816 transitions. Second operand 3 states. [2019-10-22 11:21:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:00,316 INFO L93 Difference]: Finished difference Result 1111 states and 1696 transitions. [2019-10-22 11:21:00,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:00,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 11:21:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:00,319 INFO L225 Difference]: With dead ends: 1111 [2019-10-22 11:21:00,319 INFO L226 Difference]: Without dead ends: 586 [2019-10-22 11:21:00,320 INFO L600 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-10-22 11:21:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-22 11:21:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-10-22 11:21:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-22 11:21:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 879 transitions. [2019-10-22 11:21:00,344 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 879 transitions. Word has length 56 [2019-10-22 11:21:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:00,344 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 879 transitions. [2019-10-22 11:21:00,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 879 transitions. [2019-10-22 11:21:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 11:21:00,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:00,349 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:00,350 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:00,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-10-22 11:21:00,353 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:00,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039704382] [2019-10-22 11:21:00,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 11:21:00,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039704382] [2019-10-22 11:21:00,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:00,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:00,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853935641] [2019-10-22 11:21:00,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:00,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:00,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:00,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:00,391 INFO L87 Difference]: Start difference. First operand 580 states and 879 transitions. Second operand 3 states. [2019-10-22 11:21:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:00,539 INFO L93 Difference]: Finished difference Result 1162 states and 1759 transitions. [2019-10-22 11:21:00,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:00,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-22 11:21:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:00,542 INFO L225 Difference]: With dead ends: 1162 [2019-10-22 11:21:00,542 INFO L226 Difference]: Without dead ends: 589 [2019-10-22 11:21:00,543 INFO L600 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-10-22 11:21:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-22 11:21:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-10-22 11:21:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-22 11:21:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 879 transitions. [2019-10-22 11:21:00,565 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 879 transitions. Word has length 57 [2019-10-22 11:21:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:00,566 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 879 transitions. [2019-10-22 11:21:00,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 879 transitions. [2019-10-22 11:21:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 11:21:00,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:00,569 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:00,569 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-10-22 11:21:00,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:00,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780791845] [2019-10-22 11:21:00,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 11:21:00,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780791845] [2019-10-22 11:21:00,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:00,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:00,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282692549] [2019-10-22 11:21:00,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:00,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:00,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:00,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:00,609 INFO L87 Difference]: Start difference. First operand 583 states and 879 transitions. Second operand 3 states. [2019-10-22 11:21:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:00,768 INFO L93 Difference]: Finished difference Result 1291 states and 1972 transitions. [2019-10-22 11:21:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:00,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-22 11:21:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:00,772 INFO L225 Difference]: With dead ends: 1291 [2019-10-22 11:21:00,772 INFO L226 Difference]: Without dead ends: 715 [2019-10-22 11:21:00,773 INFO L600 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-10-22 11:21:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-10-22 11:21:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-10-22 11:21:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-10-22 11:21:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1092 transitions. [2019-10-22 11:21:00,798 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1092 transitions. Word has length 70 [2019-10-22 11:21:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:00,798 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1092 transitions. [2019-10-22 11:21:00,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1092 transitions. [2019-10-22 11:21:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 11:21:00,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:00,801 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-22 11:21:00,801 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:00,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-10-22 11:21:00,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:00,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613852900] [2019-10-22 11:21:00,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 11:21:00,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613852900] [2019-10-22 11:21:00,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:00,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:00,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123462837] [2019-10-22 11:21:00,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:00,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:00,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:00,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:00,842 INFO L87 Difference]: Start difference. First operand 709 states and 1092 transitions. Second operand 3 states. [2019-10-22 11:21:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:01,002 INFO L93 Difference]: Finished difference Result 1513 states and 2338 transitions. [2019-10-22 11:21:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:01,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 11:21:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:01,006 INFO L225 Difference]: With dead ends: 1513 [2019-10-22 11:21:01,006 INFO L226 Difference]: Without dead ends: 811 [2019-10-22 11:21:01,009 INFO L600 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-10-22 11:21:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-10-22 11:21:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-10-22 11:21:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-22 11:21:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1212 transitions. [2019-10-22 11:21:01,033 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1212 transitions. Word has length 71 [2019-10-22 11:21:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:01,034 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1212 transitions. [2019-10-22 11:21:01,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1212 transitions. [2019-10-22 11:21:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 11:21:01,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:01,035 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:01,035 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-10-22 11:21:01,036 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:01,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844444174] [2019-10-22 11:21:01,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 11:21:01,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844444174] [2019-10-22 11:21:01,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:01,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:01,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138725302] [2019-10-22 11:21:01,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:01,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:01,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:01,079 INFO L87 Difference]: Start difference. First operand 790 states and 1212 transitions. Second operand 3 states. [2019-10-22 11:21:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:01,254 INFO L93 Difference]: Finished difference Result 1582 states and 2425 transitions. [2019-10-22 11:21:01,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:01,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 11:21:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:01,258 INFO L225 Difference]: With dead ends: 1582 [2019-10-22 11:21:01,258 INFO L226 Difference]: Without dead ends: 799 [2019-10-22 11:21:01,259 INFO L600 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-10-22 11:21:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-22 11:21:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-10-22 11:21:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-22 11:21:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1212 transitions. [2019-10-22 11:21:01,283 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1212 transitions. Word has length 71 [2019-10-22 11:21:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:01,283 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1212 transitions. [2019-10-22 11:21:01,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1212 transitions. [2019-10-22 11:21:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-22 11:21:01,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:01,284 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-22 11:21:01,285 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:01,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:01,285 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-10-22 11:21:01,285 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:01,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387171000] [2019-10-22 11:21:01,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 11:21:01,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387171000] [2019-10-22 11:21:01,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:01,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:01,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466526015] [2019-10-22 11:21:01,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:01,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:01,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:01,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:01,325 INFO L87 Difference]: Start difference. First operand 793 states and 1212 transitions. Second operand 3 states. [2019-10-22 11:21:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:01,483 INFO L93 Difference]: Finished difference Result 1600 states and 2449 transitions. [2019-10-22 11:21:01,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:01,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-22 11:21:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:01,487 INFO L225 Difference]: With dead ends: 1600 [2019-10-22 11:21:01,487 INFO L226 Difference]: Without dead ends: 814 [2019-10-22 11:21:01,488 INFO L600 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-10-22 11:21:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-10-22 11:21:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-10-22 11:21:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-22 11:21:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1203 transitions. [2019-10-22 11:21:01,513 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1203 transitions. Word has length 72 [2019-10-22 11:21:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:01,514 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1203 transitions. [2019-10-22 11:21:01,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1203 transitions. [2019-10-22 11:21:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 11:21:01,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:01,515 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:01,516 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:01,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:01,516 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-10-22 11:21:01,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:01,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694054668] [2019-10-22 11:21:01,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 11:21:01,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694054668] [2019-10-22 11:21:01,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:01,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:01,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241561418] [2019-10-22 11:21:01,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:01,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:01,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:01,555 INFO L87 Difference]: Start difference. First operand 793 states and 1203 transitions. Second operand 3 states. [2019-10-22 11:21:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:01,736 INFO L93 Difference]: Finished difference Result 1717 states and 2614 transitions. [2019-10-22 11:21:01,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:01,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-22 11:21:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:01,740 INFO L225 Difference]: With dead ends: 1717 [2019-10-22 11:21:01,741 INFO L226 Difference]: Without dead ends: 931 [2019-10-22 11:21:01,742 INFO L600 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-10-22 11:21:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-10-22 11:21:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 922. [2019-10-22 11:21:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-10-22 11:21:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1410 transitions. [2019-10-22 11:21:01,779 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1410 transitions. Word has length 86 [2019-10-22 11:21:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:01,780 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1410 transitions. [2019-10-22 11:21:01,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1410 transitions. [2019-10-22 11:21:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 11:21:01,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:01,782 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:01,782 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-10-22 11:21:01,784 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:01,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465966581] [2019-10-22 11:21:01,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 11:21:01,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465966581] [2019-10-22 11:21:01,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:01,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:01,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369780056] [2019-10-22 11:21:01,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:01,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:01,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:01,838 INFO L87 Difference]: Start difference. First operand 922 states and 1410 transitions. Second operand 3 states. [2019-10-22 11:21:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:02,046 INFO L93 Difference]: Finished difference Result 1882 states and 2887 transitions. [2019-10-22 11:21:02,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:02,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-22 11:21:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:02,050 INFO L225 Difference]: With dead ends: 1882 [2019-10-22 11:21:02,050 INFO L226 Difference]: Without dead ends: 961 [2019-10-22 11:21:02,052 INFO L600 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-10-22 11:21:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-10-22 11:21:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 952. [2019-10-22 11:21:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-10-22 11:21:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1467 transitions. [2019-10-22 11:21:02,082 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1467 transitions. Word has length 87 [2019-10-22 11:21:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:02,083 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1467 transitions. [2019-10-22 11:21:02,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1467 transitions. [2019-10-22 11:21:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-22 11:21:02,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:02,085 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:02,085 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:02,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:02,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1427871094, now seen corresponding path program 1 times [2019-10-22 11:21:02,086 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:02,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706230302] [2019-10-22 11:21:02,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-22 11:21:02,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706230302] [2019-10-22 11:21:02,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:02,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:02,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574582188] [2019-10-22 11:21:02,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:02,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:02,121 INFO L87 Difference]: Start difference. First operand 952 states and 1467 transitions. Second operand 3 states. [2019-10-22 11:21:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:02,268 INFO L93 Difference]: Finished difference Result 1972 states and 3033 transitions. [2019-10-22 11:21:02,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:02,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-10-22 11:21:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:02,272 INFO L225 Difference]: With dead ends: 1972 [2019-10-22 11:21:02,272 INFO L226 Difference]: Without dead ends: 1027 [2019-10-22 11:21:02,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-22 11:21:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-10-22 11:21:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1015. [2019-10-22 11:21:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-22 11:21:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1545 transitions. [2019-10-22 11:21:02,304 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1545 transitions. Word has length 95 [2019-10-22 11:21:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:02,305 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1545 transitions. [2019-10-22 11:21:02,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1545 transitions. [2019-10-22 11:21:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 11:21:02,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:02,306 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:02,307 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-10-22 11:21:02,307 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:02,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795310085] [2019-10-22 11:21:02,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 11:21:02,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795310085] [2019-10-22 11:21:02,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:02,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:02,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251537740] [2019-10-22 11:21:02,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:02,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:02,346 INFO L87 Difference]: Start difference. First operand 1015 states and 1545 transitions. Second operand 3 states. [2019-10-22 11:21:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:02,505 INFO L93 Difference]: Finished difference Result 2134 states and 3256 transitions. [2019-10-22 11:21:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:02,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-22 11:21:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:02,509 INFO L225 Difference]: With dead ends: 2134 [2019-10-22 11:21:02,509 INFO L226 Difference]: Without dead ends: 1126 [2019-10-22 11:21:02,511 INFO L600 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-10-22 11:21:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-10-22 11:21:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1090. [2019-10-22 11:21:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-10-22 11:21:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1647 transitions. [2019-10-22 11:21:02,547 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1647 transitions. Word has length 97 [2019-10-22 11:21:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:02,547 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1647 transitions. [2019-10-22 11:21:02,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1647 transitions. [2019-10-22 11:21:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:21:02,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:02,549 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:02,549 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:02,549 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-10-22 11:21:02,549 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:02,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660562434] [2019-10-22 11:21:02,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 11:21:02,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660562434] [2019-10-22 11:21:02,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:02,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:02,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325501101] [2019-10-22 11:21:02,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:02,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:02,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:02,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:02,590 INFO L87 Difference]: Start difference. First operand 1090 states and 1647 transitions. Second operand 3 states. [2019-10-22 11:21:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:02,762 INFO L93 Difference]: Finished difference Result 2209 states and 3343 transitions. [2019-10-22 11:21:02,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:02,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 11:21:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:02,767 INFO L225 Difference]: With dead ends: 2209 [2019-10-22 11:21:02,767 INFO L226 Difference]: Without dead ends: 1126 [2019-10-22 11:21:02,769 INFO L600 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-10-22 11:21:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-10-22 11:21:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1090. [2019-10-22 11:21:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-10-22 11:21:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1632 transitions. [2019-10-22 11:21:02,806 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1632 transitions. Word has length 98 [2019-10-22 11:21:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:02,807 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1632 transitions. [2019-10-22 11:21:02,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1632 transitions. [2019-10-22 11:21:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 11:21:02,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:02,809 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-22 11:21:02,809 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-10-22 11:21:02,810 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:02,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448840514] [2019-10-22 11:21:02,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:02,821 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 11:21:02,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979533331] [2019-10-22 11:21:02,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:02,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:02,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:21:02,898 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:21:02,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448840514] [2019-10-22 11:21:02,918 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 11:21:02,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979533331] [2019-10-22 11:21:02,918 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:02,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:21:02,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146059677] [2019-10-22 11:21:02,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:02,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:02,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:02,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:02,920 INFO L87 Difference]: Start difference. First operand 1090 states and 1632 transitions. Second operand 4 states. [2019-10-22 11:21:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:03,234 INFO L93 Difference]: Finished difference Result 2349 states and 3505 transitions. [2019-10-22 11:21:03,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:03,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-22 11:21:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:03,239 INFO L225 Difference]: With dead ends: 2349 [2019-10-22 11:21:03,239 INFO L226 Difference]: Without dead ends: 1266 [2019-10-22 11:21:03,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 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-10-22 11:21:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2019-10-22 11:21:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1210. [2019-10-22 11:21:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-22 11:21:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1713 transitions. [2019-10-22 11:21:03,281 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1713 transitions. Word has length 116 [2019-10-22 11:21:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:03,281 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1713 transitions. [2019-10-22 11:21:03,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1713 transitions. [2019-10-22 11:21:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-22 11:21:03,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:03,283 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:03,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:03,484 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-10-22 11:21:03,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:03,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103478493] [2019-10-22 11:21:03,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 11:21:03,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103478493] [2019-10-22 11:21:03,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:03,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:03,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108925763] [2019-10-22 11:21:03,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:03,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:03,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:03,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:03,532 INFO L87 Difference]: Start difference. First operand 1210 states and 1713 transitions. Second operand 3 states. [2019-10-22 11:21:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:03,694 INFO L93 Difference]: Finished difference Result 2491 states and 3532 transitions. [2019-10-22 11:21:03,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:03,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-22 11:21:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:03,700 INFO L225 Difference]: With dead ends: 2491 [2019-10-22 11:21:03,700 INFO L226 Difference]: Without dead ends: 1288 [2019-10-22 11:21:03,702 INFO L600 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-10-22 11:21:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-10-22 11:21:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1279. [2019-10-22 11:21:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-10-22 11:21:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1803 transitions. [2019-10-22 11:21:03,756 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1803 transitions. Word has length 117 [2019-10-22 11:21:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:03,756 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 1803 transitions. [2019-10-22 11:21:03,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1803 transitions. [2019-10-22 11:21:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-22 11:21:03,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:03,758 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:03,759 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-10-22 11:21:03,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:03,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388743621] [2019-10-22 11:21:03,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 11:21:03,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388743621] [2019-10-22 11:21:03,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:03,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:03,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890783204] [2019-10-22 11:21:03,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:03,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:03,804 INFO L87 Difference]: Start difference. First operand 1279 states and 1803 transitions. Second operand 3 states. [2019-10-22 11:21:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:03,999 INFO L93 Difference]: Finished difference Result 2560 states and 3607 transitions. [2019-10-22 11:21:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-10-22 11:21:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,004 INFO L225 Difference]: With dead ends: 2560 [2019-10-22 11:21:04,004 INFO L226 Difference]: Without dead ends: 1288 [2019-10-22 11:21:04,007 INFO L600 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-10-22 11:21:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-10-22 11:21:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1279. [2019-10-22 11:21:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-10-22 11:21:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1788 transitions. [2019-10-22 11:21:04,049 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1788 transitions. Word has length 118 [2019-10-22 11:21:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,049 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 1788 transitions. [2019-10-22 11:21:04,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1788 transitions. [2019-10-22 11:21:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-22 11:21:04,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,052 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-10-22 11:21:04,052 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,052 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-10-22 11:21:04,052 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016269974] [2019-10-22 11:21:04,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 11:21:04,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016269974] [2019-10-22 11:21:04,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:04,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480646062] [2019-10-22 11:21:04,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,099 INFO L87 Difference]: Start difference. First operand 1279 states and 1788 transitions. Second operand 3 states. [2019-10-22 11:21:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,284 INFO L93 Difference]: Finished difference Result 2569 states and 3591 transitions. [2019-10-22 11:21:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-22 11:21:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,290 INFO L225 Difference]: With dead ends: 2569 [2019-10-22 11:21:04,291 INFO L226 Difference]: Without dead ends: 1297 [2019-10-22 11:21:04,292 INFO L600 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-10-22 11:21:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-10-22 11:21:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1285. [2019-10-22 11:21:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1285 states. [2019-10-22 11:21:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1797 transitions. [2019-10-22 11:21:04,338 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1797 transitions. Word has length 126 [2019-10-22 11:21:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,338 INFO L462 AbstractCegarLoop]: Abstraction has 1285 states and 1797 transitions. [2019-10-22 11:21:04,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1797 transitions. [2019-10-22 11:21:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-22 11:21:04,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,341 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-10-22 11:21:04,341 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:04,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-10-22 11:21:04,342 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611692694] [2019-10-22 11:21:04,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 11:21:04,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611692694] [2019-10-22 11:21:04,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:04,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755836297] [2019-10-22 11:21:04,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,380 INFO L87 Difference]: Start difference. First operand 1285 states and 1797 transitions. Second operand 3 states. [2019-10-22 11:21:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,568 INFO L93 Difference]: Finished difference Result 2575 states and 3597 transitions. [2019-10-22 11:21:04,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-22 11:21:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,572 INFO L225 Difference]: With dead ends: 2575 [2019-10-22 11:21:04,572 INFO L226 Difference]: Without dead ends: 1291 [2019-10-22 11:21:04,574 INFO L600 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-10-22 11:21:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-10-22 11:21:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1279. [2019-10-22 11:21:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-10-22 11:21:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1785 transitions. [2019-10-22 11:21:04,616 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1785 transitions. Word has length 127 [2019-10-22 11:21:04,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,616 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 1785 transitions. [2019-10-22 11:21:04,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1785 transitions. [2019-10-22 11:21:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-22 11:21:04,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,618 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:04,618 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:04,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-10-22 11:21:04,619 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135095143] [2019-10-22 11:21:04,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-22 11:21:04,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135095143] [2019-10-22 11:21:04,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:04,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63353199] [2019-10-22 11:21:04,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,648 INFO L87 Difference]: Start difference. First operand 1279 states and 1785 transitions. Second operand 3 states. [2019-10-22 11:21:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,815 INFO L93 Difference]: Finished difference Result 2563 states and 3576 transitions. [2019-10-22 11:21:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-10-22 11:21:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,820 INFO L225 Difference]: With dead ends: 2563 [2019-10-22 11:21:04,820 INFO L226 Difference]: Without dead ends: 1291 [2019-10-22 11:21:04,822 INFO L600 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-10-22 11:21:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-10-22 11:21:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1279. [2019-10-22 11:21:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-10-22 11:21:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1767 transitions. [2019-10-22 11:21:04,869 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1767 transitions. Word has length 138 [2019-10-22 11:21:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,869 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 1767 transitions. [2019-10-22 11:21:04,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1767 transitions. [2019-10-22 11:21:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-22 11:21:04,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,872 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:04,872 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-10-22 11:21:04,872 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603481497] [2019-10-22 11:21:04,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-22 11:21:04,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603481497] [2019-10-22 11:21:04,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:04,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331959042] [2019-10-22 11:21:04,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,908 INFO L87 Difference]: Start difference. First operand 1279 states and 1767 transitions. Second operand 3 states. [2019-10-22 11:21:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,088 INFO L93 Difference]: Finished difference Result 2563 states and 3540 transitions. [2019-10-22 11:21:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:05,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-22 11:21:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,093 INFO L225 Difference]: With dead ends: 2563 [2019-10-22 11:21:05,093 INFO L226 Difference]: Without dead ends: 1291 [2019-10-22 11:21:05,095 INFO L600 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-10-22 11:21:05,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-10-22 11:21:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1279. [2019-10-22 11:21:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-10-22 11:21:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1749 transitions. [2019-10-22 11:21:05,145 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1749 transitions. Word has length 139 [2019-10-22 11:21:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,145 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 1749 transitions. [2019-10-22 11:21:05,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1749 transitions. [2019-10-22 11:21:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 11:21:05,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,148 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,148 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:05,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-10-22 11:21:05,149 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185082916] [2019-10-22 11:21:05,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-10-22 11:21:05,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185082916] [2019-10-22 11:21:05,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:05,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321262000] [2019-10-22 11:21:05,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:05,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:05,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:05,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:05,184 INFO L87 Difference]: Start difference. First operand 1279 states and 1749 transitions. Second operand 3 states. [2019-10-22 11:21:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,245 INFO L93 Difference]: Finished difference Result 2533 states and 3460 transitions. [2019-10-22 11:21:05,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:05,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-22 11:21:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,250 INFO L225 Difference]: With dead ends: 2533 [2019-10-22 11:21:05,250 INFO L226 Difference]: Without dead ends: 1261 [2019-10-22 11:21:05,252 INFO L600 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-10-22 11:21:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-10-22 11:21:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1257. [2019-10-22 11:21:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-10-22 11:21:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1721 transitions. [2019-10-22 11:21:05,322 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1721 transitions. Word has length 154 [2019-10-22 11:21:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,323 INFO L462 AbstractCegarLoop]: Abstraction has 1257 states and 1721 transitions. [2019-10-22 11:21:05,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1721 transitions. [2019-10-22 11:21:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 11:21:05,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,325 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,325 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 11:21:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-10-22 11:21:05,326 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888956530] [2019-10-22 11:21:05,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 11:21:05,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888956530] [2019-10-22 11:21:05,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691952745] [2019-10-22 11:21:05,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb250615-ba2a-438a-9147-852eb25d21db/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:21:05,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 11:21:05,485 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 11:21:05,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2131755106] [2019-10-22 11:21:05,520 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 155 [2019-10-22 11:21:05,580 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:21:05,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:21:05,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:05,880 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:21:05,885 INFO L168 Benchmark]: Toolchain (without parser) took 9312.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.9 MB). Free memory was 943.1 MB in the beginning and 1.2 GB in the end (delta: -286.7 MB). Peak memory consumption was 99.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:05,885 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:05,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:05,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:05,886 INFO L168 Benchmark]: Boogie Preprocessor took 35.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:05,886 INFO L168 Benchmark]: RCFGBuilder took 773.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:05,887 INFO L168 Benchmark]: TraceAbstraction took 7976.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -175.2 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:05,889 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 473.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 773.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7976.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -175.2 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...